| /dports/math/ogdf/OGDF/src/ogdf/upward/ |
| H A D | UpwardPlanarSubgraphSimple.cpp | 92 H.delEdge(eH); in call()
180 H.delEdge(eH); in call()
194 H.delEdge(e); in call()
218 H.delEdge(eH); in call()
228 GC.delEdge(GC.copy(*itE)); in call()
280 graphAcyclicTest.delEdge(*itE); in checkAcyclic()
|
| H A D | UpwardPlanarSubgraphModule.cpp | 50 GC.delEdge(eCopy); in callAndDelete()
|
| /dports/biology/bbmap/bbmap/current/consensus/ |
| H A D | BaseNode.java | 211 if(delEdge!=null){bb.comma().append("DEL:").append(delEdge.weightSum);} in toTextWeight()
227 if(delEdge!=null){bb.comma().append("DEL:").append(delEdge.countSum);} in toTextCount()
287 public BaseNode delEdge; field in BaseNode
|
| /dports/math/ogdf/OGDF/src/ogdf/cluster/ |
| H A D | CPlanarSubClusteredGraph.cpp | 103 testG.delEdge(edgeCopy[e]); in call()
123 testG.delEdge(newCopy); in call()
142 testG.delEdge(eH); in call()
|
| H A D | CPlanarEdgeInserter.cpp | 438 m_dualGraph.delEdge(delMe.popFrontRet()); in findShortestPath()
445 m_dualGraph.delEdge(delMe.popFrontRet()); in findShortestPath()
449 m_dualGraph.delEdge(adj->theEdge()); in findShortestPath()
452 m_dualGraph.delEdge(adj->theEdge()); in findShortestPath()
|
| /dports/math/ogdf/OGDF/include/ogdf/graphalg/steiner_tree/ |
| H A D | common_algorithms.h | 148 st.delEdge(save1); in contractTripleInSteinerTree()
149 st.delEdge(save2); in contractTripleInSteinerTree()
151 st.delEdge(save0); in contractTripleInSteinerTree()
152 st.delEdge(save1); in contractTripleInSteinerTree()
|
| H A D | FullComponentStore.h | 221 m_graph.delEdge(comp.start->theEdge());
225 m_graph.delEdge(comp.start->theEdge());
467 this->m_graph.delEdge(e);
|
| /dports/math/ogdf/OGDF/src/ogdf/graphalg/ |
| H A D | GraphReduction.cpp | 46 this->delEdge(e1); in GraphReduction()
94 this->delEdge(e2); in GraphReduction()
119 this->delEdge(e1); in GraphReduction()
|
| H A D | Clusterer.cpp | 141 GC.delEdge(e); in computeClustering()
217 GC.delEdge(e); in computeClustering()
508 GC.delEdge(e); in createClusterGraph()
|
| H A D | MinimumCut.cpp | 83 m_GC.delEdge(e); in contraction()
119 m_GC.delEdge(ei); in contraction()
|
| /dports/math/ogdf/OGDF/include/ogdf/planarity/ |
| H A D | MaximalPlanarSubgraphSimple.h | 120 copy.delEdge(copy.copy(e)); in doCall()
127 copy.delEdge(f); in doCall()
263 copy.delEdge(copy.copy(e)); in doCall()
272 copy.delEdge(f); in doCall()
|
| /dports/math/ogdf/OGDF/src/ogdf/basic/ |
| H A D | GraphCopy.cpp | 106 void GraphCopySimple::delEdge(edge e) { in delEdge() function in ogdf::GraphCopySimple
108 Graph::delEdge(e); in delEdge()
548 Graph::delEdge(crossingEdge); in insertCrossing()
558 void GraphCopy::delEdge(edge e) in delEdge() function in ogdf::GraphCopy
562 Graph::delEdge(e); in delEdge()
608 Graph::delEdge(*it); in removeEdgePathEmbedded()
619 Graph::delEdge(e); in removeEdgePathEmbedded()
649 Graph::delEdge(*it); in removeEdgePath()
656 Graph::delEdge(e); in removeEdgePath()
700 Graph::delEdge(adjB2->theEdge()); in removeUnnecessaryCrossing()
[all …]
|
| H A D | PreprocessorLayout.cpp | 106 G.delEdge(e); in call()
|
| /dports/math/ogdf/OGDF/src/ogdf/layered/ |
| H A D | AcyclicSubgraphModule.cpp | 59 G.delEdge(e); in callAndDelete()
|
| /dports/math/ogdf/OGDF/src/ogdf/cluster/internal/ |
| H A D | MaxCPlanarSub.cpp | 416 GC.delEdge(newEdge);
523 GC->delEdge(e);
568 GC->delEdge(e);
667 G.delEdge(e);
741 G.delEdge(addEdge);
778 G.delEdge(addEdge);
841 GC.delEdge(newEdge);
887 cG->delEdge(e);
948 cG->delEdge(e);
1041 G.delEdge(e);
[all …]
|
| /dports/math/ogdf/OGDF/include/ogdf/basic/ |
| H A D | simple_graph_alg.h | 75 G.delEdge(e); in makeLoopFree()
185 G.delEdge(e); in makeParallelFree()
362 G.delEdge(parEdge);
|
| H A D | GraphCopy.h | 199 virtual void delEdge(edge e) override;
436 virtual void delEdge(edge e) override;
|
| H A D | extended_graph_alg.h | 380 G.delEdge(e); in makeMinimumSpanningTree()
452 graph.delEdge(e); in planarSTEmbed()
|
| /dports/math/ogdf/OGDF/src/ogdf/planarity/ |
| H A D | MMFixedEmbeddingInserter.cpp | 621 m_dual.delEdge(adj->theEdge()); in findShortestPath()
624 m_dual.delEdge(adj->theEdge()); in findShortestPath()
753 m_dual.delEdge(vDual->firstAdj()->theEdge()); in insertEdge()
1085 m_dual.delEdge(adj->theEdge()); in contractSplit()
1109 if(eDCS) m_dual.delEdge(eDCS); in contractSplitIfReq()
1111 if(eDCT) m_dual.delEdge(eDCT); in contractSplitIfReq()
1113 if(eDES) m_dual.delEdge(eDES); in contractSplitIfReq()
1115 if(eDET) m_dual.delEdge(eDET); in contractSplitIfReq()
1123 if(eDual) m_dual.delEdge(eDual); in contractSplitIfReq()
|
| H A D | MMSubgraphPlanarizer.cpp | 93 PG.delEdge(PG.copy(*it)); in doCall()
|
| /dports/math/ogdf/OGDF/test/src/basic/ |
| H A D | graphcopy.cpp | 153 graphCopy->delEdge(graphCopy->chooseEdge()); in describeGraphCopySimple()
227 graphCopy->delEdge(graphCopy->copy(origEdge)); in describeGraphCopySimple()
257 graphCopy->delEdge(delAnEdge); in describeGraphCopySimple()
604 graphCopy->delEdge(copyEdge); in __anondcfebcf61302()
724 AssertThrows(AssertionFailed, graphCopy->delEdge(splittedEdge)); in __anondcfebcf61302()
729 graphCopy->delEdge(graphCopy->copy(eOrig)); in __anondcfebcf61302()
|
| /dports/math/ogdf/OGDF/include/ogdf/graphalg/ |
| H A D | SteinerTreePreprocessing.h | 668 m_copyGraph.delEdge(e); in addNew()
892 m_copyGraph.delEdge(e); in makeSimple()
898 m_copyGraph.delEdge(minCostEdge[adjNode]); in makeSimple()
903 m_copyGraph.delEdge(e); in makeSimple()
966 m_copyGraph.delEdge(e); in leastCostTest()
1047 m_copyGraph.delEdge(e); in terminalDistanceTest()
1116 m_copyGraph.delEdge(e); in longEdgesTest()
1245 m_copyGraph.delEdge(e); in PTmTest()
1690 m_copyGraph.delEdge(e); in deleteEdgesAboveUpperBound()
1920 m_copyGraph.delEdge(e); in cutReachabilityTest()
|
| /dports/math/ogdf/OGDF/include/ogdf/graphalg/steiner_tree/goemans/ |
| H A D | BlowupGraph.h | 288 m_graph.delEdge(adj->theEdge()); in updateSourceAndTargetArcCapacities()
302 m_graph.delEdge(adj->theEdge()); in updateSourceAndTargetArcCapacities()
428 m_graph.delEdge(e); in initCoreWitness()
616 m_graph.delEdge(e); in delEdges()
|
| /dports/math/ogdf/OGDF/src/ogdf/planarity/embedding_inserter/ |
| H A D | FixEdgeInserterCore.cpp | 464 m_dual.delEdge(adj->theEdge()); in findShortestPath()
467 m_dual.delEdge(adj->theEdge()); in findShortestPath()
607 m_dual.delEdge(adj->theEdge()); in findWeightedShortestPath()
610 m_dual.delEdge(adj->theEdge()); in findWeightedShortestPath()
|
| /dports/math/ogdf/OGDF/src/ogdf/simultaneous/ |
| H A D | SimDraw.cpp | 150 GC.delEdge(e); in getBasicGraph()
240 G.delEdge(e2); in getBasicGraphAttributes()
|