Home
last modified time | relevance | path

Searched refs:existsEdge (Results 1 – 25 of 34) sorted by relevance

12

/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/testunits/module_BASE/
H A DSpanningForestPrimTestSuite.h85 TS_ASSERT_EQUALS(g2.existsEdge(id1, id2), true) in test1()
86 TS_ASSERT_EQUALS(g2.existsEdge(id1, id6), true) in test1()
87 TS_ASSERT_EQUALS(g2.existsEdge(id2, id4), true) in test1()
88 TS_ASSERT_EQUALS(g2.existsEdge(id3, id4), true) in test1()
89 TS_ASSERT_EQUALS(g2.existsEdge(id5, id6), true) in test1()
90 TS_ASSERT_EQUALS(g2.existsEdge(id7, id8), true) in test1()
91 TS_ASSERT_EQUALS(g2.existsEdge(id8, id10), true) in test1()
92 TS_ASSERT_EQUALS(g2.existsEdge(id9, id10), true) in test1()
93 TS_ASSERT_EQUALS(g2.existsEdge(id10, id11), true) in test1()
H A DUndiGraphTestSuite.h166 TS_ASSERT(graph.existsEdge(id3, id5)) in testAddDelNodes_2()
167 TS_ASSERT(graph.existsEdge(id5, id3)) in testAddDelNodes_2()
201 TS_ASSERT(!graph.existsEdge(2, 4)) in testRemoveNodesFunky_1()
202 TS_ASSERT(!graph.existsEdge(3, 4)) in testRemoveNodesFunky_1()
203 TS_ASSERT(!graph.existsEdge(4, 1)) in testRemoveNodesFunky_1()
209 TS_ASSERT(graph.existsEdge(0, 2)) in testAddDelEdges_1()
210 TS_ASSERT(graph.existsEdge(2, 4)) in testAddDelEdges_1()
211 TS_ASSERT(graph.existsEdge(1, 3)) in testAddDelEdges_1()
221 TS_ASSERT(!graph.existsEdge(2, 4)) in testAddDelEdges_1()
227 TS_ASSERT(graph.existsEdge(id1, id3)) in testAddDelEdges_2()
[all …]
H A DMixedGraphTestSuite.h222 TS_ASSERT(graph.existsEdge(id3, id5)) in testAddDelNodes_2()
223 TS_ASSERT(graph.existsEdge(id5, id3)) in testAddDelNodes_2()
262 TS_ASSERT(!graph.existsEdge(2, 4)) in testRemoveNodesFunky_1()
263 TS_ASSERT(!graph.existsEdge(3, 4)) in testRemoveNodesFunky_1()
264 TS_ASSERT(!graph.existsEdge(4, 1)) in testRemoveNodesFunky_1()
270 TS_ASSERT(graph.existsEdge(0, 2)) in testAddDelEdges_1()
271 TS_ASSERT(graph.existsEdge(2, 4)) in testAddDelEdges_1()
272 TS_ASSERT(graph.existsEdge(1, 3)) in testAddDelEdges_1()
282 TS_ASSERT(!graph.existsEdge(2, 4)) in testAddDelEdges_1()
288 TS_ASSERT(graph.existsEdge(id1, id3)) in testAddDelEdges_2()
[all …]
H A DOrderedTriangulationTestSuite.h223 if (!graph.existsEdge(*iter, *iter2)) graph.addEdge(*iter, *iter2); in createClique()
H A DPartialOrderedTriangulationTestSuite.h238 if (!graph.existsEdge(*iter, *iter2)) graph.addEdge(*iter, *iter2); in createClique()
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/tools/graphicalModels/
H A DUGmodel_inl.h45 INLINE bool UGmodel::existsEdge(const NodeId node1, const NodeId node2) const { in existsEdge() function
46 return graph_.existsEdge(node1, node2); in existsEdge()
49 INLINE bool UGmodel::existsEdge(const std::string& name1, const std::string& name2) const { in existsEdge() function
50 return existsEdge(idFromName(name1), idFromName(name2)); in existsEdge()
H A DUGmodel.h108 bool existsEdge(const NodeId node1, const NodeId node2) const;
109 bool existsEdge(const std::string& name1, const std::string& name2) const;
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/testunits/module_PRM/
H A DInterfaceGraphTestSuite.h68 TS_ASSERT(ig->graph().existsEdge(ig->id(m.get("pow")), ig->id(m.get("p")))) in testMicroTopologie()
69 TS_ASSERT(ig->graph().existsEdge(ig->id(m.get("pow")), ig->id(m.get("c")))) in testMicroTopologie()
70 TS_ASSERT(ig->graph().existsEdge(ig->id(m.get("pow")), ig->id(m.get("e")))) in testMicroTopologie()
71 TS_ASSERT(ig->graph().existsEdge(ig->id(m.get("p")), ig->id(m.get("c")))) in testMicroTopologie()
151 TS_ASSERT(ig->graph().existsEdge(ig->id(m.get("pow")), ig->id(m.get(getPrinter(i))))) in testSmallTopologie()
154 TS_ASSERT(ig->graph().existsEdge(ig->id(m.get("pow")), ig->id(m.get("another_printer")))) in testSmallTopologie()
159 TS_ASSERT(ig->graph().existsEdge(ig->id(m.get("pow")), ig->id(m.get(getComputer(i))))) in testSmallTopologie()
162 TS_ASSERT(ig->graph().existsEdge(ig->id(m.get("pow")), ig->id(m.get("another_computer")))) in testSmallTopologie()
170 ig->graph().existsEdge(ig->id(m.get(getPrinter(i))), ig->id(m.get(getComputer(j))))); in testSmallTopologie()
174 ig->graph().existsEdge(ig->id(m.get(getPrinter(i))), ig->id(m.get("another_computer")))); in testSmallTopologie()
[all …]
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/BN/algorithms/
H A DstructuralComparator.cpp93 if (test.existsEdge(edge)) { in compare()
100 if (!ref.existsEdge(edge)) { ++_wrong_edge_none_; } in compare()
132 } else if (test.existsEdge(arc.tail(), arc.head())) { in compare()
139 if (test.existsEdge(edge)) { in compare()
150 && !ref.existsEdge(arc.tail(), arc.head())) { in compare()
155 if (!ref.existsEdge(edge) && !ref.existsArc(edge.first(), edge.second()) in compare()
H A DessentialGraph.cpp96 if (!_mg_.existsEdge(a, c) && !_mg_.existsArc(c, a)) { return true; } in _strongly_protected_()
104 if (_mg_.existsEdge(c, a)) { in _strongly_protected_()
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/wrappers/pyAgrum/testunits/tests/
H A DMarkovNetTestSuite.py205 self.assertTrue(mn.existsEdge(0, 1))
206 self.assertTrue(mn.existsEdge("A", "B"))
207 self.assertTrue(mn.existsEdge(1, 0))
208 self.assertTrue(mn.existsEdge("B", "A"))
209 self.assertTrue(mn.existsEdge(0, 2))
210 self.assertTrue(mn.existsEdge("A", "C"))
211 self.assertFalse(mn.existsEdge(3, 7))
212 self.assertFalse(mn.existsEdge("C", "G"))
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/testunits/module_MN/
H A DMarkovNetTestSuite.h285 TS_ASSERT(mn.existsEdge(0, 1)) in testExistsEdge()
286 TS_ASSERT(mn.existsEdge("A", "B")) in testExistsEdge()
287 TS_ASSERT(mn.existsEdge(1, 0)) in testExistsEdge()
288 TS_ASSERT(mn.existsEdge("B", "A")) in testExistsEdge()
289 TS_ASSERT(mn.existsEdge(0, 2)) in testExistsEdge()
290 TS_ASSERT(mn.existsEdge("A", "C")) in testExistsEdge()
291 TS_ASSERT(!mn.existsEdge(3, 7)) in testExistsEdge()
292 TS_ASSERT(!mn.existsEdge("C", "G")) in testExistsEdge()
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/wrappers/pyAgrum/pyLibs/lib/
H A Dbn_vs_bn.py414 if cpdag2.existsArc(idTail_2, idHead_2) or cpdag2.existsEdge(idTail_2, idHead_2):
417 … idTail_2) and not cpdag2.existsEdge(
424 if cpdag2.existsArc(idHead_2, idTail_2) or cpdag2.existsEdge(idTail_2, idHead_2):
428 not cpdag2.existsEdge(idTail_2, idHead_2):
432 elif cpdag1.existsEdge(idTail_1, idHead_1): # Check edge
437 not cpdag2.existsEdge(idTail_2, idHead_2):
443 cpdag2.existsEdge(idHead_2, idTail_2) or \
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/tools/graphs/algorithms/
H A DsimplicialSet.cpp217 if ((node2 != node1) && !_graph_->existsEdge(node1, node2)) { in makeClique()
239 if (_graph_->existsEdge(neighbor, node2)) { in makeClique()
254 if (_graph_->existsEdge(neighbor, node1)) { in makeClique()
297 if (!_graph_->existsEdge(e1_2)) { in makeClique()
316 if (_graph_->existsEdge(neighbor, node2)) { in makeClique()
329 if (_graph_->existsEdge(neighbor, node1)) { in makeClique()
476 if (!_graph_->existsEdge(edge)) { in eraseEdge()
495 if (_graph_->existsEdge(node2, othernode)) { in eraseEdge()
520 if (_graph_->existsEdge(edge)) return; in addEdge()
530 if (_graph_->existsEdge(node2, othernode)) { in addEdge()
[all …]
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/tools/graphs/parts/
H A DedgeGraphPart_inl.h40 INLINE bool EdgeGraphPart::existsEdge(const Edge& edge) const { return _edges_.contains(edge); } in existsEdge() function
42 INLINE bool EdgeGraphPart::existsEdge(const NodeId first, const NodeId second) const { in existsEdge() function
62 if (existsEdge(edge)) { in eraseEdge()
H A DedgeGraphPart.h142 bool existsEdge(const Edge& edge) const;
149 bool existsEdge(const NodeId n1, const NodeId n2) const;
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/testunits/module_BN/
H A DCliqueGraphTestSuite.h130 TS_ASSERT(graph.existsEdge(1, 2)) in testFillG1()
131 TS_ASSERT(graph.existsEdge(2, 4)) in testFillG1()
132 TS_ASSERT(graph.existsEdge(2, 3)) in testFillG1()
149 TS_ASSERT(graph.existsEdge(1, 2)) in testFillG2()
150 TS_ASSERT(graph.existsEdge(2, 4)) in testFillG2()
151 TS_ASSERT(graph.existsEdge(2, 3)) in testFillG2()
152 TS_ASSERT(graph.existsEdge(1, 3)) in testFillG2()
153 TS_ASSERT(graph.existsEdge(3, 4)) in testFillG2()
165 TS_ASSERT(graph.existsEdge(1, 2)) in testFillG3()
166 TS_ASSERT(graph.existsEdge(2, 4)) in testFillG3()
[all …]
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/tools/graphs/algorithms/triangulations/
H A DstaticTriangulation.cpp241 if (_triangulated_graph_.existsEdge(node2, adjnode)) adj.push_back(adjnode); in _computeRecursiveThinning_()
246 if (!_triangulated_graph_.existsEdge(adj[k], adj[m])) { in _computeRecursiveThinning_()
377 if (!_original_graph_->existsEdge(*iter_sep1, *iter_sep2)) { in _computeMaxPrimeMergings_()
580 if (!tmp_graph.existsEdge(edge)) { in _triangulate_()
605 if (!tmp_graph.existsEdge(edge)) { _fill_ins_.insert(edge); } in _triangulate_()
631 if (!tmp_graph.existsEdge(edge)) { tmp_graph.addEdge(node1, node2); } in _triangulate_()
693 if (!_original_graph_->existsEdge(edge)) { in fillIns()
H A DincrementalTriangulation.cpp207 if (!_graph_.existsEdge(edge)) return; in eraseEdge()
304 if (_graph_.existsEdge(node1, node2)) { in eraseNode()
392 || _graph_.existsEdge(Edge(X, Y))) in addEdge()
531 if (_graph_.existsEdge(thePair.first, thePair.second)) in _check_()
580 if (_graph_.existsEdge(thePair.first, thePair.second)) in _check_()
934 if (!_graph_.existsEdge(*iter_sep1, *iter_sep2)) { in _computeMaxPrimeMergings_()
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/BN/learning/constraints/
H A DstructuralConstraintUndiGraph_inl.h42 && !_UndiGraph_graph_.existsEdge(x, y); in checkEdgeAdditionAlone()
47 return _UndiGraph_graph_.existsEdge(x, y); in checkEdgeDeletionAlone()
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/tools/graphs/
H A DcliqueGraph_inl.h49 if (!existsEdge(edge)) { in addEdge()
61 if (existsEdge(edge)) { in eraseEdge()
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/wrappers/pyAgrum/doc/
H A Ddoc_UndiGraph.i134 %feature("docstring") gum::UndiGraph::existsEdge
H A Ddoc_MixedGraph.i159 %feature("docstring") gum::MixedGraph::existsEdge
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/testunits/module_BNLEARNING/
H A DThreeOffTwoTestSuite.h315 TS_ASSERT(graph.existsEdge(5, 7)) in test_3off2_asia_constraints()
424 TS_ASSERT(graph.existsEdge(5, 7)) in test_MIIC_asia_constraints()
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/BN/learning/
H A DMiic.cpp234 if (graph.existsEdge(iter.key().first, iter.key().second) && iter.val() == '>') { in orientation3off2_()
509 if (graph.existsEdge(iter.key().first, iter.key().second) && iter.val() == '>') { in orientationMiic_()
654 if (y < x && !graph.existsEdge(x, y)) { in unshieldedTriples_()
692 if (y < x && !graph.existsEdge(x, y)) { in unshieldedTriplesMiic_()

12