Answered: The program must print on the screen…

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

See similar textbooks

Related questions

Question

Alert dont submit AI generated answer.

Write a program that reads a weighted graph and an initial vertex.
The program must print on the screen the minimum paths obtained by Dijkstra's algorithm.

Input: Receives n, m and s; n is the total number of vertices, m the total number of arcs and s is the initial vertex.
Next, m lines, each line with a trio of integers, corresponding to the beginning and end of the arc, followed by the weight of the arc.
(Vertices are identified from 0 to n-1.)

Output: Prints the shortest paths obtained by Dijkstra's algorithm.

Exemple:

Input:

5 10 0
0 1 10
0 4 5
1 2 1
1 4 2
2 3 4
3 2 6
3 0 7
4 1 3
4 2 9
4 3 2

Output:

[0, 8, 9, 7, 5]
[-1, 4, 1, 4, 0]

Expert Solution

Step by step

Solved in 5 steps with 4 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

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