Merge pull request #1 from codezonediitj/master

Cocktail Sort codezonediitj#198
bandaabhigna · Mar 23, 2020 · d6f7699 · d6f7699
2 parents fcb27e6 + 2c938b5
commit d6f7699
Showing 1 changed file with 16 additions and 0 deletions.
diff --git a/pydatastructs/graphs/algorithms.py b/pydatastructs/graphs/algorithms.py
@@ -265,6 +265,14 @@ def minimum_spanning_tree(graph, algorithm):
     ==========
 
     .. [1] https://en.wikipedia.org/wiki/Kruskal%27s_algorithm
+
+    Note
+    ====
+
+    The concept of minimum spanning tree is valid only for
+    connected and undirected graphs. So, this function
+    should be used only for such graphs. Using with other
+    types of graphs may lead to unwanted results.
     """
     import pydatastructs.graphs.algorithms as algorithms
     func = "_minimum_spanning_tree_" + algorithm + "_" + graph._impl
@@ -337,6 +345,14 @@ def minimum_spanning_tree_parallel(graph, algorithm, num_threads):
     ==========
 
     .. [1] https://en.wikipedia.org/wiki/Kruskal%27s_algorithm#Parallel_algorithm
+
+    Note
+    ====
+
+    The concept of minimum spanning tree is valid only for
+    connected and undirected graphs. So, this function
+    should be used only for such graphs. Using with other
+    types of graphs will lead to unwanted results.
     """
     import pydatastructs.graphs.algorithms as algorithms
     func = "_minimum_spanning_tree_parallel_" + algorithm + "_" + graph._impl