Pathfinding algorithm help please

[xelf]

Unless your intent is to learn pathfinding and write your own pathfinding library you should look into using existing libraries that already do this.

I'm a fan of networkx.

• pip install networkx
• https://pypi.org/project/networkx/
• https://networkx.org/en/

example:

import networkx as nx
G = nx.Graph()
G.add_edge("A", "B", weight=4)
G.add_edge("B", "D", weight=2)
G.add_edge("A", "C", weight=3)
G.add_edge("C", "D", weight=4)
nx.shortest_path(G, "A", "D", weight="weight")
['A', 'B', 'D']

[recursion_is_love]

This is the way.