Fix docstring faliure by making output fixed

Author: Akshat-Shu

pydatastructs/graphs/algorithms.py

@@ -1459,8 +1459,8 @@ def maximum_matching(graph: Graph, algorithm: str, **kwargs) -> set:
     >>> graph.add_edge('v_1', 'v_2')
     >>> graph.add_edge('v_2', 'v_3')
     >>> graph.add_edge('v_4', 'v_1')
-    >>> maximum_matching(graph, 'hopcroft_karp', make_undirected=True)
-    {('v_3', 'v_2'), ('v_1', 'v_4')}
+    >>> sorted(maximum_matching(graph, 'hopcroft_karp', make_undirected=True))
+    [('v_1', 'v_4'), ('v_3', 'v_2')]
 
     References
     ==========
@@ -1644,8 +1644,8 @@ def maximum_matching_parallel(graph: Graph, algorithm: str, num_threads: int, **
     >>> graph.add_bidirectional_edge('v_1', 'v_2')
     >>> graph.add_bidirectional_edge('v_2', 'v_3')
     >>> graph.add_bidirectional_edge('v_4', 'v_1')
-    >>> maximum_matching_parallel(graph, 'hopcroft_karp', 1)
-    {('v_3', 'v_2'), ('v_1', 'v_4')}
+    >>> sorted(maximum_matching_parallel(graph, 'hopcroft_karp', 1))
+    [('v_1', 'v_4'), ('v_3', 'v_2')]
 
 
     References