Question

6. Consider the following graph: 5 2 y 4 6 5 (a) Find a path from x to y using a greedy algorithm: (b) Find a path from x to y using the Dijkstra's algorithm. Use the last graph to draw the shortest path. 1 x 4 8 x 11 x 3 2 y 9 3 5 1 5 2 y 8 Shortest path

          6. Consider the following graph:
5
2
y
4
6
5
(a) Find a path from x to y using a greedy algorithm:
(b) Find a path from x to y using the Dijkstra's algorithm. Use the last graph to draw the shortest path.
1
x
4
8
x
11
x
3
2
y
9
3
5
1
5
2
y
8
Shortest path

6. Consider the following graph:
5
2
y
4
6
5
(a) Find a path from x to y using a greedy algorithm:
(b) Find a path from x to y using the Dijkstra's algorithm. Use the last graph to draw the shortest path.
1
x
4
8
x
11
x
3
2
y
9
3
5
1
5
2
y
8
Shortest path

Added by Eric A.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Akash M

12/03/2023

Step 1

Step 1: For the greedy algorithm, we start at node x and choose the next node with the shortest distance to y. Show more…

Show all steps

Thanks for your feedback!

6. Consider the following graph: (a) Find a path from x to y using a greedy algorithm. (b) Find a path from x to y using Dijkstra's algorithm. Use the last graph to draw the shortest path.