DataStructuresAndAlgorithms/floyd_warshall.cpp at master · DivanshiGupta/DataStructuresAndAlgorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
// APSP weighted directed graph //O(V^3) weighted directed graph

#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main()
{
	lli v, E;
	cin >> v >> E;
	lli arr[v + 1][v + 1];
	for (lli j = 1; j <= v; j++)
	{
		for (lli p = 1; p <= v; p++)
		{
			if (j != p)
				arr[j][p] = 1000000;
			else
				arr[j][p] = 0;
		}
	}

	for (lli i = 0; i < E; i++)
	{
		lli v1, v2, wt;
		cin >> v1 >> v2 >> wt;
		arr[v1][v2] = wt;
		arr[v2][v1] = wt;
	}
	for (lli i = 1; i <= v; i++)
	{
		lli k = i;
		for (lli j = 1; j <= v; j++)
		{
			for (lli p = 1; p <= v; p++)
			{
				if (arr[j][p] > (arr[j][k] + arr[k][p]))
				{
					arr[j][p] = (arr[j][k] + arr[k][p]);
				}
			}
		}
	}
	for (lli j = 1; j <= v; j++)
	{
		for (lli p = 1; p <= v; p++)
		{
			cout << arr[j][p] << " ";
		}
		cout << endl;
	}
	return 0;
}