From b5185543e6bd3b2109e5a860a743407a62629d7a Mon Sep 17 00:00:00 2001 From: Kiriakos Velissariou Date: Thu, 25 Dec 2014 18:46:07 +0200 Subject: [PATCH] Added Minimum Spanning Tree Problem --- README.md | 3 +++ 1 file changed, 3 insertions(+) diff --git a/README.md b/README.md index 3a6a7260b..1c57ff03c 100644 --- a/README.md +++ b/README.md @@ -94,6 +94,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 ---------