2021.01.30

2021.01.30

flody算法
n1–>n2(任意点)
虽然写起来很方便，但是耗时太长了（暴力）


代码：

#include<cstdio>
#include<stdlib.h>
#include<string.h>
#include<string>
#include<map>
#include<cmath>
#include<iostream>
#include <queue>
#include <stack>
#include<algorithm>
#include<set>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int M = 1e5 + 10;
int d[110][110],m,n;
void f()
{
	for (int k = 1; k <= n; k++)
	{
		for (int i = 1; i <= n; i++)
		{
			for (int j = 1; j <= n; j++)
			{
				d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
			}
		}
	}
}
int main() {
	int x, y, z;
	while (scanf("%d %d", &n, &m) != EOF&&n)
	{
		memset(d, inf, sizeof d);
		for (int i = 1; i <= n; i++)
			d[i][i] = 0;
		while (m--)
		{
			scanf("%d %d %d", &x, &y, &z);
			d[x][y] = d[y][x] = min(d[x][y], z);
		}
		f();
		printf("%d\n", d[1][n]);
	}
	return 0;
}

Dijkstra算法
k(定点)–>n

#include<cstdio>
#include<stdlib.h>
#include<string.h>
#include<string>
#include<map>
#include<cmath>
#include<iostream>
#include <queue>
#include <stack>
#include<algorithm>
#include<set>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int M = 1e5 + 10;
int a[1010][1010];  //a[i][j]表示从i-->j的距离
int Dis[1010];      //dist[i]从v1到i的距离 
int vis[1010];      //标记有没有被访问过     
void dijkstra(int n)
{
	int Min;
	for (int i = 1; i <= n; i++)
		Dis[i] = a[1][i];
	for (int i = 1; i <= n; i++)
	{
		Min = inf;
		int k = 0;
		for (int j = 1; j <= n; j++)
		{
			if (!vis[j] && Dis[j] < Min)
			{
				Min = Dis[j];    //未访问的距离v1最近的点
				k = j;
			}
		}
		vis[k] = 1;//已访问
		for (int j = 1; j <= n; j++)
		{
			if (!vis[j] && Dis[k] + a[k][j] < Dis[j])
				Dis[j] = Dis[k] + a[k][j];
		}
	}
}
int main()
{
	int t,n;
	scanf("%d %d", &t, &n);
	memset(Dis, 0, sizeof(Dis));
	memset(vis, 0, sizeof(vis));
	memset(a, inf, sizeof(a));
	while (t--)
	{
		int x, y, z;
		scanf("%d %d %d", &x, &y, &z);
			a[x][y] = a[y][x] = min(a[x][y],z);
	}
	dijkstra(n);
	printf("%d\n", Dis[n]);
	return 0;
}