def single_source_bellman_ford_path(G, source, cutoff=None, weight='weight'):
 (length, path) = single_source_bellman_ford(G, source, cutoff=cutoff, weight=weight)
 return path

def single_source_bellman_ford_path ( G , source , cutoff = None , weight = 'weight' ) : ( length , path ) = single_source_bellman_ford ( G , source , cutoff = cutoff , weight = weight ) return path
compute shortest path between source and all other reachable nodes for a weighted graph .