Next step

Report a typo

Given below is a weighted graph with a partly constructed shortest path tree:

The next step of Dijkstra's algorithm

What node is to be processed at the next step of Dijkstra's algorithm?

Enter a short text
___

Create a free account to access the full topic