1 / 5

Algorithmics animation workshop Minimum Spanning trees

Algorithmics animation workshop Minimum Spanning trees. Dena Ghiassi Supervisor: A. Mirzaian. MST. For an undirected graph G=(V,E), find T Í E that connect all vertices and whose total weight : W(T)= å w(u,v) is minimized (u,v) ÎT. 0. v0. W(T)=2. v2. 3. 2. v1.

germane-olson
Télécharger la présentation

Algorithmics animation workshop Minimum Spanning trees

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Algorithmics animation workshop Minimum Spanning trees Dena Ghiassi Supervisor: A. Mirzaian

  2. MST • For an undirected graph G=(V,E), find T ÍE that connect all vertices and whose total weight : W(T)=å w(u,v) is minimized (u,v) ÎT 0 v0 W(T)=2 v2 3 2 v1

  3. MST Application? • Phone network design • Traveling salesman problem • Design of electric Circuit

  4. MST Algorithms • Prim • Kruskal • Cheriton-Tarjan • Greedy Algorithms • Complexity - Prim & Kruskal O(E lgV) - Cheriton-Tarjan O(V)

  5. MST Animation

More Related