Пример #1
0
def DijkstraShortestPath(node_count: 'int', start_node: 'int', end_node: 'int', graph: 'std::function< int64 (int,int) >', disconnected_distance: 'int64') -> "std::vector< int > *":
    return _pywrapgraph.DijkstraShortestPath(node_count, start_node, end_node, graph, disconnected_distance)
Пример #2
0
def DijkstraShortestPath(node_count, start_node, end_node, graph, disconnected_distance):
    return _pywrapgraph.DijkstraShortestPath(node_count, start_node, end_node, graph, disconnected_distance)
def DijkstraShortestPath(
        node_count: "int", start_node: "int", end_node: "int",
        graph: "std::function< int64 (int,int) >",
        disconnected_distance: "int64") -> "std::vector< int > *":
    return _pywrapgraph.DijkstraShortestPath(node_count, start_node, end_node,
                                             graph, disconnected_distance)