60 likes | 191 Views
Spanning Trees and Dijkstra’s Algorithm. Excursions in Modern Mathematics( Tannenbaum ) and Thinking Mathematically (Blitzer). Spanning Trees. A subgraph that connects all the vertices of the network and has no circuits .
E N D
Spanning Trees and Dijkstra’s Algorithm Excursions in Modern Mathematics(Tannenbaum) and Thinking Mathematically (Blitzer)
Spanning Trees A subgraph that connects all the vertices of the network and has no circuits. By removing redundant edges makes it possible to increase the efficiency of the network modeled by the graph. A spanning tree must have one less edge than it’s vertices. Number of vertices – 1.
Minimum Spanning Tree The minimum cost spanning tree for a weighted graph is a spanning tree with the smallest possible total weight.
Example 12 17 15 35 8 17 15 35 8 24 20 24 20 12 17 15 35 8 20
Dijkstra’s Shortest-Path Algorithm http://www.youtube.com/watch?v=EMmSL2Jd_nc