Merge pull request karan#64 from kiriakosv/master

Added Minimum Spanning Tree Problem
rpsec · Jan 18, 2015 · 40c7c91 · 40c7c91
2 parents 2bbb8ec + b518554
commit 40c7c91
Showing 1 changed file with 3 additions and 0 deletions.
diff --git a/README.md b/README.md
@@ -109,6 +109,9 @@ Graph
 
 **Dijkstra’s Algorithm** - Create a program that finds the shortest path through a graph using its edges.
 
+**Minimum Spanning Tree** - Create a program which takes a connected, undirected graph with weights and outputs the minimum spanning tree of the graph i.e., a
+subgraph that is a tree, contains all the vertices, and the sum of its weights is the least possible.
+
 
 Data Structures
 ---------