Shortest Path in Provider Network | Dataford Interview Questions

Write a function to find the shortest path between two nodes in a complex graph representing a healthcare provider network at Apex Health Solutions.

Use the signature def find_shortest_path(graph, start, end):. The directed graph is a dictionary mapping node IDs to lists of [neighbor_id, nonnegative_weight] pairs. Return the node IDs in a minimum-weight path from start to end, or [] if no path exists. If start == end, return [start].

Constraints

1 <= number of nodes <= 5,000
0 <= number of directed edges <= 20,000
Node IDs are unique strings
Each edge is represented as [neighbor_id, weight]
Edge weights are nonnegative integers
The graph may be disconnected
The graph may contain cycles and parallel edges

Function Signature

def find_shortest_path(graph, start, end):

Your question is Shortest Path in Provider Network. 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 find the shortest path between two nodes in a complex graph representing a healthcare provider network at Apex Health Solutions.

Constraints

1 <= number of nodes <= 5,000
0 <= number of directed edges <= 20,000
Node IDs are unique strings
Each edge is represented as [neighbor_id, weight]
Edge weights are nonnegative integers
The graph may be disconnected
The graph may contain cycles and parallel edges

Function Signature

def find_shortest_path(graph, start, end):

Your question is Shortest Path in Provider Network. 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.