小魚兒

#include <cstdio>#include <algorithm>using namespace std;//Floyd 算法——全源最短路径//伪代码/*枚举顶点k∈[1,n] 以顶点k作为中介点，枚举所有顶点对i和j（i∈[1,n],j∈[1,n] ) 如果dis[i][k]+dis[k][j]<dis[i][j]成立 //找到以k为中...

#include <cstdio>#include <queue>#include <vector>using namespace std;//优化后的Bellman算法——SPFA//1、伪代码queue <int> q;q.push(s) ;//源点s入队while(!q.empty()) //队列非空{ int u=q...

1003 Emergency (25 分)As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams...

//Bellman-Ford 算法求最短路径（可求解负权值）//伪代码for(int i=0;i<n-1;++i) //执行n-1轮操作 { for(each edge u->v) { if(d[u]+length[u->v]<d[v]) //以u为中介点可以使d[v]更小 d[v]=d[u]+length[u->v]; //松弛操作 }...

1030 Travel Plan (30 分)A traveler's map gives the distances between cities along the highways, together with the cost of each highway. Now you are supposed to write a program to help a traveler to d...

#include <cstdio>#include <cstring> #include <algorithm>#include <vector>using namespace std;const int maxv=520;const int INF=1000000000;//利用pre数组先求出每个点的点权或边权之和的模板。可直...

1003 Emergency (25 分)As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue teams...

#include <cstdio>#include <algorithm>using namespace std;const int maxv=1122;const int INF=1000000000;int n,m,s,G[maxv][maxv];int d[maxv];bool vis[maxv]={false};void Dijkstra(int...

#include <cstdio>#include <vector>using namespace std;//单源最短路径——Dijkstra算法//1、伪代码//G为图，一般设成全局变量 ，数组d为源点到达各点的最短路径长度/*Dijstra(G,d[],s){ 初始化； for(循环n次) { u=使d[u]最小的还未被访问的顶点的标号 ...