#include <bits/stdc++.h>
using namespace std;
const int N=510;
int g[N][N];
int dist[N];
bool st[N];
int n,m;
int dijkstra()
{
memset(dist,0x3f,sizeof dist);
dist[1]=0;
for(int i=0;i<n;i++)
{
int t=-1;
for(int j=1;j<=n;j++)
if(!st[j]&&(t==-1||dist[t]>dist[j]))
t=j;
st[t]=true;
for(int j=1;j<=n;j++)
dist[j]=min(dist[j],dist[t]+g[t][j]);
}
if(dist[n]==0x3f3f3f3f)return -1;
else return dist[n];
}
int main()
{
cout<<"请输入点的个数以及边的个数"<<endl;
cout<<"点的个数n:"<<endl;
cin>>n;
cout<<"边的个数m: "<<endl;
cin>>m;
cout<<"请输入m条边:例如: a b c表示a->b边长为c"<<endl;
memset(g,0x3f,sizeof g);
for(int i=1;i<=m;i++)
{
int a,b,c;
cout<<"请输入第 "<<i<<" 条边:"<<endl;
cin>>a>>b>>c;
g[a][b]=c;
}
cout<<"1->n的距离是: ";
cout<<dijkstra()<<endl;
return 0;
}
#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
const int N=510;
int n,m;
int h[N],e[N],ne[N],w[N],idx;
int dist[N];
bool st[N];
typedef pair<int,int>PII;
priority_queue<PII,vector<PII>,greater<PII>>heap;
void add(int a,int b,int c)
{
e[idx]=b,ne[idx]=h[a],w[idx]=c,h[a]=idx++;
}
int dijkstra()
{
memset(dist,0x3f,sizeof dist);
dist[1]=0;
heap.push({0,1});
while(heap.size())
{
auto t=heap.top();
heap.pop();
int ver=t.y;
int distance=t.x;
if(st[ver])continue;
for(int i=h[ver];~i;i=ne[i])
{
int j=e[i];
if(dist[j]>distance+w[i])
{
dist[j]=distance+w[i];
heap.push({dist[j],j});
}
}
}
if(dist[n]==0x3f3f3f3f)return -1;
else return dist[n];
}
int main()
{
memset(h,-1,sizeof h);
cout<<"请输入点的个数以及边的个数"<<endl;
cout<<"点的个数n:"<<endl;
cin>>n;
cout<<"边的个数m: "<<endl;
cin>>m;
cout<<"请输入m条边:例如: a b c表示a->b边长为c"<<endl;
for(int i=1;i<=m;i++)
{
int a,b,c;
cout<<"请输入第 "<<i<<" 条边:"<<endl;
cin>>a>>b>>c;
add(a,b,c);
}
cout<<"1->n的距离是: ";
cout<<dijkstra()<<endl;
return 0;
}