Spanning trees and dijkstra s algorithm
This presentation is the property of its rightful owner.
Sponsored Links
1 / 6

Spanning Trees and Dijkstra’s Algorithm PowerPoint PPT Presentation


  • 44 Views
  • Uploaded on
  • Presentation posted in: General

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 .

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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


Spanning trees and dijkstra s algorithm

Spanning Trees and Dijkstra’s Algorithm

Excursions in Modern Mathematics(Tannenbaum) and Thinking Mathematically (Blitzer)


Spanning trees

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.


Find a spanning tree

Find a spanning tree


Minimum spanning tree

Minimum Spanning Tree

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


Example

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

Dijkstra’s Shortest-Path Algorithm

http://www.youtube.com/watch?v=EMmSL2Jd_nc


  • Login