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) const | dialect::Graph | |
destress(const ColaOptions &opts) | dialect::Graph | |
destress(void) | dialect::Graph | |
getBoundingBox(const NodesById &ignore=NodesById(), bool includeBends=false) const | dialect::Graph | |
getChainsAndCycles(std::vector< std::deque< Node_SP >> &chains, std::vector< std::deque< Node_SP >> &cycles) | dialect::Graph | |
getColaGraphRep(void) | dialect::Graph | inline |
getConnComps(void) const | dialect::Graph | |
getEdgeBySrcIdTgtIdLookup(void) const | dialect::Graph | |
getEdgeLookup(void) const | dialect::Graph | inline |
getEdgeThickness(void) | dialect::Graph | inline |
getIEL(void) | dialect::Graph | |
getMaxDegree(void) const | dialect::Graph | |
getNode(const id_type &id) const | dialect::Graph | |
getNodeLookup(void) const | dialect::Graph | inline |
getNodeLookupWithIgnore(const Nodes &ignore) const | dialect::Graph | |
getNodeLookupWithIgnore(const NodesById &ignore) const | dialect::Graph | |
getNumEdges(void) const | dialect::Graph | inline |
getNumNodes(void) const | dialect::Graph | inline |
getSepMatrix(void) | dialect::Graph | inline |
Graph(void) | dialect::Graph | inline |
Graph(const Graph &G) | dialect::Graph | |
hasEdge(const id_type &id) const | dialect::Graph | |
hasNode(const id_type &id) const | dialect::Graph | |
hasSameLayoutAs(const Graph &other, double tol=0.001, id_map *idMap=nullptr) const | dialect::Graph | |
isEmpty(void) const | dialect::Graph | inline |
isTree(void) const | dialect::Graph | inline |
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::Graph | inline |
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::Graph | friend |
translate(double dx, double dy) | dialect::Graph | |
updateColaGraphRep(void) | dialect::Graph | |
updateNodesFromRects(bool xAxis=true, bool yAxis=true) | dialect::Graph | |
writeId2Ix(void) const | dialect::Graph | |
writeIx2Id(void) const | dialect::Graph | |
writeSvg(bool useExternalIds=false) const | dialect::Graph | |
writeTglf(bool useExternalIds=false) const | dialect::Graph | |
~Graph(void) | dialect::Graph | |