Dijkstra Graph Challenge | Dataford Interview Questions

Solve a Dijkstra-based graph problem at a medium to hard level.

Implement shortest_path(n, edges, source, target). The directed graph has nodes 0 through n - 1; each edge is [from, to, weight]. Return [distance, path], where path lists nodes from source to target. Return [-1, []] when the target is unreachable.

All weights are non-negative. If multiple shortest paths exist, return the path produced by processing edges in their given order.

Constraints

1 <= n <= 5000
0 <= len(edges) <= 20000
0 <= edges[i][0], edges[i][1] < n
0 <= edges[i][2] <= 10^6
0 <= source, target < n
All edge weights are non-negative

Function Signature

def shortest_path(n, edges, source, target):

Your question is Dijkstra Graph Challenge. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Solve a Dijkstra-based graph problem at a medium to hard level.

All weights are non-negative. If multiple shortest paths exist, return the path produced by processing edges in their given order.

Constraints

1 <= n <= 5000
0 <= len(edges) <= 20000
0 <= edges[i][0], edges[i][1] < n
0 <= edges[i][2] <= 10^6
0 <= source, target < n
All edge weights are non-negative

Function Signature

def shortest_path(n, edges, source, target):

Your question is Dijkstra Graph Challenge. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.