algorithms/Java/Dijkstra.java at master · AASF-IIITM/algorithms · 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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
importjava.util.*;
importjava.lang.*;
importjava.io.*;

classShortestPath {

staticfinalintV = 9;
intminDistance(intdist[], BooleansptSet[])
	{

intmin = Integer.MAX_VALUE, min_index = -1;

for (intv = 0; v < V; v++)
if (sptSet[v] == false && dist[v] <= min) {
min = dist[v];
min_index = v;
 }

returnmin_index;
	}

voidprintSolution(intdist[])
	{
System.out.println("Vertex \t\t Distance from Source");
for (inti = 0; i < V; i++)
System.out.println(i + " \t\t " + dist[i]);
	}


voiddijkstra(intgraph[][], intsrc)
	{
intdist[] = newint[V]; // The output array. dist[i] will hold

BooleansptSet[] = newBoolean[V];


for (inti = 0; i < V; i++) {
dist[i] = Integer.MAX_VALUE;
sptSet[i] = false;
 }


dist[src] = 0;


for (intcount = 0; count < V - 1; count++) {

intu = minDistance(dist, sptSet);


sptSet[u] = true;


for (intv = 0; v < V; v++)


if (!sptSet[v] && graph[u][v] != 0 && dist[u] != Integer.MAX_VALUE && dist[u] + graph[u][v] < dist[v])
dist[v] = dist[u] + graph[u][v];
 }


printSolution(dist);
	}


publicstaticvoidmain(String[] args)
	{
intgraph[][] = newint[][] { { 0, 4, 0, 0, 0, 0, 0, 8, 0 },
 { 4, 0, 8, 0, 0, 0, 0, 11, 0 },
 { 0, 8, 0, 7, 0, 4, 0, 0, 2 },
 { 0, 0, 7, 0, 9, 14, 0, 0, 0 },
 { 0, 0, 0, 9, 0, 10, 0, 0, 0 },
 { 0, 0, 4, 14, 10, 0, 2, 0, 0 },
 { 0, 0, 0, 0, 0, 2, 0, 1, 6 },
 { 8, 11, 0, 0, 0, 0, 1, 0, 7 },
 { 0, 0, 2, 0, 0, 0, 6, 7, 0 } };
ShortestPatht = newShortestPath();
t.dijkstra(graph, 0);
	}
}
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
importjava.util.*;
importjava.lang.*;
importjava.io.*;

classShortestPath {

staticfinalintV = 9;
intminDistance(intdist[], BooleansptSet[])
	{

intmin = Integer.MAX_VALUE, min_index = -1;

for (intv = 0; v < V; v++)
if (sptSet[v] == false && dist[v] <= min) {
min = dist[v];
min_index = v;
 }

returnmin_index;
	}

voidprintSolution(intdist[])
	{
System.out.println("Vertex \t\t Distance from Source");
for (inti = 0; i < V; i++)
System.out.println(i + " \t\t " + dist[i]);
	}


voiddijkstra(intgraph[][], intsrc)
	{
intdist[] = newint[V]; // The output array. dist[i] will hold

BooleansptSet[] = newBoolean[V];


for (inti = 0; i < V; i++) {
dist[i] = Integer.MAX_VALUE;
sptSet[i] = false;
 }


dist[src] = 0;


for (intcount = 0; count < V - 1; count++) {

intu = minDistance(dist, sptSet);


sptSet[u] = true;


for (intv = 0; v < V; v++)


if (!sptSet[v] && graph[u][v] != 0 && dist[u] != Integer.MAX_VALUE && dist[u] + graph[u][v] < dist[v])
dist[v] = dist[u] + graph[u][v];
 }


printSolution(dist);
	}


publicstaticvoidmain(String[] args)
	{
intgraph[][] = newint[][] { { 0, 4, 0, 0, 0, 0, 0, 8, 0 },
 { 4, 0, 8, 0, 0, 0, 0, 11, 0 },
 { 0, 8, 0, 7, 0, 4, 0, 0, 2 },
 { 0, 0, 7, 0, 9, 14, 0, 0, 0 },
 { 0, 0, 0, 9, 0, 10, 0, 0, 0 },
 { 0, 0, 4, 14, 10, 0, 2, 0, 0 },
 { 0, 0, 0, 0, 0, 2, 0, 1, 6 },
 { 8, 11, 0, 0, 0, 0, 1, 0, 7 },
 { 0, 0, 2, 0, 0, 0, 6, 7, 0 } };
ShortestPatht = newShortestPath();
t.dijkstra(graph, 0);
	}
}
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
importjava.util.*;
importjava.lang.*;
importjava.io.*;

classShortestPath {

staticfinalintV = 9;
intminDistance(intdist[], BooleansptSet[])
	{

intmin = Integer.MAX_VALUE, min_index = -1;

for (intv = 0; v < V; v++)
if (sptSet[v] == false && dist[v] <= min) {
min = dist[v];
min_index = v;
 }

returnmin_index;
	}

voidprintSolution(intdist[])
	{
System.out.println("Vertex \t\t Distance from Source");
for (inti = 0; i < V; i++)
System.out.println(i + " \t\t " + dist[i]);
	}


voiddijkstra(intgraph[][], intsrc)
	{
intdist[] = newint[V]; // The output array. dist[i] will hold

BooleansptSet[] = newBoolean[V];


for (inti = 0; i < V; i++) {
dist[i] = Integer.MAX_VALUE;
sptSet[i] = false;
 }


dist[src] = 0;


for (intcount = 0; count < V - 1; count++) {

intu = minDistance(dist, sptSet);


sptSet[u] = true;


for (intv = 0; v < V; v++)


if (!sptSet[v] && graph[u][v] != 0 && dist[u] != Integer.MAX_VALUE && dist[u] + graph[u][v] < dist[v])
dist[v] = dist[u] + graph[u][v];
 }


printSolution(dist);
	}


publicstaticvoidmain(String[] args)
	{
intgraph[][] = newint[][] { { 0, 4, 0, 0, 0, 0, 0, 8, 0 },
 { 4, 0, 8, 0, 0, 0, 0, 11, 0 },
 { 0, 8, 0, 7, 0, 4, 0, 0, 2 },
 { 0, 0, 7, 0, 9, 14, 0, 0, 0 },
 { 0, 0, 0, 9, 0, 10, 0, 0, 0 },
 { 0, 0, 4, 14, 10, 0, 2, 0, 0 },
 { 0, 0, 0, 0, 0, 2, 0, 1, 6 },
 { 8, 11, 0, 0, 0, 0, 1, 0, 7 },
 { 0, 0, 2, 0, 0, 0, 6, 7, 0 } };
ShortestPatht = newShortestPath();
t.dijkstra(graph, 0);
	}
}
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
importjava.util.*;
importjava.lang.*;
importjava.io.*;

classShortestPath {

staticfinalintV = 9;
intminDistance(intdist[], BooleansptSet[])
	{

intmin = Integer.MAX_VALUE, min_index = -1;

for (intv = 0; v < V; v++)
if (sptSet[v] == false && dist[v] <= min) {
min = dist[v];
min_index = v;
 }

returnmin_index;
	}

voidprintSolution(intdist[])
	{
System.out.println("Vertex \t\t Distance from Source");
for (inti = 0; i < V; i++)
System.out.println(i + " \t\t " + dist[i]);
	}


voiddijkstra(intgraph[][], intsrc)
	{
intdist[] = newint[V]; // The output array. dist[i] will hold

BooleansptSet[] = newBoolean[V];


for (inti = 0; i < V; i++) {
dist[i] = Integer.MAX_VALUE;
sptSet[i] = false;
 }


dist[src] = 0;


for (intcount = 0; count < V - 1; count++) {

intu = minDistance(dist, sptSet);


sptSet[u] = true;


for (intv = 0; v < V; v++)


if (!sptSet[v] && graph[u][v] != 0 && dist[u] != Integer.MAX_VALUE && dist[u] + graph[u][v] < dist[v])
dist[v] = dist[u] + graph[u][v];
 }


printSolution(dist);
	}


publicstaticvoidmain(String[] args)
	{
intgraph[][] = newint[][] { { 0, 4, 0, 0, 0, 0, 0, 8, 0 },
 { 4, 0, 8, 0, 0, 0, 0, 11, 0 },
 { 0, 8, 0, 7, 0, 4, 0, 0, 2 },
 { 0, 0, 7, 0, 9, 14, 0, 0, 0 },
 { 0, 0, 0, 9, 0, 10, 0, 0, 0 },
 { 0, 0, 4, 14, 10, 0, 2, 0, 0 },
 { 0, 0, 0, 0, 0, 2, 0, 1, 6 },
 { 8, 11, 0, 0, 0, 0, 1, 0, 7 },
 { 0, 0, 2, 0, 0, 0, 6, 7, 0 } };
ShortestPatht = newShortestPath();
t.dijkstra(graph, 0);
	}
}
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
importjava.util.*;
importjava.lang.*;
importjava.io.*;

classShortestPath {

staticfinalintV = 9;
intminDistance(intdist[], BooleansptSet[])
	{

intmin = Integer.MAX_VALUE, min_index = -1;

for (intv = 0; v < V; v++)
if (sptSet[v] == false && dist[v] <= min) {
min = dist[v];
min_index = v;
 }

returnmin_index;
	}

voidprintSolution(intdist[])
	{
System.out.println("Vertex \t\t Distance from Source");
for (inti = 0; i < V; i++)
System.out.println(i + " \t\t " + dist[i]);
	}


voiddijkstra(intgraph[][], intsrc)
	{
intdist[] = newint[V]; // The output array. dist[i] will hold

BooleansptSet[] = newBoolean[V];


for (inti = 0; i < V; i++) {
dist[i] = Integer.MAX_VALUE;
sptSet[i] = false;
 }


dist[src] = 0;


for (intcount = 0; count < V - 1; count++) {

intu = minDistance(dist, sptSet);


sptSet[u] = true;


for (intv = 0; v < V; v++)


if (!sptSet[v] && graph[u][v] != 0 && dist[u] != Integer.MAX_VALUE && dist[u] + graph[u][v] < dist[v])
dist[v] = dist[u] + graph[u][v];
 }


printSolution(dist);
	}


publicstaticvoidmain(String[] args)
	{
intgraph[][] = newint[][] { { 0, 4, 0, 0, 0, 0, 0, 8, 0 },
 { 4, 0, 8, 0, 0, 0, 0, 11, 0 },
 { 0, 8, 0, 7, 0, 4, 0, 0, 2 },
 { 0, 0, 7, 0, 9, 14, 0, 0, 0 },
 { 0, 0, 0, 9, 0, 10, 0, 0, 0 },
 { 0, 0, 4, 14, 10, 0, 2, 0, 0 },
 { 0, 0, 0, 0, 0, 2, 0, 1, 6 },
 { 8, 11, 0, 0, 0, 0, 1, 0, 7 },
 { 0, 0, 2, 0, 0, 0, 6, 7, 0 } };
ShortestPatht = newShortestPath();
t.dijkstra(graph, 0);
	}
}
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
importjava.util.*;
importjava.lang.*;
importjava.io.*;

classShortestPath {

staticfinalintV = 9;
intminDistance(intdist[], BooleansptSet[])
	{

intmin = Integer.MAX_VALUE, min_index = -1;

for (intv = 0; v < V; v++)
if (sptSet[v] == false && dist[v] <= min) {
min = dist[v];
min_index = v;
 }

returnmin_index;
	}

voidprintSolution(intdist[])
	{
System.out.println("Vertex \t\t Distance from Source");
for (inti = 0; i < V; i++)
System.out.println(i + " \t\t " + dist[i]);
	}


voiddijkstra(intgraph[][], intsrc)
	{
intdist[] = newint[V]; // The output array. dist[i] will hold

BooleansptSet[] = newBoolean[V];


for (inti = 0; i < V; i++) {
dist[i] = Integer.MAX_VALUE;
sptSet[i] = false;
 }


dist[src] = 0;


for (intcount = 0; count < V - 1; count++) {

intu = minDistance(dist, sptSet);


sptSet[u] = true;


for (intv = 0; v < V; v++)


if (!sptSet[v] && graph[u][v] != 0 && dist[u] != Integer.MAX_VALUE && dist[u] + graph[u][v] < dist[v])
dist[v] = dist[u] + graph[u][v];
 }


printSolution(dist);
	}


publicstaticvoidmain(String[] args)
	{
intgraph[][] = newint[][] { { 0, 4, 0, 0, 0, 0, 0, 8, 0 },
 { 4, 0, 8, 0, 0, 0, 0, 11, 0 },
 { 0, 8, 0, 7, 0, 4, 0, 0, 2 },
 { 0, 0, 7, 0, 9, 14, 0, 0, 0 },
 { 0, 0, 0, 9, 0, 10, 0, 0, 0 },
 { 0, 0, 4, 14, 10, 0, 2, 0, 0 },
 { 0, 0, 0, 0, 0, 2, 0, 1, 6 },
 { 8, 11, 0, 0, 0, 0, 1, 0, 7 },
 { 0, 0, 2, 0, 0, 0, 6, 7, 0 } };
ShortestPatht = newShortestPath();
t.dijkstra(graph, 0);
	}
}
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
importjava.util.*;
importjava.lang.*;
importjava.io.*;

classShortestPath {

staticfinalintV = 9;
intminDistance(intdist[], BooleansptSet[])
	{

intmin = Integer.MAX_VALUE, min_index = -1;

for (intv = 0; v < V; v++)
if (sptSet[v] == false && dist[v] <= min) {
min = dist[v];
min_index = v;
 }

returnmin_index;
	}

voidprintSolution(intdist[])
	{
System.out.println("Vertex \t\t Distance from Source");
for (inti = 0; i < V; i++)
System.out.println(i + " \t\t " + dist[i]);
	}


voiddijkstra(intgraph[][], intsrc)
	{
intdist[] = newint[V]; // The output array. dist[i] will hold

BooleansptSet[] = newBoolean[V];


for (inti = 0; i < V; i++) {
dist[i] = Integer.MAX_VALUE;
sptSet[i] = false;
 }


dist[src] = 0;


for (intcount = 0; count < V - 1; count++) {

intu = minDistance(dist, sptSet);


sptSet[u] = true;


for (intv = 0; v < V; v++)


if (!sptSet[v] && graph[u][v] != 0 && dist[u] != Integer.MAX_VALUE && dist[u] + graph[u][v] < dist[v])
dist[v] = dist[u] + graph[u][v];
 }


printSolution(dist);
	}


publicstaticvoidmain(String[] args)
	{
intgraph[][] = newint[][] { { 0, 4, 0, 0, 0, 0, 0, 8, 0 },
 { 4, 0, 8, 0, 0, 0, 0, 11, 0 },
 { 0, 8, 0, 7, 0, 4, 0, 0, 2 },
 { 0, 0, 7, 0, 9, 14, 0, 0, 0 },
 { 0, 0, 0, 9, 0, 10, 0, 0, 0 },
 { 0, 0, 4, 14, 10, 0, 2, 0, 0 },
 { 0, 0, 0, 0, 0, 2, 0, 1, 6 },
 { 8, 11, 0, 0, 0, 0, 1, 0, 7 },
 { 0, 0, 2, 0, 0, 0, 6, 7, 0 } };
ShortestPatht = newShortestPath();
t.dijkstra(graph, 0);
	}
}
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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
importjava.util.*;
importjava.lang.*;
importjava.io.*;

classShortestPath {

staticfinalintV = 9;
intminDistance(intdist[], BooleansptSet[])
	{

intmin = Integer.MAX_VALUE, min_index = -1;

for (intv = 0; v < V; v++)
if (sptSet[v] == false && dist[v] <= min) {
min = dist[v];
min_index = v;
 }

returnmin_index;
	}

voidprintSolution(intdist[])
	{
System.out.println("Vertex \t\t Distance from Source");
for (inti = 0; i < V; i++)
System.out.println(i + " \t\t " + dist[i]);
	}


voiddijkstra(intgraph[][], intsrc)
	{
intdist[] = newint[V]; // The output array. dist[i] will hold

BooleansptSet[] = newBoolean[V];


for (inti = 0; i < V; i++) {
dist[i] = Integer.MAX_VALUE;
sptSet[i] = false;
 }


dist[src] = 0;


for (intcount = 0; count < V - 1; count++) {

intu = minDistance(dist, sptSet);


sptSet[u] = true;


for (intv = 0; v < V; v++)


if (!sptSet[v] && graph[u][v] != 0 && dist[u] != Integer.MAX_VALUE && dist[u] + graph[u][v] < dist[v])
dist[v] = dist[u] + graph[u][v];
 }


printSolution(dist);
	}


publicstaticvoidmain(String[] args)
	{
intgraph[][] = newint[][] { { 0, 4, 0, 0, 0, 0, 0, 8, 0 },
 { 4, 0, 8, 0, 0, 0, 0, 11, 0 },
 { 0, 8, 0, 7, 0, 4, 0, 0, 2 },
 { 0, 0, 7, 0, 9, 14, 0, 0, 0 },
 { 0, 0, 0, 9, 0, 10, 0, 0, 0 },
 { 0, 0, 4, 14, 10, 0, 2, 0, 0 },
 { 0, 0, 0, 0, 0, 2, 0, 1, 6 },
 { 8, 11, 0, 0, 0, 0, 1, 0, 7 },
 { 0, 0, 2, 0, 0, 0, 6, 7, 0 } };
ShortestPatht = newShortestPath();
t.dijkstra(graph, 0);
	}
}