Graph application : Minimum Spanning Tree algorithm : Theory and implementation

Gayatri TR, May knowledge come to us from all sides.

Play Speed
  • 0.5x
  • 1x (Normal)
  • 1.25x
  • 1.5x
  • 2x
7 Videos (43m)
    • Finding spanning trees using BFS or DFS

      6:02
    • What is a minimum spanning tree?

      5:12
    • The minimum spanning tree algorithm : Theory

      5:26
    • Extracting a list of unique edges from adjacency list

      8:06
    • Finding the edge with least cost from the list of unique edges

      5:56
    • Use of set union and find-root operations for detecting cycles in the tree

      10:19
    • Constructing the minimum spanning tree: Putting it all together

      10:24

About This Class

Get a complete hands-on exercise of implementing the minimum spanning tree algorithm in C programming language.

1 of 1 students recommendSee All

An excellent explanation on the implementation of minimum spanning tree algorithm. Awesome.

1

Student

--

Projects

Gayatri TR

May knowledge come to us from all sides.

The instructor comes with several years of industry and research experience in varied fields such as device drivers, embedded systems, natural language processing, speech technology, and electronic circuits.