#include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
#define max 1000
#define inf 50000
using namespace std;
int n,m;
struct node{
int v,l;
node(int vv,int ll){
v=vv;
l=ll;
}
bool operator< (const node& n1) const{
if(l!=n1.l)
return l<n1.l;
else
return v<n1.v;
}
};
vector<node>G[max];
vector<int>path[max];
priority_queue<node>q;
int dist[max];
void dijkstra(int s){
dist[s]=0;
q.push(node(s,0));
while(!q.empty()){
node e=q.top();
q.pop();
if(e.l>dist[e.v]) continue;
for(int i=0;i<G[e.v].size();i++){
if(dist[G[e.v][i].v]>e.l+G[e.v][i].l){
dist[G[e.v][i].v]=e.l+G[e.v][i].l;
q.push(node(G[e.v][i].v,dist[G[e.v][i].v]));
path[G[e.v][i].v]=path[e.v];
path[G[e.v][i].v].push_back(e.v);
}
}
}
}
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++)
dist[i]=inf;
for(int i=0;i<m;i++){
int v,s,l;
cin>>s>>v>>l;
G[s].push_back(node(v,l));
G[v].push_back(node(s,l));
}
dijkstra(1);
cout<<"请输入你想要查询的节点:";
int a;
cin>>a;
for(int i=0;i<path[a].size();i++){
cout<<"节点"<<path[a][i]<<"->";
}
cout<<"节点"<<a<<endl;
cout<<"距离为:"<<dist[a];
return 0;
}
/*
6 6
1 2 2
3 2 4
1 4 5
2 5 2
3 6 3
5 6 3
*/
#include<vector>
#include<queue>
#include<algorithm>
#define max 1000
#define inf 50000
using namespace std;
int n,m;
struct node{
int v,l;
node(int vv,int ll){
v=vv;
l=ll;
}
bool operator< (const node& n1) const{
if(l!=n1.l)
return l<n1.l;
else
return v<n1.v;
}
};
vector<node>G[max];
vector<int>path[max];
priority_queue<node>q;
int dist[max];
void dijkstra(int s){
dist[s]=0;
q.push(node(s,0));
while(!q.empty()){
node e=q.top();
q.pop();
if(e.l>dist[e.v]) continue;
for(int i=0;i<G[e.v].size();i++){
if(dist[G[e.v][i].v]>e.l+G[e.v][i].l){
dist[G[e.v][i].v]=e.l+G[e.v][i].l;
q.push(node(G[e.v][i].v,dist[G[e.v][i].v]));
path[G[e.v][i].v]=path[e.v];
path[G[e.v][i].v].push_back(e.v);
}
}
}
}
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++)
dist[i]=inf;
for(int i=0;i<m;i++){
int v,s,l;
cin>>s>>v>>l;
G[s].push_back(node(v,l));
G[v].push_back(node(s,l));
}
dijkstra(1);
cout<<"请输入你想要查询的节点:";
int a;
cin>>a;
for(int i=0;i<path[a].size();i++){
cout<<"节点"<<path[a][i]<<"->";
}
cout<<"节点"<<a<<endl;
cout<<"距离为:"<<dist[a];
return 0;
}
/*
6 6
1 2 2
3 2 4
1 4 5
2 5 2
3 6 3
5 6 3
*/