⨘ } Algorithms } 25 } Graphs } Minimum Spanning Tree ( MST ) } LEPROFESSEUR }

This lecture discusses spanning trees and minimum spanning tree with a generic algorithm to find a minimum spanning tree in a graph. A basic greedy approach to find minimum spanning tree in a graph is discussed for a digital circuit example.

Thanks for watching.

LEPROFESSEUR/LEPROF/H.R.