Scribd
Upload
41 views2 pages

Tutorial 05

The document describes Dijkstra's shortest path algorithm and provides an example graph with 8 vertices labeled a through h and edges between vertices labeled with distances. The algorithm is to find the shortest paths from vertex a to all other vertices in the graph.

Uploaded by

Sit Lucas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
41 views2 pages

Tutorial 05

The document describes Dijkstra's shortest path algorithm and provides an example graph with 8 vertices labeled a through h and edges between vertices labeled with distances. The algorithm is to find the shortest paths from vertex a to all other vertices in the graph.

Uploaded by

Sit Lucas
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Tutorial 5

Location-based Services
GE2338 Internet Applications and Security
Q1: Dijkstra’s Shortest Path Algorithm

➢ Given a graph of 8 vertices (i.e., a, b, …, h), each edge with its distance
between its connected vertices. Vertex a is the source. Find out all
shortest paths from vertex a to other vertices.
4 2
b d f
6 9

a 7 4 3 h

2 6
c e g
6 3

You might also like