def BellmanFordShortestPath(
node_count: "int", start_node: "int", end_node: "int",
graph: "std::function< int64 (int,int) >",
disconnected_distance: "int64") -> "std::vector< int > *":
return _pywrapgraph.BellmanFordShortestPath(node_count, start_node,
end_node, graph,
disconnected_distance)
def BellmanFordShortestPath(
node_count: 'int', start_node: 'int', end_node: 'int',
graph: 'std::function< int64 (int,int) >',
disconnected_distance: 'int64') -> "std::vector< int > *":
return _pywrapgraph.BellmanFordShortestPath(node_count, start_node,
end_node, graph,
disconnected_distance)
def BellmanFordShortestPath(node_count, start_node, end_node, graph, disconnected_distance):
return _pywrapgraph.BellmanFordShortestPath(node_count, start_node, end_node, graph, disconnected_distance)