mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-12-04 02:11:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

Merge remote-tracking branch 'origin/master'

Browse Source 
# Conflicts:
#	graphs/edmonds_blossom_algorithm.py
This commit is contained in:
Tarun Vishwakarma 2024-10-14 21:13:01 +05:30
commit a547676800
1 changed files with 7 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
graphs/tests/test_edmonds_blossom_algorithm.py
View File

@ -4,7 +4,6 @@ from graphs.edmonds_blossom_algorithm import EdmondsBlossomAlgorithm
class EdmondsBlossomAlgorithmTest(unittest.TestCase): class EdmondsBlossomAlgorithmTest(unittest.TestCase):
def convert_matching_to_array(self, matching): def convert_matching_to_array(self, matching):
"""Helper method to convert a """Helper method to convert a
list of matching pairs into a sorted 2D array. list of matching pairs into a sorted 2D array.
@ -69,5 +68,5 @@ class EdmondsBlossomAlgorithmTest(unittest.TestCase):
assert result in (possible_matching_1, possible_matching_2) assert result in (possible_matching_1, possible_matching_2)
if __name__ == '__main__': if __name__ == "__main__":
unittest.main() unittest.main()