a_star_search.py 文件源码

def aStarSearch(G, source, dest, heuristics, pos): 
    visited = {}
    for node in G.nodes():
        visited[node] = False
    final_path = []
    goal = aStarSearchUtil(G, source, visited, final_path, dest, 0)
    prev = -1
    for var in final_path:
        if prev != -1:
            curr = var
            nx.draw_networkx_edges(G, pos, edgelist = [(prev,curr)], width = 2.5, alpha = 0.8, edge_color = 'black')
            prev = curr
        else:
            prev = var
    return