YancyKahn

带负环的图求最小路径带负环 return FALSE, 不带负环 return TRUE; #include <iostream> #include <cstdio> #include <cstring> #include <algorithm> #include <queue> #defind ms(s, t) memeset(s, t, size

Floyd 求两点之间的最短路径 #include <iostream> #include <cstdio> #include <cstring> #include <algorithm> using namespace std; //floyd algorithm const int maxn = 10000; const int INF

Dijkstra 用来求无负边权的最短路径问题#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <vector>#include <queue>using namespace std;//dijkstra algorithmconst int maxn = 100000;

特殊Dijkstra求源最短路径.#include <iostream>#include <cstdio>#include <queue>#include <vector>#include <cstring>using namespace std;const int MAXN = 10005;const int INF = 0x3fffff;struct qnode{ int