Adaptagrams
dialect::Graph Member List

This is the complete list of members for dialect::Graph, including all inherited members.

addBendlessSubnetworkToRoutingAdapter(RoutingAdapter &ra)dialect::Graph
addEdge(Edge_SP edge, bool takeOwnership=true)dialect::Graph
addEdge(Node_SP src, Node_SP tgt)dialect::Graph
addEdge(const id_type &srcID, const id_type &tgtID)dialect::Graph
addNode(Node_SP node, bool takeOwnership=true)dialect::Graph
addNode(void)dialect::Graph
addNode(double w, double h)dialect::Graph
addNode(double cx, double cy, double w, double h)dialect::Graph
applyProjSeq(const ColaOptions &opts, ProjSeq &ps, int accept=0)dialect::Graph
buildRootCluster(const ColaOptions &opts)dialect::Graph
buildRoutes(void)dialect::Graph
buildUniqueBendPoints(void)dialect::Graph
clearAllConstraints(void)dialect::Graph
clearAllRoutes(void)dialect::Graph
cloneNode(id_type id)dialect::Graph
computeAvgNodeDim(void) constdialect::Graph
destress(const ColaOptions &opts)dialect::Graph
destress(void)dialect::Graph
getBoundingBox(const NodesById &ignore=NodesById(), bool includeBends=false) constdialect::Graph
getChainsAndCycles(std::vector< std::deque< Node_SP >> &chains, std::vector< std::deque< Node_SP >> &cycles)dialect::Graph
getColaGraphRep(void)dialect::Graphinline
getConnComps(void) constdialect::Graph
getEdgeBySrcIdTgtIdLookup(void) constdialect::Graph
getEdgeLookup(void) constdialect::Graphinline
getEdgeThickness(void)dialect::Graphinline
getIEL(void)dialect::Graph
getMaxDegree(void) constdialect::Graph
getNode(const id_type &id) constdialect::Graph
getNodeLookup(void) constdialect::Graphinline
getNodeLookupWithIgnore(const Nodes &ignore) constdialect::Graph
getNodeLookupWithIgnore(const NodesById &ignore) constdialect::Graph
getNumEdges(void) constdialect::Graphinline
getNumNodes(void) constdialect::Graphinline
getSepMatrix(void)dialect::Graphinline
Graph(void)dialect::Graphinline
Graph(const Graph &G)dialect::Graph
hasEdge(const id_type &id) constdialect::Graph
hasNode(const id_type &id) constdialect::Graph
hasSameLayoutAs(const Graph &other, double tol=0.001, id_map *idMap=nullptr) constdialect::Graph
isEmpty(void) constdialect::Graphinline
isTree(void) constdialect::Graphinline
makeFeasible(const ColaOptions &opts)dialect::Graph
operator=(const Graph other)dialect::Graph
padAllNodes(double dw, double dh)dialect::Graph
popNodePositions(void)dialect::Graph
project(const ColaOptions &opts, vpsc::Dim dim, int accept=0)dialect::Graph
projectOntoSepCo(const ColaOptions &opts, SepCo_SP sepco, int accept=0)dialect::Graph
pushNodePositions(void)dialect::Graph
putInBasePosition(void)dialect::Graph
recomputeIEL(void)dialect::Graph
removeNode(const dialect::Node &node)dialect::Graph
removeNodes(const NodesById &nodes)dialect::Graph
rotate180(void)dialect::Graph
rotate90acw(ColaOptions *opts=nullptr)dialect::Graph
rotate90cw(ColaOptions *opts=nullptr)dialect::Graph
route(Avoid::RouterFlag routingType)dialect::Graph
setCorrespondingConstraints(Graph &H)dialect::Graph
setEdgeThickness(double t)dialect::Graphinline
setPosesInCorrespNodes(Graph &H)dialect::Graph
setRoutesInCorrespEdges(Graph &H, bool directed=false)dialect::Graph
severAndRemoveNode(const dialect::Node &node)dialect::Graph
severAndRemoveNode(id_type nodeID)dialect::Graph
severEdge(dialect::Edge &edge)dialect::Graph
severNode(const dialect::Node &node)dialect::Graph
severNodeNotingNeighbours(const dialect::Node &node)dialect::Graph
solidifyAlignedEdges(vpsc::Dim dim, const ColaOptions &opts)dialect::Graph
swap(Graph &first, Graph &second)dialect::Graphfriend
translate(double dx, double dy)dialect::Graph
updateColaGraphRep(void)dialect::Graph
updateNodesFromRects(bool xAxis=true, bool yAxis=true)dialect::Graph
writeId2Ix(void) constdialect::Graph
writeIx2Id(void) constdialect::Graph
writeSvg(bool useExternalIds=false) constdialect::Graph
writeTglf(bool useExternalIds=false) constdialect::Graph
~Graph(void)dialect::Graph