networkx

Graph Dijkstra Algorithm selects the shortest path in the 2D space plane grid node graph, networkx, Python (1) After the Dijkstra Algorithm algorithm is completed, the two-dimensional code generated The weight of all nodes in the grid graph is the shortest path from the starting point (source point) to the current node. In this example, the weight of all adjacent edges in the grid graph is 1. (2) Iteratively search all the way up through the parent pointer saved in each node, until you reach the starting point (source point), which is the shortest path from the starting point to the current node. The parent pointer points to the shortest path parent node to the current node. (3) After the Dijkstra Algorithm pathfinding is completed, the shortest distance from the starting point (source point) to all reachable points is determined (the weight value is the shortest path value). You can get inspiration from it. For example, in a multiplayer battle game, multiple people on a map need to know the path to a certain convergence point at the same time. Then the Dijkstra Algorithm is very suitable for this algorithm application scenario (on the contrary, the Aalgorithm is very suitable…