Algorithms } 025 } Graphs } Minimum Spanning Tree } Introduction }

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.


3,619 total views, 2 views today

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.



Knowledge at your fingertips } Rethink the way you learn }™     LEPROFESSEUR }
Skip to toolbar