summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorArafat <arafat.da.khan@gmail.com>2016-01-05 23:32:52 +0530
committerArafat <arafat.da.khan@gmail.com>2016-01-05 23:32:52 +0530
commit712e2e452d1458cb0f0fec03bde46215d4a2bb22 (patch)
treee0167c90b904258a738ee3a30870da932a93b02e
parent8ac7407649aa481ad4f38138ba444371a46e0770 (diff)
downloadnetworkx-712e2e452d1458cb0f0fec03bde46215d4a2bb22.tar.gz
Adding test for #1736
-rw-r--r--networkx/algorithms/tests/test_matching.py14
1 files changed, 14 insertions, 0 deletions
diff --git a/networkx/algorithms/tests/test_matching.py b/networkx/algorithms/tests/test_matching.py
index 05fa8c1b..ac86da9b 100644
--- a/networkx/algorithms/tests/test_matching.py
+++ b/networkx/algorithms/tests/test_matching.py
@@ -251,6 +251,20 @@ def test_maximal_matching():
u, v = edge
ok_(len(set([v]) & vset) > 0 or len(set([u]) & vset) > 0, \
"not a proper matching!")
+ graph = nx.Graph()
+ graph.add_edge(1, 1)
+ graph.add_edge(1, 2)
+ graph.add_edge(2, 2)
+ graph.add_edge(2, 3)
+ matching = nx.maximal_matching(graph)
+ assert(len(matching)==1)
+ vset = set(u for u, v in matching)
+ vset = vset | set(v for u, v in matching)
+
+ for edge in graph.edges():
+ u, v = edge
+ ok_(len(set([v]) & vset) > 0 or len(set([u]) & vset) > 0, \
+ "not a proper matching!")
def test_maximal_matching_ordering():
# check edge ordering