Skip to content

Commit d4bd356

Browse files
author
Michele De Vita
committed
small change to doc
1 parent 9dfebc6 commit d4bd356

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

docs/Minumum spanning tree.rst

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@ Minimum spanning tree
33
=======================
44

55

6-
Given a weighted connected graph (a graph with weights on the edges), the minimum spanning tree is a spanning tree that
6+
Given a weighted connected undirected graph (weighted = graph with weights on the edges), the minimum spanning tree is a spanning tree that
77
minimize the weights of the edges.
88

99

0 commit comments

Comments
 (0)