图：最短路dijkstra算法

#include<iostream>
#include<vector>
#include<map>
#include<algorithm>
#define INF INT_MAX
using namespace std;
void dijkstra(vector<vector<pair<int,int> > >& graph,vector<int>& vis,vector<int>& dis,int s){
	dis[s] = 0;
	int n = graph.size();
	for(int i=1;i<=n;i++){
		int u = -1,mdis = INF;
		for(int j=0;j<n;j++){
			if(vis[j] == 0 && dis[j]<mdis){
				mdis = dis[j];
				u = j;
			}
		}
		if(u == -1) return;
		vis[u] = 1;
		for(int j=0;j<graph[u].size();j++){
			int v = graph[u][j].first;
			if(vis[v] == 0 && dis[u]+graph[u][j].second < dis[v]) dis[v] = dis[u]+graph[u][j].second;
		}
	}
}
int main(){
	int vs,es;
	cin>>vs>>es;
	vector<vector<pair<int,int> > > graph(vs);
	vector<int> vis(vs);
	vector<int> dis(vs);
	for(int i=0;i<es;i++){
		int u,v,w;
		cin>>u>>v>>w;
		graph[u].push_back(make_pair(v,w));
		graph[v].push_back(make_pair(u,w));
	}
	fill(vis.begin(),vis.end(),0);
	fill(dis.begin(),dis.end(),INF);
	for(int i=0;i<vs;i++){
		if(vis[i] == 0) dijkstra(graph,vis,dis,i);
	}
	for(int i=0;i<vs;i++) cout<<dis[i]<<" ";
	return 0;
}