Home
last modified time | relevance | path

Searched refs:adjEntry (Results 51 – 75 of 300) sorted by relevance

12345678910>>...12

/dports/math/ogdf/OGDF/src/ogdf/cluster/
H A DCconnectClusterPlanarEmbed.cpp314 adjEntry adj = e->adjSource(); in copyEmbedding()
389 SListPure<adjEntry> embedding; in copyEmbedding()
468 adjEntry firstAdj = nullptr; in hubControl()
469 adjEntry secAdj = nullptr; in hubControl()
922 SListIterator<adjEntry> it; in recursiveEmbed()
1102 adjEntry adj = w->firstAdj(); in planarityTest()
1191 SListPure<adjEntry> adjList; in planarityTest()
1193 for(adjEntry a : w->adjEntries) in planarityTest()
1257 NodeArray<SListPure<adjEntry> > in preparation()
1770 SListIterator<adjEntry> it; in entireEmbed()
[all …]
H A DCPlanarEdgeInserter.cpp168 SList<adjEntry> crossed; in call()
254 for(adjEntry adjE : f->entries) in deriveFaceCluster()
308 SList<adjEntry> &crossed, in findShortestPath()
322 SList<adjEntry> bestCrossed; in findShortestPath()
323 SList<adjEntry> currentCrossed; in findShortestPath()
328 for(adjEntry adjE : s->adjEntries) in findShortestPath()
334 for(adjEntry adjE : t->adjEntries) in findShortestPath()
423 for(adjEntry adj : bestCrossed) { in findShortestPath()
469 const SList<adjEntry> &crossed) in insertEdge()
477 for(adjEntry adj : crossed) in insertEdge()
[all …]
/dports/math/ogdf/OGDF/src/ogdf/basic/
H A DGraph.cpp314 adjEntry adj; in constructInitByNodes()
498 edge Graph::createEdgeElement(node v, node w, adjEntry adjSrc, adjEntry adjTgt) in createEdgeElement()
594 edge Graph::newEdge(adjEntry adjStart, adjEntry adjEnd, Direction dir) in newEdge()
681 adjEntry adjSrc, in move()
683 adjEntry adjTgt, in move()
715 adjEntry adj = e->m_adjTgt; in moveTarget()
730 adjEntry adj = e->m_adjTgt; in moveTarget()
1041 adjEntry adj = adj1; in genus()
1228 node Graph::splitNode(adjEntry adjStartLeft, adjEntry adjStartRight) in splitNode()
1238 adjEntry adj, adjSucc; in splitNode()
[all …]
H A DGraphCopy.cpp316 List<adjEntry> newAdjOrder; in setOriginalEmbedding()
422 adjEntry adjSrc, adjTgt; in insertEdgePathEmbedded()
430 adjEntry adj = *it; in insertEdgePathEmbedded()
675 adjEntry adjA1, in removeUnnecessaryCrossing()
676 adjEntry adjA2, in removeUnnecessaryCrossing()
677 adjEntry adjB1, in removeUnnecessaryCrossing()
678 adjEntry adjB2) in removeUnnecessaryCrossing()
727 adjEntry adj1 = v->firstAdj(); in removePseudoCrossings()
728 adjEntry adj2 = adj1->succ(); in removePseudoCrossings()
729 adjEntry adj3 = adj2->succ(); in removePseudoCrossings()
[all …]
H A Dsimple_graph_alg.cpp43 adjEntry adj = v->firstAdj(); in removeSelfLoops()
44 adjEntry adjPrev = nullptr; in removeSelfLoops()
143 for(adjEntry adj : v->adjEntries) { in isConnected()
178 for(adjEntry adj : v->adjEntries) { in makeConnected()
220 for(adjEntry adj : w->adjEntries) { in connectedComponents()
283 for (adjEntry adj : v->adjEntries) { in buildDfsTree()
469 for (adjEntry adj : v->adjEntries) { in isIsolated()
508 ListPure<adjEntry> *adjEntries; in biconnectedComponents()
779 adjEntry succ, succ2, succ3; in triangulate()
1013 for(adjEntry adj : s->adjEntries) { in isStGraph()
[all …]
/dports/math/ogdf/OGDF/src/ogdf/planarity/
H A DPlanarizationLayout.cpp78 adjEntry adjExternal; in call()
92 for(adjEntry adj : vG->adjEntries) { in call()
156 adjEntry adjExternal; in call()
195 adjEntry adjRunner = adjBoundary; in call()
270 adjEntry adRun = w->firstAdj(); in call()
288 for(adjEntry adj : vG->adjEntries) { in call()
344 adjEntry adjRun = cCopy->firstAdj(); in fillAdjNodes()
372 adjEntry adjURun = uCopy->firstAdj(); in fillAdjNodes()
461 adjEntry adjExternal; in callSimDraw()
475 for(adjEntry adj : vG->adjEntries) { in callSimDraw()
[all …]
H A DMMVariableEmbeddingInserter.cpp456 adjEntry adj = nullptr; in prepareAnchorNode()
501 adjEntry adjA[2]; in prepareAnchorNode()
588 adjEntry adjPath, in preparePath()
614 adjEntry adjSrc, in findPseudos()
903 SList<adjEntry> &addLeft,
904 SList<adjEntry> &addRight,
1131 SList<adjEntry> &addLeft, in reconstructInsertionPath()
1158 adjEntry adj; in reconstructInsertionPath()
1183 adjEntry adj; in reconstructInsertionPath()
1218 adjEntry adj; in reconstructInsertionPath()
[all …]
H A DEmbedderMaxFace.cpp40 void EmbedderMaxFace::doCall(Graph& G, adjEntry& adjExternal) in doCall()
64 for(adjEntry adj : rootBlockNode->adjEntries) { in doCall()
72 for(adjEntry adjCT : cT->adjEntries) { in doCall()
108 for(adjEntry adj : bT->adjEntries) { in computeBlockGraphs()
114 for(adjEntry adjCT : cT->adjEntries) { in computeBlockGraphs()
172 ListIterator<adjEntry> after; in embedBlock()
181 ListIterator<adjEntry>& after) in embedBlock()
/dports/math/ogdf/OGDF/include/ogdf/upward/internal/
H A DUpSAT.h74 bool embedUpwardPlanar(adjEntry& externalToItsRight,NodeArray<int> *nodeOrder = nullptr);
89 void sortBySigma(List<adjEntry> &adjList, const Minisat::Model &model);
90 void embedFromModel(const Minisat::Model &model, adjEntry& externalToItsRight);
91 bool OE(bool embed, adjEntry& externalToItsRight, NodeArray<int> *nodeOrder);
93 bool HL(bool embed, adjEntry& externalToItsRight, NodeArray<int> *nodeOrder);
/dports/math/ogdf/OGDF/src/ogdf/planarlayout/mixed_model_layout/
H A DIOPoints.cpp65 adjEntry adj = v->firstAdj(); in restoreDeg1Nodes()
71 adjEntry IOPoints::switchBeginIn(node v) in switchBeginIn()
77 adjEntry adj; in switchBeginIn()
86 adjEntry IOPoints::switchEndIn(node v) in switchEndIn()
92 adjEntry adj; in switchEndIn()
106 adjEntry adj = (*Lout.begin()).m_adj; in switchBeginOut()
116 adjEntry adj = (*Lout.rbegin()).m_adj; in switchEndOut()
/dports/math/ogdf/OGDF/src/ogdf/upward/internal/
H A DUpwardPlanarityEmbeddedDigraph.cpp61 for (adjEntry adj : u->adjEntries) { in getPath()
82 adjEntry adj_u = nullptr; in getMin()
83 for (adjEntry adj : v->adjEntries) { in getMin()
106 for (adjEntry adj : v->adjEntries) { in isFlow()
136 adjEntry adj_u = nullptr; in isFlow()
137 for(adjEntry adj : v->adjEntries) { in isFlow()
149 for (adjEntry adj : m_s->adjEntries) { in isFlow()
211 void UpwardPlanarityEmbeddedDigraph::isUpwardPlanarEmbedded(bool val, List<adjEntry> &possibleExter… in isUpwardPlanarEmbedded()
220 for(adjEntry adj : f->entries) { in isUpwardPlanarEmbedded()
283 List<adjEntry> possibleExternalFaces; in isUpwardPlanarEmbedded()
[all …]
H A DUpSAT.cpp79 for(adjEntry adj : x->adjEntries) { in computeDominatingEdges()
489 ListIterator<adjEntry> it = adjList.begin(); in sortBySigma()
493 adjEntry adjFirst = *it; in sortBySigma()
494 adjEntry adjMin = adjFirst; in sortBySigma()
495 adjEntry adj; in sortBySigma()
518 ListIterator<adjEntry> itCnt = adjList.get(i-1); in sortBySigma()
537 List<adjEntry> inc; in embedFromModel()
538 List<adjEntry> out; in embedFromModel()
539 for(adjEntry adj : v->adjEntries) { in embedFromModel()
548 List<adjEntry> finalList; in embedFromModel()
[all …]
H A DUpwardPlanaritySingleSource.cpp254 for(adjEntry adj : child->adjEntries) { in checkEdge()
461 adjEntry adj1 = nullptr; in testBiconnectedComponent()
462 for(adjEntry adj : s->adjEntries) { in testBiconnectedComponent()
510 for(adjEntry adj : v->adjEntries) { in testBiconnectedComponent()
632 for(adjEntry adj : vT->adjEntries) { in computeDegreesInPertinent()
673 for(adjEntry adj : src->adjEntries) { in computeDegreesInPertinent()
690 for(adjEntry adj : tgt->adjEntries) { in computeDegreesInPertinent()
909 for(adjEntry adj : f->entries) { in directSkeletons()
998 adjEntry adjTwin = adj->twin(); in embedSkeleton()
1088 adjEntry adj = e->adjSource(); in embedSkeleton()
[all …]
/dports/math/ogdf/OGDF/src/ogdf/planarlayout/
H A DTriconnectedShellingOrder.cpp64 node getOuterNodeDeg2(face f, NodeArray<adjEntry>& adjPred, NodeArray<adjEntry>& adjSucc);
269 adjEntry adjRun = firstAdj; in initOuterNodes()
275 for(adjEntry adjV : v->adjEntries){ in initOuterNodes()
295 adjEntry adjRun = firstAdj; in initOuterEdges()
313 node ComputeTricOrder::getOuterNodeDeg2(face f, NodeArray<adjEntry>& adjPred, NodeArray<adjEntry>& … in getOuterNodeDeg2()
433 adjEntry adj, in doCall()
464 for (adjEntry fhAdj : fh->entries) in doCall()
472 for(adjEntry vhAdj : vh->adjEntries) in doCall()
478 adjEntry firstAdj = outerFace->firstAdj(); in doCall()
493 NodeArray<adjEntry> adjPred(G), in doCall()
[all …]
/dports/math/ogdf/OGDF/include/ogdf/graphalg/steiner_tree/
H A DFullComponentStore.h229 for (adjEntry adj : v->adjEntries) {
285 adjEntry start(int i) const
306 adjEntry start = m_components[i].start;
313 ArrayBuffer<adjEntry> stack(2*size - 2);
316 const adjEntry back = stack.popRet()->twin();
331 foreachAdjEntry(id, [&](adjEntry back) {
340 foreachAdjEntry(id, [&](adjEntry back) {
354 adjEntry start = m_components[id].start;
357 for (adjEntry adj : c->adjEntries) {
368 foreachAdjEntry(id, [&](adjEntry back) {
[all …]
/dports/math/ogdf/OGDF/src/ogdf/augmentation/
H A DPlanarAugmentationFix.cpp63 for(adjEntry nAdj : n->adjEntries) in doCall()
81 adjEntry adjOuterFace = nullptr; in doCall()
87 adjEntry adjFace = adjFirst; in doCall()
138 for(adjEntry nAdj : n->adjEntries) { in doCall()
161 for(adjEntry adj : v->adjEntries) { in doCall()
284 adjEntry adjV1, adjV2; in augment()
446 adjEntry adj = cutV->firstAdj(); in findMatching()
559 adjEntry adj = cutV->firstAdj(); in findMatchingRev()
676 adjEntry adjRun = cutV->firstAdj(); in connectSingleLabel()
689 adjEntry adj = adjRun->twin(); in connectSingleLabel()
[all …]
/dports/math/ogdf/OGDF/include/ogdf/planarity/embedding_inserter/
H A DFixEdgeInserterCore.h67 void findShortestPath(const CombinatorialEmbedding &E, edge eOrig, SList<adjEntry> &crossed);
68 …void findWeightedShortestPath(const CombinatorialEmbedding &E, edge eOrig, SList<adjEntry> &crosse…
71 void insertEdge(CombinatorialEmbedding &E, edge eOrig, const SList<adjEntry> &crossed);
82 virtual void insertEdgesIntoDual(const CombinatorialEmbedding &E, adjEntry adjSrc);
93 …EdgeArray<adjEntry> m_primalAdj; //!< Adjacency entry in primal graph corresponding to edge in d…
123 void insertEdgesIntoDual(const CombinatorialEmbedding &E, adjEntry adjSrc) override;
/dports/math/ogdf/OGDF/include/ogdf/cluster/
H A DClusterGraph.h80 ListContainer<adjEntry, ClusterElement> adjEntries;
108 List<adjEntry> &getAdjEntries() { in getAdjEntries()
230 for(ogdf::ListConstIterator<adjEntry> ogdf_loop_var=(c)->firstAdj();\
237 for(ogdf::ListConstIterator<adjEntry> ogdf_loop_var=(c)->lastAdj();\
248 inline bool test_forall_adj_entries_of_cluster(ListConstIterator<adjEntry> &it, adjEntry &adj) in test_forall_adj_entries_of_cluster()
256 adjEntry adj = (*it); in test_forall_adj_edges_of_cluster()
261 inline bool test_forall_adj_edges_of_cluster(adjEntry &adj, edge &e) in test_forall_adj_edges_of_cluster()
514 adjEntry adj = w->firstAdj(); in collapse()
517 adjEntry succ = adj->succ(); in collapse()
664 for(adjEntry adj : c->adjEntries) in adjEntries()
[all …]
/dports/math/ogdf/OGDF/src/ogdf/graphalg/
H A DMinimumCut.cpp77 adjEntry adj = s->firstAdj(); in contraction()
80 adjEntry succ = adj->succ(); in contraction()
105 for(adjEntry adjT : t->adjEntries) { in contraction()
169 for(adjEntry adj : v->adjEntries) { in minimumCutPhase()
230 for(adjEntry a : maxWeightNode->adjEntries) { in minimumCutPhase()
235 for(adjEntry a : maxWeightNodePq->adjEntries) { in minimumCutPhase()
246 for(adjEntry t_adj : t->adjEntries) { in minimumCutPhase()
310 for(adjEntry adj : v->adjEntries) { in cutEdges()
/dports/math/ogdf/OGDF/src/ogdf/upward/
H A DFUPSSimple.cpp79 adjEntry extFaceHandle = nullptr; in computeFUPS()
121 adjEntry adjNext = ff->firstAdj(); in computeFUPS()
135 adjEntry extFaceHandle_cur = getAdjEntry(Beta, FUPSCopy.copy(s_orig), Beta.externalFace()); in computeFUPS()
136 adjEntry adj_orig = FUPSCopy.original(extFaceHandle_cur->theEdge())->adjSource(); in computeFUPS()
173 for(adjEntry adj : s->adjEntries) { in getSpanTree()
176 for(adjEntry adjTmp : adj->theEdge()->target()->adjEntries) { in getSpanTree()
188 for(adjEntry adj : start->adjEntries) { in getSpanTree()
234 bool FUPSSimple::constructMergeGraph(GraphCopy &M, adjEntry adj_orig, const List<edge> &orig_edges) in constructMergeGraph()
239 adjEntry ext_adj = M.copy(adj_orig->theEdge())->adjSource(); in constructMergeGraph()
246 adjEntry adjNext = ff->firstAdj(); in constructMergeGraph()
/dports/math/ogdf/OGDF/include/ogdf/planarity/
H A DPlanRep.h66 Deg1RestoreInfo(edge eOrig, node deg1Orig, adjEntry adjRef) in Deg1RestoreInfo()
159 adjEntry expandAdj(node v) const { in expandAdj()
163 adjEntry& expandAdj(node v) { in expandAdj()
177 adjEntry boundaryAdj(node v) const { in boundaryAdj()
185 adjEntry& boundaryAdj(node v){ in boundaryAdj()
583 void insertBoundary(node center, adjEntry& adjExternal);
622 edge newCopy(node v, adjEntry adjAfter, edge eOrig);
647 void insertEdgePath(edge eOrig, const SList<adjEntry> &crossedEdges);
653 const SList<adjEntry> &crossedEdges);
742 NodeArray<adjEntry> m_expandAdj;
[all …]
/dports/math/ogdf/OGDF/src/ogdf/uml/
H A DPlanarizationLayoutUML.cpp90 adjEntry adjExternal = nullptr; in doSimpleCall()
109 for(adjEntry adj : vG->adjEntries) { in doSimpleCall()
207 adjEntry adjExternal = nullptr; in call()
237 for(adjEntry adj : vG->adjEntries) { in call()
332 adjEntry adjOut = nullptr; in findBestExternalFace()
333 for(adjEntry adj : v->adjEntries) { in findBestExternalFace()
345 for(adjEntry adj2 : w->adjEntries) { in findBestExternalFace()
396 for(adjEntry adj : v->adjEntries) { in arrangeCCs()
465 adjEntry adjExternal = 0;
544 for(adjEntry adj : vG->adjEntries)
[all …]
/dports/math/ogdf/OGDF/include/ogdf/upward/
H A DFUPSSimple.h63 adjEntry getAdjEntry(const CombinatorialEmbedding &Gamma, node v, face f) in getAdjEntry()
65 adjEntry adjFound = nullptr; in getAdjEntry()
66 for(adjEntry adj : v->adjEntries) { in getAdjEntry()
117 …adjEntry adj_orig, // the adjEntry of the original graph, which right face is the ext. Face and ad…
/dports/math/ogdf/OGDF/include/ogdf/graphalg/
H A DMaxFlowGoldbergTarjan.h82 inline bool isAdmissible(const adjEntry adj) const in isAdmissible()
176 void push(const adjEntry adj) in push()
205 for(adjEntry adj : w->adjEntries) { in globalRelabel()
223 for(adjEntry adj : v->adjEntries) { in relabel()
239 for(adjEntry adj : v->adjEntries) { in relabelStage2()
288 NodeArray<adjEntry> curr(*this->m_G); in computeValue()
304 for(adjEntry adj : (*this->m_s)->adjEntries) { in computeValue()
313 adjEntry &adj = curr[v]; in computeValue()
373 for(adjEntry adj : (*this->m_t)->adjEntries) { in computeValue()
389 NodeArray<adjEntry> curr(*this->m_G); in computeValue()
[all …]
/dports/math/ogdf/OGDF/src/ogdf/energybased/multilevel_mixer/
H A DSolarMerger.cpp44 for(adjEntry adj : v->adjEntries) { in calcSystemMass()
72 for(adjEntry adj : sun->adjEntries) { in selectSuns()
85 for(adjEntry adj : sun->adjEntries) { in selectSuns()
106 for(adjEntry adj : rndNode->adjEntries) { in selectSuns()
149 for(adjEntry adj : minNode->adjEntries) { in selectSuns()
160 std::vector<adjEntry> planets; in selectSuns()
162 for(adjEntry adj : v->adjEntries) { in selectSuns()
251 for(adjEntry adj : object->adjEntries) { in distanceToSun()
364 for(adjEntry adj : sun->adjEntries) { in collapseSolarSystem()
372 for(adjEntry adj : sun->adjEntries) { in collapseSolarSystem()
[all …]

12345678910>>...12