牛客公交线路四种写法

图片:

题目地址：https://ac.nowcoder.com/acm/problem/17511
知识点：最短路
给出四种写法
第一种 dijkstra

#include <bits/stdc++.h>
using namespace std;
int n,m,s,t;
int dis[1010];
bool vis[1010];
int G[1010][1010];
int dij(int s,int t){
    for(int i = 1;i <= n;i++)    //初始化距离表
        dis[i] = G[s][i];
    for(int i = 1;i < n;i++){    
        int Min = 0x3f3f3f3f;
        int index = 0;
        for(int j = 1;j <= n;j++){    //找到当前未被标记的最小边
            if(!vis[j] && dis[j] < Min){
                Min = dis[j];
                index = j;
            }
        }
        vis[index] = 1;    //标记当前边，并确定为最短边
        for(int j = 1;j <= n;j++){
            dis[j] = min(dis[j],G[j][index]+dis[index]);
        }
    }
    return dis[t];
}

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    memset(dis,0x3f,sizeof(dis));
    memset(G,0x3f,sizeof(G));
    cin>>n>>m>>s>>t;
    while(m--){    //读入图
        int a,b,v;
        cin>>a>>b>>v;
        G[a][b] = min(v,G[a][b]);    //可能会出现重边，选最小的那条
        G[b][a] = min(v,G[b][a]);
    }
    for(int i = 1;i <= n;i++)    //置对角线为0
        G[i][i] = 0;
    int tmp = dij(s,t);
    if(tmp >= 0x3f3f3f3f) cout<<-1;    //若距离为无穷大，则输出-1
    else cout<<tmp;
    return 0;
}

第二种 堆优化版dijksta

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
const int mod=1e9+7;
typedef pair<int,int> PII;
const int N = 2e4+7;
int n,m,s,t;
bool st[N];
int dis[N];
int h[N],idx;
struct edge{
	int to;
	int next;
	int wei;
}edge[N];
void add(int a,int b,int c){
	edge[++idx].to=b;
	edge[idx].wei=c;
	edge[idx].next=h[a];
	h[a]=idx;
}
void dij(int s){
	dis[s]=0;
	priority_queue<PII,vector<PII>,greater<PII>> q;
	q.push({0,s});
	while(q.size()){
		//TODO
		auto t=q.top();
		q.pop();
		int ver=t.second,distance=t.first;
		if(st[ver]) continue;
		st[ver]=true;
		for(int i=h[ver];i!=-1;i=edge[i].next){
			int j=edge[i].to;
			if(dis[j]>distance+edge[i].wei){
				dis[j]=distance+edge[i].wei;
				q.push({dis[j],j});
			}
		}
	}
}
void solve(){
	cin>>n>>m>>s>>t;
	memset(h,-1,sizeof h);
	memset(dis,0x3f,sizeof dis);
	for(int i=1;i<=m;i++){
		int a,b,c;
		cin>>a>>b>>c;
		add(a,b,c);
        add(b,a,c);
	}
	dij(s);
		if(dis[t]>=0x3f3f3f3f)
			cout<<"-1"<<" ";
		else
		 cout<<dis[t]<<" ";
	
	cout<<endl;
	
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int t=1;
	//		cin>>t;
	while(t--){
		solve();
	}
}

第三种 bellman_Ford算法`

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define Max 5000005
typedef pair<int,int> PII;
const int mod = 1e9 + 7;
const int N=1010,M=20010;
int n,m,s,t;
int dis[N],backup[N];
bool st[N];
struct Edge{
	int a,b,w;
}edges[2*M];
void bellman_ford(){
	memset(dis,0x3f,sizeof dis);
	dis[s]=0;
	for(int i=1;i<=n;i++){
			memcpy(backup,dis,sizeof dis);
			for(int j=0;j<2*m;j++){
				int a=edges[j].a;
				int b=edges[j].b;
				int w=edges[j].w;
				dis[b]=min(dis[b],backup[a]+w);
			}
	}
}
void solve() {
	cin>>n>>m>>s>>t;
	for(int i=0;i<m;i++)
	{
		int a,b,c;
		cin>>a>>b>>c;
		edges[i]={a,b,c};
        edges[2*m-i]={b,a,c};
	}
	bellman_ford();
	if(dis[t]>=0x3f3f3f3f) cout<<-1<<endl;
	else
		cout << dis[t] << endl;
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cout << fixed << setprecision(12);
	int t = 1;
//	cin >> t;
	while (t--) {
		solve();
	}
}

第四种 SPFA算法

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <queue>

using namespace std;

const int N = 1010, M = 2000010, INF = 1000000000;

int n, m,s,t;
int dist[N], q[N];      // dist表示每个点到起点的距离, q 是队列
int h[N], e[M], v[M], ne[M], idx;       // 邻接表
bool st[N];     // 存储每个点是否在队列中

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

void spfa()
{
    int hh = 0, tt = 0;
    memset(dist, 0x3f, sizeof dist);
    
    queue<int> q;
    dist[s] = 0;
    q.push(s);
    st[s] = 1;
    while (!q.empty())
    {
        int t = q.front();
        q.pop();
        st[t] = 0;
        for (int i = h[t]; i != -1; i = ne[i]){
            int j=e[i];
            if (dist[j] > dist[t] + v[i])
            {
                dist[j] = dist[t] + v[i];
                if (!st[j])
                {
                    st[j] = 1;
                    q.push(j);
                }
            }
        }
    }
}

int main()
{
    memset(h, -1, sizeof h);
    cin >> n >> m>>s>>t;
    for (int i = 0; i < m; i++)
    {
        int a, b, c;
        cin >> a >> b >> c;
        add(a, b, c);
        add(b, a, c);
    }
    spfa();
    if(dist[t]>=0x3f3f3f3f) cout<<-1<<endl;
    else
    cout << dist[t] << endl;
    return 0;
}