迪杰斯特拉

朴素版

#include<bits/stdc++.h>
using namespace std;
const int N =3010;

int n,m;
int g[N][N];
int dist[N]; //1号点到每个点的距离 
bool st[N];//每个点的最短路是不是确定;

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;
	 return dist[n]; 
}

int main()
{
	cin>>n>>m;
	memset(g,0x3f,sizeof g);
	while(m--)
	{
		int a,b,c;
		cin>>a>>b>>c;
		g[a][b]=min(g[a][b],c);
	}
	int t=dijkstra();
	cout<<t;
	return 0;
 } 

堆优化版

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

typedef pair<int,int>PII;
const int N =300010;

int n,m;
int h[N],w[N],e[N],ne[N],idx;
int dist[N]; //1号点到每个点的距离 
bool st[N];//每个点的最短路是不是确定;

void add(int a,int b,int c)
{
	e[idx]=b;w[idx]=c,ne[idx]=h[a],h[a]=idx++;
}

int dijkstra()
{
	memset(dist ,0x3f,sizeof dist);
	dist[1]=0;
	
	priority_queue<PII,vector<PII>,greater<PII>>heap;
	heap.push({0,1}); 
	while(heap.size())
	{
		auto t=heap.top();
		heap.pop();
		int ver=t.second,distance=t.first;
		if(st[ver]) continue;
		for(int i=h[ver];i!=-1;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;
	 return dist[n]; 
}

int main()
{
	cin>>n>>m;
	memset(h,-1,sizeof h);
	while(m--)
	{
		int a,b,c;
		cin>>a>>b>>c;
		add(a,b,c);
	}
	int t=dijkstra();
	cout<<t;
	return 0;
 } 

数据较大的 ll

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

typedef long long ll;
typedef pair<ll,ll> PII;
const ll  INF=0x3f3f3f3f3f3f3f3f;
const int N=3e5+10,M=1e6+10;
int n,m;
int h[N],e[M],ne[M],w[M],idx;
ll dist[N];
bool st[N];

void add(int a,int b,int c)
{
    e[idx]=b, ne[idx]=h[a], w[idx]=c, h[a]=idx++;
}

void dijkstra()
{
    memset(dist,0x3f,sizeof dist);
    dist[1]=0;

    priority_queue<PII,vector<PII>,greater<PII>> heap;
    heap.push({0,1});

    while(!heap.empty())
    {
        auto t=heap.top();
        heap.pop();

        ll ver=t.second,distance=t.first;

        if(st[ver]) continue;
        st[ver]=true;

        for(int i=h[ver];i!=-1;i=ne[i])
        {
            int j=e[i];
            if(dist[j]>distance+w[i])
            {
                dist[j]=distance+w[i];
                heap.push({dist[j],j});
            }
        }
    }
}

int main()
{
  // 请在此输入您的代码
  scanf("%d%d",&n,&m);
  memset(h,-1,sizeof h);
  while(m--)
  {
      int a,b,c;
      cin>>a>>b>>c;
      add(a,b,c);
  }

  dijkstra();
  for(int i=1;i<=n;i++)
  {
      if(dist[i]>=INF) cout<<"-1"<<' ';
      else cout<<dist[i]<<' ';
  }
  return 0;
}