Python AStarShortestPath示例

示例#1

文件： pywrapgraph.py 项目： ted124/Optimization-Example-Supplier-Selection

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

示例#2

文件： pywrapgraph.py 项目： ayoelasta/vehicleoptimisation

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

示例#3

def AStarShortestPath(node_count, start_node, end_node, graph, heuristic, disconnected_distance):
    return _pywrapgraph.AStarShortestPath(node_count, start_node, end_node, graph, heuristic, disconnected_distance)