6 0 4 6 1 4 3 2 8 2

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Need output for:

Distance S=0 &  Previous 

Dijkstra's Pseudocode
Figure 4.8 Dijkstra's shortest-path algorithm.
procedure dijkstra (G,l, s)
Input:
Output:
Graph G (V, E), directed or undirected;
positive edge lengths {le: e € E}; vertex SE V
For all vertices u reachable from s, (dist (u) is set
to the distance from s to u.
for all uEV:
dist(u) = ∞
prev(u) = nil
dist(s) = 0
H = makequeue (V) (using dist-values as keys)
while H is not empty:
u = deletemin(H)
for all edges (u, v) € E:
if dist(v) > dist(u) +1(u, v):
dist(v) dist(u)+1(u, v)
prev(v) = u
decreasekey(H, v)
6
O
4
6
9
4
3
2
8
5
Given above graph,
and source vertex s = 0
2
Transcribed Image Text:Dijkstra's Pseudocode Figure 4.8 Dijkstra's shortest-path algorithm. procedure dijkstra (G,l, s) Input: Output: Graph G (V, E), directed or undirected; positive edge lengths {le: e € E}; vertex SE V For all vertices u reachable from s, (dist (u) is set to the distance from s to u. for all uEV: dist(u) = ∞ prev(u) = nil dist(s) = 0 H = makequeue (V) (using dist-values as keys) while H is not empty: u = deletemin(H) for all edges (u, v) € E: if dist(v) > dist(u) +1(u, v): dist(v) dist(u)+1(u, v) prev(v) = u decreasekey(H, v) 6 O 4 6 9 4 3 2 8 5 Given above graph, and source vertex s = 0 2
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 5 images

Blurred answer
Knowledge Booster
Binary numbers
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education