-
Notifications
You must be signed in to change notification settings - Fork 0
/
script.js
282 lines (253 loc) · 9.41 KB
/
script.js
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
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
onload = function () {
//curr_data will contain question
let curr_data,V,src,dst;
//question graph
const container = document.getElementById('mynetwork');
//ans graph
const container2 = document.getElementById('mynetwork2');
//on click get new problem
const genNew = document.getElementById('generate-graph');
//on click solve
const solve = document.getElementById('solve');
//from(place 1)
const temptext = document.getElementById('temptext');
//to(place 2)
const temptext2 = document.getElementById('temptext2');
const cities = ['Delhi', 'Mumbai', 'Gujarat', 'Goa', 'Kanpur', 'Jammu', 'Hyderabad', 'Bangalore', 'Gangtok', 'Meghalaya'];
// initialise graph options according to documentation of library
const options = {
edges: {
labelHighlightBold: true,
font: {
size: 20
}
},
nodes: {
font: '12px arial red',
scaling: {
label: true
},
shape: 'icon',
icon: {
face: 'FontAwesome',
code: '\uf015',
size: 40,
color: '#991133',
}
}
};
// Initialize your network!
// Network for question graph
const network = new vis.Network(container);
network.setOptions(options);
// Network for result graph
const network2 = new vis.Network(container2);
network2.setOptions(options);
function createData(){
//creating random number of nodes.
V = Math.floor(Math.random() * 8) + 3; // Ensures V is between 3 and 10
let nodes = [];
for(let i=1;i<=V;i++){
//a/c to documentation
nodes.push({id:i, label: cities[i-1]})
}
// Prepares vis.js style nodes for our data
nodes = new vis.DataSet(nodes);
// Creating a tree like underlying graph structure
let edges = [];
for(let i=2;i<=V;i++){
//take random number from i-1 to 3
let neigh = i - Math.floor(Math.random()*Math.min(i-1,3)+1); // Picks a neighbour from i-3 to i-1
//a/c to documentation
edges.push({type: 0, from: i, to: neigh, color: 'orange',label: String(Math.floor(Math.random()*70)+31)});
}
//adding edges dynamically and overall connected
for(let i=1;i<=V/2;){
//randomly take two nodes
let n1 = Math.floor(Math.random()*V)+1;
let n2 = Math.floor(Math.random()*V)+1;
if(n1!==n2){
if(n1<n2){
let tmp = n1;
n1 = n2;
n2 = tmp;
}
//if no edge between these two variable then works = 0 , if one edge of type 0 then value 1 , edge type 1 then value is 2
let works = 0;
for(let j=0;j<edges.length;j++){
if(edges[j]['from']===n1 && edges[j]['to']===n2) {
if(edges[j]['type']===0)
works = 1;
else
works = 2;
}
}
//adding an edge
if(works <= 1) {
if (works === 0 && i < V / 4) {
// Adding a bus
edges.push({
type: 0,
from: n1,
to: n2,
color: 'orange',
label: String(Math.floor(Math.random() * 70) + 31)
});
} else {
// Adding a plane
edges.push({
type: 1,
from: n1,
to: n2,
color: 'green',
label: String(Math.floor(Math.random() * 50) + 1)
});
}
i++;
}
}
}
// Setting the new values of global variables
src = 1;
dst = V;
curr_data = {
nodes: nodes,
edges: edges
};
}
genNew.onclick = function () {
// Create new data and display the data
createData();
network.setData(curr_data);
temptext2.innerText = 'Find least time path from '+cities[src-1]+' to '+cities[dst-1];
temptext.style.display = "inline";
temptext2.style.display = "inline";
container2.style.display = "none";
};
solve.onclick = function () {
// Create graph from data and set to display
temptext.style.display = "none";
temptext2.style.display = "none";
container2.style.display = "inline";
//data will return and then print
network2.setData(solveData());
};
function djikstra(graph, sz, src) {
let vis = Array(sz).fill(0);
let dist = [];
for(let i=1;i<=sz;i++)
dist.push([10000,-1]);
dist[src][0] = 0;
for(let i=0;i<sz-1;i++){
let mn = -1;
for(let j=0;j<sz;j++){
if(vis[j]===0){
if(mn===-1 || dist[j][0]<dist[mn][0])
mn = j;
}
}
vis[mn] = 1;
for(let j in graph[mn]){
let edge = graph[mn][j];
if(vis[edge[0]]===0 && dist[edge[0]][0]>dist[mn][0]+edge[1]){
dist[edge[0]][0] = dist[mn][0]+edge[1];
dist[edge[0]][1] = mn;
}
}
}
return dist;
}
function createGraph(data){
let graph = [];
for(let i=1;i<=V;i++){
graph.push([]);
}
for(let i=0;i<data['edges'].length;i++) {
let edge = data['edges'][i];
if(edge['type']===1)
continue;
graph[edge['to']-1].push([edge['from']-1,parseInt(edge['label'])]);
graph[edge['from']-1].push([edge['to']-1,parseInt(edge['label'])]);
}
return graph;
}
function shouldTakePlane(edges, dist1, dist2, mn_dist) {
//act as boolean like if 0 then not take the plane else take weight of plane
let plane = 0;
let p1=-1, p2=-1;
for(let pos in edges){
let edge = edges[pos];
//type 0 = Bus , type 1 = Plane
if(edge['type']===1){
//u , v , w
let to = edge['to']-1;
let from = edge['from']-1;
let wght = parseInt(edge['label']);
//plane can be take from either side bcz of bidirectional
//dist1(Dija from source) and dist2(from destination) are two array from dijakstra'
//min_dist -> distance via bus from src to dst
//forward plane
if(dist1[to][0]+wght+dist2[from][0] < mn_dist){
plane = wght;
p1 = to;
p2 = from;
mn_dist = dist1[to][0]+wght+dist2[from][0];
}
//backward plane
if(dist2[to][0]+wght+dist1[from][0] < mn_dist){
plane = wght;
p2 = to;
p1 = from;
mn_dist = dist2[to][0]+wght+dist1[from][0];
}
}
}
return {plane, p1, p2};
}
function solveData() {
const data = curr_data;
// Creating adjacency list matrix graph from question data
const graph = createGraph(data);
// Applying djikstra from src and dst
let dist1 = djikstra(graph,V,src-1);
let dist2 = djikstra(graph,V,dst-1);
// Initialise min_dist to min distance via bus from src to dst
//dist[distance][parent]
let mn_dist = dist1[dst-1][0];
// See if plane should be used
let {plane, p1, p2} = shouldTakePlane(data['edges'], dist1, dist2, mn_dist);
//create result on seperate graph
let new_edges = [];
//we take plane
if(plane!==0){
//add new edge( from: p1+1, to: p2+1 )
new_edges.push({arrows: { to: { enabled: true}}, from: p1+1, to: p2+1, color: 'green',label: String(plane)});
// Using spread operator to push elements of result of pushEdges to new_edges
new_edges.push(...pushEdges(dist1, p1, false));
new_edges.push(...pushEdges(dist2, p2, true));
} else{
new_edges.push(...pushEdges(dist1, dst-1, false));
}
//as in library
const ans_data = {
nodes: data['nodes'],
edges: new_edges
};
return ans_data;
}
//reverse act as add from u-v and v-u
function pushEdges(dist, curr, reverse) {
let tmp_edges = [];
//stop when we reach to parent
while(dist[curr][0]!==0){
let fm = dist[curr][1];
if(reverse)
tmp_edges.push({arrows: { to: { enabled: true}},from: curr+1, to: fm+1, color: 'orange', label: String(dist[curr][0] - dist[fm][0])});
else
tmp_edges.push({arrows: { to: { enabled: true}},from: fm+1, to: curr+1, color: 'orange', label: String(dist[curr][0] - dist[fm][0])});
curr = fm;
}
return tmp_edges;
}
genNew.click();
};