New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

最短路径的三种算法以及路径还原与负圈判断 | Joke-Lin | BLOG #20

Open

Weijun-Lin opened this issue Mar 25, 2020 · 0 comments

Labels

09cf0c9a0516d1c6deb7ea53d66b56bb Gitalk

Owner

Weijun-Lin commented Mar 25, 2020

https://joke-lin.top/2018/12/07/2018-12-07-ShortestPath/

图的基础，最短路径的几种解答
单源最短路： Bellman-Ford & Dijkstra 及其简单优化以及负圈的判断
多源最短路：Floyd-Warshall 算法的简单理解
路径还原问题
算法代码及思路主要参考：《挑战程序设计竞赛》

在此之前读者应对图已经有基础的概念，以及图的邻接表 & 邻接矩阵的表示方法

Weijun-Lin added Gitalk 09cf0c9a0516d1c6deb7ea53d66b56bb labels

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment