Disclaimer: This article is a blogger original article, reproduced, please indicate the source https://blog.csdn.net/C2681595858/article/details/89065231
- Technical University of Munich (TUM) graph algorithms resources
- Stanford introduction of the A * algorithm
- A * algorithm introduced foreign websites
- Excellent website describes aspects of the algorithm
- The shortest path algorithm currently available are the following.
- Dijkstra's algorithm
- Breadth-first search algorithm (BFS)
- Greedy best-first search algorithm (Greedy Best First Search).
- A * algorithm.
- 2-hop algorithm ( the original is at the proposed scale-free networks).
- bellman-ford algorithm.
- floyd-warshall algorithm. : There is a link to the English version of the animation process algorithm, very easy to use, recommended.