We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 9dfebc6 commit d4bd356Copy full SHA for d4bd356
docs/Minumum spanning tree.rst
@@ -3,7 +3,7 @@ Minimum spanning tree
3
=======================
4
5
6
-Given a weighted connected graph (a graph with weights on the edges), the minimum spanning tree is a spanning tree that
+Given a weighted connected undirected graph (weighted = graph with weights on the edges), the minimum spanning tree is a spanning tree that
7
minimize the weights of the edges.
8
9
0 commit comments