Skip to content

Commit 4a59312

Browse files
nitishtwnitishtw
authored
Create readme.md
1 parent 9d03eed commit 4a59312

1 file changed

Lines changed: 4 additions & 0 deletions

File tree

  • Competitive Coding/Tree/Minimum Spanning Tree

‎Competitive Coding/Tree/Minimum Spanning Tree/readme.md‎

Lines changed: 4 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,4 @@
1+
Minimum spanning tree
2+
"A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected,
3+
edge-weighted (un)directed graph that connects all the vertices together,
4+
without any cycles and with the minimum possible total edge weight."

0 commit comments

Comments
 (0)