Starting from vertex B, can you obtain single-source shortest paths using Dijkstra's algorithm? Do the edges obtained in question 4 of Exercises overlap with the edges obtained using Dijkstra's...

Starting from vertex B, can you obtain single-source shortest paths using Dijkstra's algorithm?

Do the edges obtained in question 4 of Exercises overlap with the edges obtained using

Dijkstra's algorithm? If yes, explain the logic behind the overlap.