Computer scienceAlgorithms and Data StructuresAlgorithmsGraph algorithmsShortest path algorithms

Shortest path problem

Computing the path

Report a typo

Given the weighted graph below:

Calculating a path in a weighted graph

What is the shortest path from the source node $1$ to node $5$ ?

Answer format example: 1 2 3 4 2 3 4 5

If no shortest path exists, type INF.

Enter a short text

___

Create a free account to access the full topic