aboutsummaryrefslogtreecommitdiff
path: root/.venv/lib/python3.12/site-packages/networkx/algorithms/tests/test_walks.py
diff options
context:
space:
mode:
authorS. Solomon Darnell2025-03-28 21:52:21 -0500
committerS. Solomon Darnell2025-03-28 21:52:21 -0500
commit4a52a71956a8d46fcb7294ac71734504bb09bcc2 (patch)
treeee3dc5af3b6313e921cd920906356f5d4febc4ed /.venv/lib/python3.12/site-packages/networkx/algorithms/tests/test_walks.py
parentcc961e04ba734dd72309fb548a2f97d67d578813 (diff)
downloadgn-ai-master.tar.gz
two version of R2R are hereHEADmaster
Diffstat (limited to '.venv/lib/python3.12/site-packages/networkx/algorithms/tests/test_walks.py')
-rw-r--r--.venv/lib/python3.12/site-packages/networkx/algorithms/tests/test_walks.py54
1 files changed, 54 insertions, 0 deletions
diff --git a/.venv/lib/python3.12/site-packages/networkx/algorithms/tests/test_walks.py b/.venv/lib/python3.12/site-packages/networkx/algorithms/tests/test_walks.py
new file mode 100644
index 00000000..7a6b3239
--- /dev/null
+++ b/.venv/lib/python3.12/site-packages/networkx/algorithms/tests/test_walks.py
@@ -0,0 +1,54 @@
+"""Unit tests for the :mod:`networkx.algorithms.walks` module."""
+
+import pytest
+
+import networkx as nx
+
+pytest.importorskip("numpy")
+pytest.importorskip("scipy")
+
+
+def test_directed():
+ G = nx.DiGraph([(0, 1), (1, 2), (2, 0)])
+ num_walks = nx.number_of_walks(G, 3)
+ expected = {0: {0: 1, 1: 0, 2: 0}, 1: {0: 0, 1: 1, 2: 0}, 2: {0: 0, 1: 0, 2: 1}}
+ assert num_walks == expected
+
+
+def test_undirected():
+ G = nx.cycle_graph(3)
+ num_walks = nx.number_of_walks(G, 3)
+ expected = {0: {0: 2, 1: 3, 2: 3}, 1: {0: 3, 1: 2, 2: 3}, 2: {0: 3, 1: 3, 2: 2}}
+ assert num_walks == expected
+
+
+def test_non_integer_nodes():
+ G = nx.DiGraph([("A", "B"), ("B", "C"), ("C", "A")])
+ num_walks = nx.number_of_walks(G, 2)
+ expected = {
+ "A": {"A": 0, "B": 0, "C": 1},
+ "B": {"A": 1, "B": 0, "C": 0},
+ "C": {"A": 0, "B": 1, "C": 0},
+ }
+ assert num_walks == expected
+
+
+def test_zero_length():
+ G = nx.cycle_graph(3)
+ num_walks = nx.number_of_walks(G, 0)
+ expected = {0: {0: 1, 1: 0, 2: 0}, 1: {0: 0, 1: 1, 2: 0}, 2: {0: 0, 1: 0, 2: 1}}
+ assert num_walks == expected
+
+
+def test_negative_length_exception():
+ G = nx.cycle_graph(3)
+ with pytest.raises(ValueError):
+ nx.number_of_walks(G, -1)
+
+
+def test_hidden_weight_attr():
+ G = nx.cycle_graph(3)
+ G.add_edge(1, 2, weight=5)
+ num_walks = nx.number_of_walks(G, 3)
+ expected = {0: {0: 2, 1: 3, 2: 3}, 1: {0: 3, 1: 2, 2: 3}, 2: {0: 3, 1: 3, 2: 2}}
+ assert num_walks == expected