/dports/math/ogdf/OGDF/test/src/planarity/ |
H A D | embedder.cpp | 33 for(adjEntry adj : v->adjEntries) { in shuffleEmbedding() 46 adjEntry adjExternal = graph.numberOfNodes() == 0 ? nullptr : graph.firstNode()->firstAdj(); in testEmbedder() 78 adjEntry adjExternal; in __anon8c01ded30102()
|
/dports/math/ogdf/OGDF/src/ogdf/basic/ |
H A D | AdjacencyOracle.cpp | 55 for (adjEntry adj : v->adjEntries) { 75 for (adjEntry adj : v->adjEntries) { in adjacent()
|
H A D | extended_graph_alg.cpp | 63 for(adjEntry adj : v->adjEntries) { in cConnectTest() 185 for(adjEntry adj : vo->adjEntries) { in recursiveConnect() 245 for(adjEntry adj : v->adjEntries) { in dfsMakeCConnected() 354 for(adjEntry adj : vo->adjEntries) { in recursiveCConnect() 424 for(adjEntry adj : v->adjEntries) { in cconnect()
|
/dports/math/ogdf/OGDF/include/ogdf/planarlayout/ |
H A D | BitonicOrdering.h | 50 BitonicOrdering(Graph& G, adjEntry adj_st_edge); 74 adjEntry getAdjST(node v_T) const;
|
/dports/math/ogdf/OGDF/src/ogdf/layered/ |
H A D | DfsAcyclicSubgraph.cpp | 105 for(adjEntry adj : v->adjEntries) { in callUML() 147 for(adjEntry adj : v->adjEntries) { in dfsFindHierarchies() 171 for(adjEntry adj : v->adjEntries) { in dfsBackedgesHierarchies()
|
H A D | OptimalHierarchyLayout.cpp | 160 for(adjEntry adj : v->adjEntries) { in computeXCoordinates() 246 for(adjEntry adj : v->adjEntries) { in computeXCoordinates() 258 for(adjEntry adj : v->adjEntries) { in computeXCoordinates() 415 for(adjEntry adj : v->adjEntries) { in computeXCoordinates() 443 for(adjEntry adj : v->adjEntries) { in computeXCoordinates() 585 for(adjEntry adj : v->adjEntries) { in computeYCoordinates()
|
/dports/math/ogdf/OGDF/include/ogdf/cluster/ |
H A D | ClusterOrthoLayout.h | 59 void call(ClusterPlanRep &PG, adjEntry adjExternal, Layout &drawing); 64 adjEntry adjExternal,
|
/dports/math/ogdf/OGDF/src/ogdf/planarity/ |
H A D | ExtractKuratowskis.cpp | 145 NodeArray<adjEntry> m_parent; 148 ArrayBuffer<adjEntry> stack; 191 for (adjEntry adj : start->adjEntries) { in init() 222 adjEntry adj = stack.popRet(); in addNextPath() 263 for (adjEntry adjV : v->adjEntries) { in addNextPath() 289 adjEntry adj = stack.popRet(); in addNextPathExclude() 338 for(adjEntry adjV : v->adjEntries) { in addNextPathExclude() 574 adjEntry resultAdj = nullptr; in adjToLowestNodeBelow() 575 for (adjEntry adj : high->adjEntries) { in adjToLowestNodeBelow() 593 adjEntry adj = m_adjParent[bottom]; in addDFSPath() [all …]
|
/dports/math/ogdf/OGDF/include/ogdf/basic/ |
H A D | EdgeArray.h | 197 const T &operator[](adjEntry adj) const { 203 T &operator[](adjEntry adj) { 209 const T &operator()(adjEntry adj) const { in operator() 215 T &operator()(adjEntry adj) { in operator()
|
H A D | extended_graph_alg.h | 93 for(adjEntry adj : w->adjEntries) in inducedSubGraph() 140 for(adjEntry adj : w->adjEntries) in inducedSubGraph() 181 for(adjEntry adj : v->adjEntries) in inducedSubgraph() 296 for (adjEntry adj = v->firstAdj(); adj; adj = adj->succ()) { in computeMinST()
|
H A D | precondition.h | 60 for(adjEntry adj : v->adjEntries) { in dfsGenTreeRec() 95 for(adjEntry adj : v->adjEntries) { in firstOutGen()
|
/dports/math/ogdf/OGDF/include/ogdf/uml/ |
H A D | OrthoLayoutUML.h | 53 virtual void call(PlanRepUML &PG, adjEntry adjExternal, Layout &drawing) override; 154 void classifyEdges(PlanRepUML &PG, adjEntry &adjExternal);
|
H A D | PlanRepUML.h | 92 bool alignUpward(adjEntry ae) {return m_alignUpward[ae];} in alignUpward() 93 void alignUpward(adjEntry ae, bool b) {m_alignUpward[ae] = b;} in alignUpward()
|
/dports/math/ogdf/OGDF/include/ogdf/graphalg/ |
H A D | MaxFlowSTPlanarItaiShiloach.h | 101 adjEntry m_commonFaceAdj; 158 adjEntry secondCommonAdj; in computeValue() 224 adjEntry initialAdj; in findUppermostPath() 238 for(adjEntry adj = initialAdj; in findUppermostPath()
|
H A D | MinSTCutMaxFlow.h | 221 for (adjEntry adj : v->adjEntries) { in markCut() 270 adjEntry startAdj = startNode->firstAdj(); in computeCut() 277 for (adjEntry adj = (m_primaryCut ? startAdj->cyclicSucc() : startAdj->cyclicPred()); in computeCut() 300 for (adjEntry adj = (m_primaryCut ? startAdj->cyclicSucc() : startAdj->cyclicPred()); in computeCut()
|
/dports/math/ogdf/OGDF/src/ogdf/energybased/multilevel_mixer/ |
H A D | LocalBiconnectedMerger.cpp | 70 for(adjEntry adj : parent->adjEntries) { in canMerge() 82 for(adjEntry adj : mergePartner->adjEntries) { in canMerge() 101 for(adjEntry adj : temp->adjEntries) { in canMerge() 136 for(adjEntry adj : temp->adjEntries) { in canMerge()
|
H A D | IndependentSetMerger.cpp | 65 for(adjEntry adj : ISnode->adjEntries) { in buildAllLevels() 129 for(adjEntry adj : bfsNode->adjEntries) { in prebuildLevel() 182 for(adjEntry adj : bfsNode->adjEntries) { in buildOneLevel()
|
/dports/math/ogdf/OGDF/src/ogdf/orthogonal/ |
H A D | EdgeRouter.cpp | 309 adjEntry fa = infos[v].firstAdj(); in call() 1273 adjEntry ae = vinfo->m_corner[0]; in set_corners() 1836 adjEntry ae; //"outgoing" from cage in place() 1853 adjEntry saveadj = ae; in place() 2032 adjEntry ae; //"outgoing" from cage in place() 2048 adjEntry adjsave = ae; in place() 2219 adjEntry ae; //"outgoing" from cage in place() 2235 adjEntry saveadj = ae; in place() 2420 adjEntry saveadj = ae; in place() 2866 adjEntry m_corner[4]; in initialize_node_info() [all …]
|
/dports/math/ogdf/OGDF/src/ogdf/energybased/fast_multipole_embedder/ |
H A D | GalaxyMultilevel.cpp | 48 for (adjEntry adj : v->adjEntries) in computeSystemMass() 80 for(adjEntry adj : v->adjEntries) in labelSystem() 205 adjEntry adj = v->firstAdj(); in createResult()
|
/dports/math/ogdf/OGDF/include/ogdf/orthogonal/edge_router/ |
H A D | NodeInfo.h | 82 adjEntry adj, in NodeInfo() 294 adjEntry& firstAdj() { return m_firstAdj; } in firstAdj() 314 adjEntry m_firstAdj; //adjEntry of first encountered outgoing edge, note: this is a copy 319 adjEntry m_adj; //entry of inner cage face
|
/dports/math/ogdf/OGDF/include/ogdf/planarity/ |
H A D | ExtractKuratowskis.h | 184 const NodeArray<adjEntry>& m_adjParent; 189 const SListPure<adjEntry>& externPath) { in addExternalFacePath() 190 SListConstIterator<adjEntry> itExtern; in addExternalFacePath() 199 inline adjEntry adjToLowestNodeBelow(node high, int low);
|
/dports/math/ogdf/OGDF/src/ogdf/energybased/ |
H A D | TutteLayout.cpp | 114 for(adjEntry adj : maxFace->entries) { in setFixedNodes() 316 for(adjEntry adj : v->adjEntries) { in doCall() 330 for(adjEntry adj : v->adjEntries) { in doCall() 346 for(adjEntry adj : v->adjEntries) { in doCall()
|
/dports/math/ogdf/OGDF/src/ogdf/graphalg/ |
H A D | ModifiedNibbleClusterer.cpp | 48 for(adjEntry adj : v->adjEntries) { in call() 178 for(adjEntry adj : next->adjEntries){ in findBestCluster() 199 for(adjEntry adj : t->adjEntries){ in findBestCluster() 313 for(adjEntry adj : v->adjEntries) { in spreadValues()
|
/dports/math/ogdf/OGDF/include/ogdf/upward/ |
H A D | FaceSinkGraph.h | 126 void sinkSwitches(FaceArray< List<adjEntry> > &faceSwitches); 178 FaceArray< List<adjEntry> > &faceSwitches,
|
/dports/math/ogdf/OGDF/src/ogdf/cluster/ |
H A D | ClusterOrthoLayout.cpp | 69 adjEntry adjExternal, in call() 82 adjEntry adjExternal, in call() 118 adjEntry extAdj = nullptr; in call()
|