Traffic-simulation/demoGraph.java at master · SumedhArani/Traffic-simulation · 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
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
import java.util.*;
public class demoGraph
{
    public static void main(String[] args)
    {
	adjList a1 =new adjList(13);

	a1.insertEdge(1,2,161,1);
	a1.insertEdge(2,3,90,2);
	a1.insertEdge(3,4,150,2);
	a1.insertEdge(4,5,192,1);
	a1.insertEdge(5,6,211,1);
	a1.insertEdge(6,7,192,1);
	a1.insertEdge(7,8,182,1);
	a1.insertEdge(1,8,170,1);
	a1.insertEdge(2,7,95,2);
	a1.insertEdge(6,3,229,2);
	a1.insertEdge(8,13,150,3);
	a1.insertEdge(8,10,150,3);
	a1.insertEdge(8,9,240,2);
	a1.insertEdge(6,9,134,2);
	a1.insertEdge(9,10,150,1);
	a1.insertEdge(9,12,210,3);
	a1.insertEdge(11,12,150,3);
 	a1.insertEdge(10,11,120,2);

 		dijkstra(a1, 1, 12);
    }

    static void dijkstra(adjList a1,int source, int dest)
    {
	pQueue pq = new pQueue(a1.vertexCount());
	element v= new element(source, 0);
	int[] distance =new int[a1.vertexCount()];
	int[] path =new int[a1.vertexCount()];

	pq.insert(source,0);

	for(int i=0;i<a1.vertexCount();i++)
	    {
		distance[i]=-1;
	    }
	distance[source]=0;

	while(!pq.isEmpty())
	    {
		v =pq.getMin();
		int pvertex= v.getVertex();
		node temp =a1.list[pvertex];
		while(temp!=null)
		    {
			int dist = distance[pvertex]+temp.getDistance();
			if(distance[temp.getTvertex()]==-1)
			    {
				distance[temp.getTvertex()]=dist;
				pq.insert(temp.getTvertex(),dist);
				path[temp.getTvertex()]=pvertex;
			    }
			else if(distance[temp.getTvertex()]>dist)
			    {
				distance[temp.getTvertex()]=dist;
				pq.replace(temp.getTvertex(),dist);
				path[temp.getTvertex()]=pvertex;
			    }
			temp =temp.getNext();
		    }
	    }

	System.out.print(dest+"->");
	int index =dest;
	while(index!=source)
	    {
		System.out.print(path[index]+"->");
		index =path[index];
	    }
	System.out.println("Shortest path");

	fastestPath(a1,source,dest);
    }

 static void fastestPath(adjList a1,int source, int dest)
    {
	pQueue pq = new pQueue(a1.vertexCount());
	element v= new element(source, 0);
	int[] distance =new int[a1.vertexCount()];
	int[] path =new int[a1.vertexCount()];

	pq.insert(source,0);

	for(int i=0;i<a1.vertexCount();i++)
	    {
		distance[i]=-1;
	    }
	distance[source]=0;

	while(!pq.isEmpty())
	    {
		v =pq.getMin();
		int pvertex= v.getVertex();
		node temp =a1.list[pvertex];
		while(temp!=null)
		    {
			int dist = distance[pvertex]+temp.getSpeed();
			if(distance[temp.getTvertex()]==-1)
			    {
				distance[temp.getTvertex()]=dist;
				pq.insert(temp.getTvertex(),dist);
				path[temp.getTvertex()]=pvertex;
			    }
			else if(distance[temp.getTvertex()]>dist)
			    {
				distance[temp.getTvertex()]=dist;
				pq.replace(temp.getTvertex(),dist);
				path[temp.getTvertex()]=pvertex;
			    }
			temp =temp.getNext();
		    }
	    }

	System.out.print(dest+"->");
	int index =dest;
	while(index!=source)
	    {
		System.out.print(path[index]+"->");
		index =path[index];
	    }
	System.out.println("Fastest path");
    }

}