def main():
    romania = GraphClass(20)
    romania.add_edge("Oradea","Zerind",71)
    romania.add_edge("Oradea","Sibiu",151)
    romania.add_edge("Zerin","Arad",75)
    romania.add_edge("Arad","Sibiu",140)
    romania.add_edge("Arad","Timisoara",118)
    romania.add_edge("Timisoara","Lugoj",111)
    romania.add_edge("Lugoj","Mehadia",70)
    romania.add_edge("Mehadia","Dobreta",75)
    romania.add_edge("Dobreta","Craiova",120)
    romania.add_edge("Craiova","Rimnicu Vilcea",146)
    romania.add_edge("Rimnicu Vilcea","Sibiu",80)
    romania.add_edge("Rimnicu Vilcea","Pitesti",97)
    romania.add_edge("Craiova","Pitesti",138)
    romania.add_edge("Sibiu","Fagaras",99)
    romania.add_edge("Bucharest","Fagaras",211)
    romania.add_edge("Bucharest","Pitesti",101)
    romania.add_edge("Bucharest","Giurgiu",90)
    romania.add_edge("Bucharest","Urziceni",85)
    romania.add_edge("Hirsova","Urziceni",98)
    romania.add_edge("Hirsova","Eforie",86)
    romania.add_edge("Vaslui","Urziceni",142)
    romania.add_edge("Vaslui","Iasi",92)
    romania.add_edge("Neamt","Iasi",87)

    romania = pg.get_romania_graph()
    print(romania.adj_list)
    romania.print_graph()
    print(romania.weights.get(("A","B")))
    return
コード例 #2
0
def main():
    romania_graph = pg.get_romania_graph()
    romania_prob = RomaniaProblem("Arad", "Bucharest", romania_graph)
    node, details = GraphBFS(romania_prob)
    if node is not None:
        node.print_path()
        print(details)
    return
コード例 #3
0
def main():
    romania_graph = pg.get_romania_graph()
    romania_prob = RomaniaProblem("Arad","Bucharest", romania_graph)
    node, details = ASTAR(romania_prob,pg.romania_huristic())
    if node is not None:
        node.print_path()
        print(details)
    return
def main():
    romania_graph = pg.get_romania_graph()
    romania_prob = RomaniaProblem("Arad", "Bucharest", romania_graph)
    node, v, e, n = dls(romania_prob, 3)
    if isinstance(node, Node):
        node.print_path()
        print((v, e, n, node.cost))
    else:
        print(node)

    return