diff options
| author | Mridul Seth <seth.mridul@gmail.com> | 2022-04-04 10:03:45 +0400 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2022-04-03 23:03:45 -0700 |
| commit | ca4e7266bf1788687a68b2eafbc96c417c0cb479 (patch) | |
| tree | ab3278ea8b0dce5f0f2712b409bf55d0fd102484 | |
| parent | 8bedf69258cc826c402c11817f9ed83c4b085da0 (diff) | |
| download | networkx-ca4e7266bf1788687a68b2eafbc96c417c0cb479.tar.gz | |
MAINT: Prim MST test didn't pass algorithm name to all unit tests (#5457)
| -rw-r--r-- | networkx/algorithms/tree/tests/test_mst.py | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/networkx/algorithms/tree/tests/test_mst.py b/networkx/algorithms/tree/tests/test_mst.py index 6eebe0cb..9bec5b1a 100644 --- a/networkx/algorithms/tree/tests/test_mst.py +++ b/networkx/algorithms/tree/tests/test_mst.py @@ -265,14 +265,14 @@ class TestPrim(MultigraphMSTTestBase): G = nx.MultiGraph() G.add_edge(0, 1, key="a", weight=2) G.add_edge(0, 1, key="b", weight=1) - T = nx.minimum_spanning_tree(G) + T = nx.minimum_spanning_tree(G, algorithm=self.algo) assert edges_equal([(0, 1, 1)], list(T.edges(data="weight"))) def test_multigraph_keys_tree_max(self): G = nx.MultiGraph() G.add_edge(0, 1, key="a", weight=2) G.add_edge(0, 1, key="b", weight=1) - T = nx.maximum_spanning_tree(G) + T = nx.maximum_spanning_tree(G, algorithm=self.algo) assert edges_equal([(0, 1, 2)], list(T.edges(data="weight"))) |