| /dports/math/py-networkx/networkx-2.6.3/networkx/generators/ |
| H A D | social.py | 89 G.add_edge(row, col)
261 G.add_edge("Medici", "Barbadori")
262 G.add_edge("Medici", "Ridolfi")
264 G.add_edge("Medici", "Albizzi")
265 G.add_edge("Medici", "Salviati")
266 G.add_edge("Salviati", "Pazzi")
267 G.add_edge("Peruzzi", "Strozzi")
268 G.add_edge("Peruzzi", "Bischeri")
269 G.add_edge("Strozzi", "Ridolfi")
270 G.add_edge("Strozzi", "Bischeri")
[all …]
|
| /dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/community/tests/ |
| H A D | test_asyn_fluid.py | 32 test.add_edge("a", "b")
46 test.add_edge("a", "b")
47 test.add_edge("a", "c")
48 test.add_edge("b", "c")
51 test.add_edge("c", "d")
54 test.add_edge("d", "e")
55 test.add_edge("d", "f")
56 test.add_edge("f", "e")
70 test.add_edge("1a", "1b")
71 test.add_edge("1a", "1c")
[all …]
|
| H A D | test_label_propagation.py | 44 test.add_edge("a", "c")
45 test.add_edge("a", "d")
46 test.add_edge("d", "c")
48 test.add_edge("b", "e")
49 test.add_edge("e", "f")
50 test.add_edge("f", "b")
63 test.add_edge("a", "b")
64 test.add_edge("c", "a")
65 test.add_edge("c", "b")
66 test.add_edge("d", "a")
[all …]
|
| /dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/bipartite/tests/ |
| H A D | test_matching.py | 150 G.add_edge("A", "C")
151 G.add_edge("A", "B")
152 G.add_edge("C", "E")
153 G.add_edge("C", "D")
154 G.add_edge("E", "G")
155 G.add_edge("E", "F")
156 G.add_edge("G", "I")
157 G.add_edge("G", "H")
320 G.add_edge(0, 2, mass=2)
322 G.add_edge(1, 2, mass=1)
[all …]
|
| /dports/math/libsemigroups/libsemigroups-1.3.7/tests/ |
| H A D | test-digraph.cpp | 87 ad.add_edge(0, 1, 0); in binary_tree()
88 ad.add_edge(0, 2, 1); in binary_tree()
659 ad.add_edge(0, 1, 0);
660 ad.add_edge(0, 2, 1);
661 ad.add_edge(2, 3, 0);
662 ad.add_edge(2, 4, 1);
663 ad.add_edge(4, 5, 1);
665 ad.add_edge(2, 6, 2);
666 ad.add_edge(6, 7, 1);
667 ad.add_edge(7, 8, 0);
[all …]
|
| /dports/devel/py-pyinstaller/PyInstaller-3.5/tests/unit/test_altgraph/ |
| H A D | test_graph.py | 557 g.add_edge(1, 2)
568 g.add_edge(1, 2)
569 g.add_edge(1, 3)
570 g.add_edge(1, 4)
573 g.add_edge(2, 5)
574 g.add_edge(3, 5)
575 g.add_edge(4, 5)
578 g.add_edge(2, 3)
580 g.add_edge(2, 4)
582 g.add_edge(4, 2)
[all …]
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/catapult/telemetry/third_party/altgraph/altgraph_tests/ |
| H A D | test_graph.py | 540 g.add_edge(1, 2)
551 g.add_edge(1, 2)
552 g.add_edge(1, 3)
553 g.add_edge(1, 4)
556 g.add_edge(2, 5)
557 g.add_edge(3, 5)
558 g.add_edge(4, 5)
561 g.add_edge(2, 3)
563 g.add_edge(2, 4)
565 g.add_edge(4, 2)
[all …]
|
| /dports/www/firefox-legacy/firefox-52.8.0esr/python/altgraph/altgraph_tests/ |
| H A D | test_graph.py | 540 g.add_edge(1, 2)
551 g.add_edge(1, 2)
552 g.add_edge(1, 3)
553 g.add_edge(1, 4)
556 g.add_edge(2, 5)
557 g.add_edge(3, 5)
558 g.add_edge(4, 5)
561 g.add_edge(2, 3)
563 g.add_edge(2, 4)
565 g.add_edge(4, 2)
[all …]
|
| /dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/flow/tests/ |
| H A D | test_maxflow.py | 216 G.add_edge(1, 3, capacity=4)
265 G.add_edge("s", "a")
270 G.add_edge("c", "t")
286 G.add_edge("a", "c")
287 G.add_edge("c", "a")
305 G.add_edge("s", "a")
307 G.add_edge("a", "c")
310 G.add_edge("c", "t")
318 G.add_edge("s", "a")
323 G.add_edge("c", "t")
[all …]
|
| /dports/math/py-altgraph/altgraph-0.15/altgraph_tests/ |
| H A D | test_graph.py | 563 g.add_edge(1, 2)
574 g.add_edge(1, 2)
575 g.add_edge(1, 3)
576 g.add_edge(1, 4)
579 g.add_edge(2, 5)
580 g.add_edge(3, 5)
581 g.add_edge(4, 5)
584 g.add_edge(2, 3)
586 g.add_edge(2, 4)
588 g.add_edge(4, 2)
[all …]
|
| /dports/security/py-angr/angr-9.0.5405/tests/ |
| H A D | test_cdg.py | 102 g.add_edge(1, 2)
103 g.add_edge(2, 3)
104 g.add_edge(2, 7)
105 g.add_edge(3, 4)
106 g.add_edge(3, 5)
107 g.add_edge(4, 6)
108 g.add_edge(5, 6)
109 g.add_edge(6, 8)
110 g.add_edge(7, 8)
111 g.add_edge(8, 9)
[all …]
|
| /dports/biology/abyss/abyss-2.3.1/Unittest/Graph/ |
| H A D | ExtendPathTest.cpp | 27 add_edge(0, 1, g1); in TEST()
28 add_edge(1, 2, g1); in TEST()
53 add_edge(0, 1, g2); in TEST()
54 add_edge(1, 2, g2); in TEST()
55 add_edge(1, 3, g2); in TEST()
76 add_edge(0, 1, g); in TEST()
77 add_edge(1, 2, g); in TEST()
78 add_edge(1, 3, g); in TEST()
79 add_edge(3, 4, g); in TEST()
101 add_edge(0, 1, g); in TEST()
[all …]
|
| /dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/approximation/tests/ |
| H A D | test_treewidth.py | 45 cls.complete.add_edge(1, 2)
46 cls.complete.add_edge(2, 3)
47 cls.complete.add_edge(1, 3)
50 cls.small_tree.add_edge(1, 3)
51 cls.small_tree.add_edge(4, 3)
52 cls.small_tree.add_edge(2, 3)
53 cls.small_tree.add_edge(3, 5)
54 cls.small_tree.add_edge(5, 6)
55 cls.small_tree.add_edge(5, 7)
56 cls.small_tree.add_edge(6, 7)
[all …]
|
| /dports/biology/py-biopython/biopython-1.79/Tests/ |
| H A D | test_Pathway.py | 21 a.add_edge("a", "b", "label1")
22 a.add_edge("b", "c", "label1")
23 a.add_edge("b", "a", "label2")
26 b.add_edge("a", "b", "label1")
28 b.add_edge("b", "c", "label1")
29 b.add_edge("b", "a", "label2")
32 c.add_edge("a", "b", "label2")
33 c.add_edge("b", "c", "label2")
34 c.add_edge("b", "a", "label1")
51 a.add_edge("a", "b", "label1")
[all …]
|
| /dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/connectivity/tests/ |
| H A D | test_stoer_wagner.py | 47 G.add_edge("x", "a")
48 G.add_edge("x", "b")
49 G.add_edge("a", "c")
50 G.add_edge("b", "c")
51 G.add_edge("b", "d")
52 G.add_edge("d", "e")
53 G.add_edge("c", "y")
54 G.add_edge("e", "y")
63 G.add_edge(1, 2, weight=2)
81 G.add_edge(1, 3, cost=2)
[all …]
|
| /dports/devel/hyperscan/hyperscan-5.4.0/unit/internal/ |
| H A D | nfagraph_util.cpp | 65 add_edge(a, b, src); in TEST()
66 add_edge(b, c, src); in TEST()
67 add_edge(c, d, src); in TEST()
68 add_edge(d, e, src); in TEST()
69 add_edge(e, f, src); in TEST()
71 add_edge(c, g, src); in TEST()
72 add_edge(g, b, src); in TEST()
74 add_edge(d, h, src); in TEST()
75 add_edge(h, c, src); in TEST()
77 add_edge(c, i, src); in TEST()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/libs/graph/test/ |
| H A D | adjacency_matrix_test.cpp | 62 boost::add_edge(boost::vertex(1, g1), boost::vertex(2, g1), g1); in run_test()
63 boost::add_edge(boost::vertex(1, g2), boost::vertex(2, g2), g2); in run_test()
64 boost::add_edge(boost::vertex(2, g1), boost::vertex(10, g1), g1); in run_test()
66 boost::add_edge(boost::vertex(2, g1), boost::vertex(5, g1), g1); in run_test()
67 boost::add_edge(boost::vertex(2, g2), boost::vertex(5, g2), g2); in run_test()
70 boost::add_edge(boost::vertex(3, g1), boost::vertex(0, g1), g1); in run_test()
71 boost::add_edge(boost::vertex(3, g2), boost::vertex(0, g2), g2); in run_test()
72 boost::add_edge(boost::vertex(4, g1), boost::vertex(5, g1), g1); in run_test()
73 boost::add_edge(boost::vertex(4, g2), boost::vertex(5, g2), g2); in run_test()
74 boost::add_edge(boost::vertex(4, g1), boost::vertex(0, g1), g1); in run_test()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/graph/test/ |
| H A D | adjacency_matrix_test.cpp | 62 boost::add_edge(boost::vertex(1, g1), boost::vertex(2, g1), g1); in run_test()
63 boost::add_edge(boost::vertex(1, g2), boost::vertex(2, g2), g2); in run_test()
64 boost::add_edge(boost::vertex(2, g1), boost::vertex(10, g1), g1); in run_test()
66 boost::add_edge(boost::vertex(2, g1), boost::vertex(5, g1), g1); in run_test()
67 boost::add_edge(boost::vertex(2, g2), boost::vertex(5, g2), g2); in run_test()
70 boost::add_edge(boost::vertex(3, g1), boost::vertex(0, g1), g1); in run_test()
71 boost::add_edge(boost::vertex(3, g2), boost::vertex(0, g2), g2); in run_test()
72 boost::add_edge(boost::vertex(4, g1), boost::vertex(5, g1), g1); in run_test()
73 boost::add_edge(boost::vertex(4, g2), boost::vertex(5, g2), g2); in run_test()
74 boost::add_edge(boost::vertex(4, g1), boost::vertex(0, g1), g1); in run_test()
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/graph/test/ |
| H A D | adjacency_matrix_test.cpp | 62 boost::add_edge(boost::vertex(1, g1), boost::vertex(2, g1), g1); in run_test()
63 boost::add_edge(boost::vertex(1, g2), boost::vertex(2, g2), g2); in run_test()
64 boost::add_edge(boost::vertex(2, g1), boost::vertex(10, g1), g1); in run_test()
66 boost::add_edge(boost::vertex(2, g1), boost::vertex(5, g1), g1); in run_test()
67 boost::add_edge(boost::vertex(2, g2), boost::vertex(5, g2), g2); in run_test()
70 boost::add_edge(boost::vertex(3, g1), boost::vertex(0, g1), g1); in run_test()
71 boost::add_edge(boost::vertex(3, g2), boost::vertex(0, g2), g2); in run_test()
72 boost::add_edge(boost::vertex(4, g1), boost::vertex(5, g1), g1); in run_test()
73 boost::add_edge(boost::vertex(4, g2), boost::vertex(5, g2), g2); in run_test()
74 boost::add_edge(boost::vertex(4, g1), boost::vertex(0, g1), g1); in run_test()
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/graph/test/ |
| H A D | adjacency_matrix_test.cpp | 62 boost::add_edge(boost::vertex(1, g1), boost::vertex(2, g1), g1); in run_test()
63 boost::add_edge(boost::vertex(1, g2), boost::vertex(2, g2), g2); in run_test()
64 boost::add_edge(boost::vertex(2, g1), boost::vertex(10, g1), g1); in run_test()
66 boost::add_edge(boost::vertex(2, g1), boost::vertex(5, g1), g1); in run_test()
67 boost::add_edge(boost::vertex(2, g2), boost::vertex(5, g2), g2); in run_test()
70 boost::add_edge(boost::vertex(3, g1), boost::vertex(0, g1), g1); in run_test()
71 boost::add_edge(boost::vertex(3, g2), boost::vertex(0, g2), g2); in run_test()
72 boost::add_edge(boost::vertex(4, g1), boost::vertex(5, g1), g1); in run_test()
73 boost::add_edge(boost::vertex(4, g2), boost::vertex(5, g2), g2); in run_test()
74 boost::add_edge(boost::vertex(4, g1), boost::vertex(0, g1), g1); in run_test()
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/libs/graph/test/ |
| H A D | adjacency_matrix_test.cpp | 62 boost::add_edge(boost::vertex(1, g1), boost::vertex(2, g1), g1); in run_test()
63 boost::add_edge(boost::vertex(1, g2), boost::vertex(2, g2), g2); in run_test()
64 boost::add_edge(boost::vertex(2, g1), boost::vertex(10, g1), g1); in run_test()
66 boost::add_edge(boost::vertex(2, g1), boost::vertex(5, g1), g1); in run_test()
67 boost::add_edge(boost::vertex(2, g2), boost::vertex(5, g2), g2); in run_test()
70 boost::add_edge(boost::vertex(3, g1), boost::vertex(0, g1), g1); in run_test()
71 boost::add_edge(boost::vertex(3, g2), boost::vertex(0, g2), g2); in run_test()
72 boost::add_edge(boost::vertex(4, g1), boost::vertex(5, g1), g1); in run_test()
73 boost::add_edge(boost::vertex(4, g2), boost::vertex(5, g2), g2); in run_test()
74 boost::add_edge(boost::vertex(4, g1), boost::vertex(0, g1), g1); in run_test()
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/graph/test/ |
| H A D | adjacency_matrix_test.cpp | 62 boost::add_edge(boost::vertex(1, g1), boost::vertex(2, g1), g1); in run_test()
63 boost::add_edge(boost::vertex(1, g2), boost::vertex(2, g2), g2); in run_test()
64 boost::add_edge(boost::vertex(2, g1), boost::vertex(10, g1), g1); in run_test()
66 boost::add_edge(boost::vertex(2, g1), boost::vertex(5, g1), g1); in run_test()
67 boost::add_edge(boost::vertex(2, g2), boost::vertex(5, g2), g2); in run_test()
70 boost::add_edge(boost::vertex(3, g1), boost::vertex(0, g1), g1); in run_test()
71 boost::add_edge(boost::vertex(3, g2), boost::vertex(0, g2), g2); in run_test()
72 boost::add_edge(boost::vertex(4, g1), boost::vertex(5, g1), g1); in run_test()
73 boost::add_edge(boost::vertex(4, g2), boost::vertex(5, g2), g2); in run_test()
74 boost::add_edge(boost::vertex(4, g1), boost::vertex(0, g1), g1); in run_test()
[all …]
|
| /dports/databases/percona57-client/boost_1_59_0/libs/graph/test/ |
| H A D | adjacency_matrix_test.cpp | 62 boost::add_edge(boost::vertex(1, g1), boost::vertex(2, g1), g1); in run_test()
63 boost::add_edge(boost::vertex(1, g2), boost::vertex(2, g2), g2); in run_test()
64 boost::add_edge(boost::vertex(2, g1), boost::vertex(10, g1), g1); in run_test()
66 boost::add_edge(boost::vertex(2, g1), boost::vertex(5, g1), g1); in run_test()
67 boost::add_edge(boost::vertex(2, g2), boost::vertex(5, g2), g2); in run_test()
70 boost::add_edge(boost::vertex(3, g1), boost::vertex(0, g1), g1); in run_test()
71 boost::add_edge(boost::vertex(3, g2), boost::vertex(0, g2), g2); in run_test()
72 boost::add_edge(boost::vertex(4, g1), boost::vertex(5, g1), g1); in run_test()
73 boost::add_edge(boost::vertex(4, g2), boost::vertex(5, g2), g2); in run_test()
74 boost::add_edge(boost::vertex(4, g1), boost::vertex(0, g1), g1); in run_test()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/libs/graph/test/ |
| H A D | adjacency_matrix_test.cpp | 62 boost::add_edge(boost::vertex(1, g1), boost::vertex(2, g1), g1); in run_test()
63 boost::add_edge(boost::vertex(1, g2), boost::vertex(2, g2), g2); in run_test()
64 boost::add_edge(boost::vertex(2, g1), boost::vertex(10, g1), g1); in run_test()
66 boost::add_edge(boost::vertex(2, g1), boost::vertex(5, g1), g1); in run_test()
67 boost::add_edge(boost::vertex(2, g2), boost::vertex(5, g2), g2); in run_test()
70 boost::add_edge(boost::vertex(3, g1), boost::vertex(0, g1), g1); in run_test()
71 boost::add_edge(boost::vertex(3, g2), boost::vertex(0, g2), g2); in run_test()
72 boost::add_edge(boost::vertex(4, g1), boost::vertex(5, g1), g1); in run_test()
73 boost::add_edge(boost::vertex(4, g2), boost::vertex(5, g2), g2); in run_test()
74 boost::add_edge(boost::vertex(4, g1), boost::vertex(0, g1), g1); in run_test()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/libs/graph/test/ |
| H A D | adjacency_matrix_test.cpp | 61 boost::add_edge(boost::vertex(1, g1), boost::vertex(2, g1), g1); in run_test()
62 boost::add_edge(boost::vertex(1, g2), boost::vertex(2, g2), g2); in run_test()
63 boost::add_edge(boost::vertex(2, g1), boost::vertex(10, g1), g1); in run_test()
65 boost::add_edge(boost::vertex(2, g1), boost::vertex(5, g1), g1); in run_test()
66 boost::add_edge(boost::vertex(2, g2), boost::vertex(5, g2), g2); in run_test()
69 boost::add_edge(boost::vertex(3, g1), boost::vertex(0, g1), g1); in run_test()
70 boost::add_edge(boost::vertex(3, g2), boost::vertex(0, g2), g2); in run_test()
71 boost::add_edge(boost::vertex(4, g1), boost::vertex(5, g1), g1); in run_test()
72 boost::add_edge(boost::vertex(4, g2), boost::vertex(5, g2), g2); in run_test()
73 boost::add_edge(boost::vertex(4, g1), boost::vertex(0, g1), g1); in run_test()
[all …]
|