单元最短路与多源最短路的学习

//单源最短路径算法
#include<bits/stdc++.h>
using namespace std;
#define INF 99999999

// 1.未访问节点   2.中间节点   3.已访问的节点
vector<int> Dijkstra(vector<vector<int> > &graph,int start){
	//graph代表图的邻接矩阵
	int n=graph.size();
	vector<int> visit(n,0);
	vector<int> dist(n,0);
	
	for(int i=0;i<n;i++){
		dist[i]=graph[strat][i];
	}
	vis[start]=1;
	
	for(int i=0;i<n;i++){//更新最短路径的循环,循环进行n次
		int min_dist=INF;
		int middle;
		
		//找之前未被访问过的距离起始节点最近的节点编号
		for(int j=0;j<n;j++){
			if((vis[j]==0)&&(dist[j]<min_dist)){
				min_dist=dist[j];
				middle=j;
			}
		}

		//以middle为中间节点，循环遍历其他所有节点
		for(int j=0;j<n;j++){
			
			//如果当前遍历的节点j未曾作为过中间节点，
			//并且从起始节点到j的距离dist[j]大于从起始节点到middle与从middle到j的距离和
			if((vis[j]==0)&&(dist[j]>graph[middle][j]+dist[middle])){
				//则更新起始节点到j的距离dist[j]
				dist[j]=graph[middle][j]+dist[middle];
			}
		}
		
		vis[middle]=1;
	}
	
	return dist;
}



int main(){
	vector<vector<int> > graph;
	
	int n=6;
	for(int i=0;i<n;i++){
		graph.push_back(vector<int>());
		for(int j=0;j<n;j++){
			graph[i].push_back(INF);//初始化全部路径为正无穷
		}
		
		graph[i][i]=0;
	}
	
	graph[0][1]=100;
	graph[1][0]=100;
	
	graph[0][2]=1200;
	graph[2][0]=1200;
	
	graph[1][2]=900;
	graph[2][1]=900;
	
	graph[1][3]=300;
	graph[3][1]=300;
	
	graph[2][4]=500;
	graph[4][2]=500;
	
	graph[3][4]=1300;
	graph[4][3]=1300;
	
	graph[3][5]=1400;
	graph[5][3]=1400;
	
	graph[4][5]=1500;
	graph[5][4]=1500;
	
	vector<int> dist=Dijkstra(graph,0);
	
}

//多源最短路径算法



#include<bits/stdc++.h>
using namespace std;
#define INF 99999999

int n;
void printPath(int u,int v,int Path[][4]){
	if(Path[u][v]==-1){
		cout<<"<"<<u<<","<<v<<">  ";
	}
	else{
		int mid=Path[u][v];
		printPath(u,mid,Path);
		printPath(mid,v,Path);
	}
}


void Floyd(int n,int Graph[][4],int Path[][4]){
	int i,j,v;
	int a[n][n];
	//初始化graph和path图
	for(i=0;i<n;i++){
		for(j=0;j<n;j++){
			a[i][j]=Graph[i][j];
			Path[i][j]=-1;
		}
	}
	
	
	
	for(v=0;v<n;v++){
		for(i=0;i<n;i++){
			for(j=0;j<n;j++){
				if(a[i][j]>a[i][v]+a[v][j]){
					a[i][j]=a[i][v]+a[v][j];
					Path[i][j]=v;
				}
			}
		}
	}
	
	
}


int main(){
	n=4;
	int Graph[4][4];
	int Path[4][4];
	Graph[0][0]=0;
	Graph[0][1]=5;
		Graph[0][2]=INF;
	Graph[0][3]=7;
		Graph[1][0]=INF;
	Graph[1][1]=0;
		Graph[1][2]=4;
	Graph[1][3]=2;
		Graph[2][0]=3;
	Graph[2][1]=3;
    Graph[2][2]=0;
		Graph[2][3]=2;
	Graph[3][0]=INF;
	Graph[3][1]=INF;
	Graph[3][2]=1;
	Graph[3][3]=0;

	Floyd(4,Graph,Path);

	printPath(1,0,Path);
}

上面是模板，做题的时候一定要注意是否有重边的情况，要有重边选权值最小的边
今上午做了上年省赛的E题路径，有个语法错误找了好半天，memset(a,0,sizeof(a))//数组清零，而我之前写成了memset(a,0,2022);这花了我好长时间，语法还是要多学学呀，发现不懂语法的原理，一旦不用一段时间，再用就很容易错
memset的详细语法看这篇点这里