Minimum Distance in a Graph | Dataford Interview Questions

Write a function to calculate the minimum distance in a graph.

Use the signature def shortest_distance(graph, source, target):, where graph is an adjacency list and each edge is represented as [neighbor, weight]; return the minimum total weight from source to target, or -1 if unreachable. Edge weights are nonnegative, and examples include directed graphs, cycles, and multiple routes.

Constraints: 1 <= len(graph) <= 5000, 0 <= source, target < len(graph), and every neighbor is a valid node index.

Constraints

1 <= len(graph) <= 5000
0 <= source, target < len(graph)
Each edge is represented as [neighbor, weight]
0 <= neighbor < len(graph)
0 <= weight <= 10^6
All edge weights are nonnegative

Function Signature

def shortest_distance(graph, source, target):

Your question is Minimum Distance in a Graph. 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

Write a function to calculate the minimum distance in a graph.

Constraints: 1 <= len(graph) <= 5000, 0 <= source, target < len(graph), and every neighbor is a valid node index.

Constraints

1 <= len(graph) <= 5000
0 <= source, target < len(graph)
Each edge is represented as [neighbor, weight]
0 <= neighbor < len(graph)
0 <= weight <= 10^6
All edge weights are nonnegative

Function Signature

def shortest_distance(graph, source, target):

Your question is Minimum Distance in a Graph. 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.