Piink的博客

Dijkstra算法 求一个点（源点）到其余各个顶点的最短路径，也叫做“单源最短路径” 算法基本思想： 每次找到离源点最近的一个顶点，然后以该顶点为中心进行扩展，最终得到源点到其余所有点的最短路径。 模板 //省略了一部分... int inf=0x3f3f3f3f; void init()//初始化 { for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { if(i==j)

Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of tourists’ sunscreen, he wants to avoid swimming and instead reach her