Algorithm or Data Structure Problem | Dataford Interview Questions

Write a function to solve a specific algorithm or data structure problem.

Implement find_shortest_paths(n, edges, source) for a directed weighted graph. Return the shortest distance from source to every vertex, using None for unreachable vertices; return None if a negative-weight cycle is reachable from source. edges contains [from_vertex, to_vertex, weight] records, and the result is a list indexed by vertex.

Constraints

1 <= n <= 1000
0 <= len(edges) <= 10000
0 <= from_vertex, to_vertex < n
-10^6 <= weight <= 10^6
0 <= source < n
Parallel edges and self-loops may occur
Return None only when a negative cycle is reachable from source

Function Signature

def find_shortest_paths(n, edges, source):

Your question is Algorithm or Data Structure Problem. 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 solve a specific algorithm or data structure problem.

Constraints

1 <= n <= 1000
0 <= len(edges) <= 10000
0 <= from_vertex, to_vertex < n
-10^6 <= weight <= 10^6
0 <= source < n
Parallel edges and self-loops may occur
Return None only when a negative cycle is reachable from source

Function Signature

def find_shortest_paths(n, edges, source):

Your question is Algorithm or Data Structure Problem. 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.