1 / 6

Spanning Trees and Dijkstra’s Algorithm

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 .

eliza
Download Presentation

Spanning Trees and Dijkstra’s Algorithm

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. Spanning Trees and Dijkstra’s Algorithm Excursions in Modern Mathematics(Tannenbaum) and Thinking Mathematically (Blitzer)

  2. 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.

  3. Find a spanning tree

  4. Minimum Spanning Tree The minimum cost spanning tree for a weighted graph is a spanning tree with the smallest possible total weight.

  5. Example 12 17 15 35 8 17 15 35 8 24 20 24 20 12 17 15 35 8 20

  6. Dijkstra’s Shortest-Path Algorithm http://www.youtube.com/watch?v=EMmSL2Jd_nc

More Related