Published on 28 May 2013 | over 4 years ago
In this video, we have explained about Kruskal's and Prim's algorithm. Besides we have also build the basics of Spanning tree and minimum cost spanning tree. We have seen the basic properties of a Spanning tree and development of Minimum Cost Spanning Tree. MST is widely used in computer networks to determine the best shorter path with lesser cost.
Subscribe for more such videos on Computer Science subject and GATE preparation.
Report video function is under development.