16. Even though the graph has negative weight edges, step through Dijkstra's
algorithm to calculate supposedly shortest paths from A to every other vertex.
B
2
2
3
A
7
-1
С
D
12
2
2.
-4
E
F.
1
2
G
Your answer
Answers
Answered by
1
Answer:
16. Even though the graph has negative weight edges, step through Dijkstra's
algorithm to calculate supposedly shortest paths from A to every other vertex.
B
2
2
3
A
7
-1
С
D
12
2
2.
-4
E
F.
1
2
G
Your answer
Similar questions