-
Notifications
You must be signed in to change notification settings - Fork 5
/
metroworks.cpp
454 lines (417 loc) · 13.8 KB
/
metroworks.cpp
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
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
//run using g++ -std=c++11 Dijkstras.cpp
#include<bits/stdc++.h>
//#include <graphviz/gvc.h>
#include <unistd.h>
#include <sys/types.h>
#include <errno.h>
#include <stdio.h>
#include <sys/wait.h>
#include <stdlib.h>
using namespace std;
template<typename T>
class Graph
{
map<T, list<pair<T,float> > > m;
public:
list<T> path;
void addEdge(T u,T v,float dist,bool bidir=true)
{
m[u].push_back(make_pair(v,dist));
if(bidir)
{
m[v].push_back(make_pair(u,dist));
}
}
void DijkstraGetShortestPathTo(T destination, map<T,T> &prev)
{
for( ; destination!=""; destination = prev[destination])
{
path.push_back(destination);
}
path.reverse();
cout<<"\t\t\t";
copy(path.begin(), path.end(), ostream_iterator<T>(cout, "\n\t\t\t"));
}
bool printAdj(string,string);
void dijsktraSSSP(T,map<T,float> &dist, map<T,T> &prev);
void makedotfile();
vector<string> split (const string &s, char delim)
{
vector<string> result;
stringstream ss (s);
string item;
while (getline (ss, item, delim))
{
result.push_back (item);
}
return result;
}
bool check(string, string);
void calcPrice(string, string);
};
// FARE CALC FUNCTION STARTS
template<typename T>
void Graph<T>::calcPrice(string srstn,string dstn)
{
string line;
int i=0,j=0,k=0,len,last=0;
string num = "";
long arr[235][235];
ifstream infile ("fare.csv");
if(infile.is_open())
{
while(getline(infile,line) )
{
// Takes complete row
// cout << line<< '\n';
k=0,last=0,j=0;
len=line.length();
while(k!=len)
{
if(line[k]==','||k==len-1)
{
//for converting string into number
arr[i][j]=atof(num.append(line,last,k).c_str());
//cout<<"new entry -> "<<arr[i][j]<<" endl \n";
//Emtying string for getting next data
num="";
//increasing column number after saving data
j++;
if(k!=len-1)
last=k+1;
}
k++;
}
//increase row number for array
i++;
}
//close the file
infile.close();
}
else cout << "Unable to open file";
string line1;
int a,b;
a=0;
b=0;
ifstream file("stations.txt");
int f=0;
while(!file.eof())
{
getline(file,line1);
vector<string> v1=split(line1,'\t');
if(v1[1]==srstn)
{
f++;
std::istringstream(v1[0]) >> a;
}
if(v1[1]==dstn)
{
f++;
std::istringstream(v1[0]) >> b;
}
if(f==2)
break;
}
//cout<<"Id of "<<srstn<<" is "<<a<<endl;
//cout<<"Id of "<<dstn<<" is "<<b<<endl;
cout<<endl<<"\t\t\t";
cout<<"--> Fare is: र"<<arr[a-1][b-1]<<endl;
}
// FARE CALCULATION ENDS HERE
template<typename T>
bool Graph<T>::check(string src, string dest)
{
int f=0;
list <string> :: iterator it;
for (it = path.begin(); it != path.end(); ++it)
{
if(*it==src)
{
f++;
}
else if(*it==dest)
{
f++;
}
}
if(f==2)
return true;
else
return false;
}
template<typename T>
void Graph<T>::makedotfile()
{
string a,b,clr;
string labl;
int f;
f=0;
clr="red";
char filename[] = "finalmap.dot";
string delimiter=",";
ofstream fout(filename);
fout<<"graph G {"<<endl;
fout<<"node [shape=rect,dpi=600] margin=0.75"<<endl;
fout<<"\n//"<<clr<<endl;
string x;
ifstream file("data.txt");
while (!file.eof())
{
getline(file,x);
vector<string> v = split(x,',');
a=v[0];
b=v[1];
labl=v[2];
if(f==1)
{
fout<<"\n//"<<clr<<endl;
f=0;
}
if(check(a,b)==true)
fout<<"\""<<a<<"\""<<" -- "<<"\""<<b<<"\""<<" "<<"[label=\""<<labl<<"\",color="<<clr<<" "<<",penwidth=\"8\"];"<<endl;
else
fout<<"\""<<a<<"\""<<" -- "<<"\""<<b<<"\""<<" "<<"[label=\""<<labl<<"\",color="<<clr<<" "<<",penwidth=\"2\"];"<<endl;
if(a=="Seelampur" && f==0)
{
f=1;
clr="blue";
}
else if(a=="Golf Course" && f==0)
{
f=1;
clr="green";
}
else if(a=="Sant Guru Ram Singh Marg" && f==0)
{
f=1;
clr="violet";
}
else if(a=="JL Nehru Stadium" && f==0)
{
f=1;
clr="yellow";
}
}
fout<<"}";
}
template<typename T>
bool Graph<T>::printAdj(string src,string dest)
{
int f;f=0;
//Let try to print the adj list
//Iterate over all the key value pairs in the map
for(auto j:m)
{
if(j.first==src)
f++;
//Iterater over the list of cities
for(auto l:j.second)
{
if(l.first==dest)
{
f++;
}
}
}
if(f>1)
return true;
else
return false;
}
template<typename T>
void Graph<T>::dijsktraSSSP(T src, map<T,float> &dist, map<T,T> &prev)
{
set<pair<float, T> > s;
//Set all distance to infinity
prev.clear();
for(auto j:m)
{
dist[j.first] = numeric_limits<float>::infinity();
prev[j.first] = "";
}
//Make a set to find a out node with the minimum distance
dist[src] = 0;
s.insert(make_pair(0,src));
while(!s.empty())
{
//Find the pair at the front.
auto p = *(s.begin());
T node = p.second; // NODE
float nodeDist = p.first; //NODEDIST
s.erase(s.begin());
//Iterate over neighbours/children of the current node
for(auto childPair: m[node])
{
T dest = childPair.first;
float weight = childPair.second;
float distance_through_node = nodeDist + childPair.second;
if(distance_through_node < dist[childPair.first])
{
//In the set updation of a particular is not possible
// we have to remove the old pair, and insert the new pair to simulation updation
auto f = s.find( make_pair(dist[dest],dest));
if(f!=s.end())
{
s.erase(f);
}
//Insert the new pair
dist[dest] = distance_through_node;
prev[dest] = node;
s.insert(make_pair(dist[dest],dest));
}
}
}
//Lets print distance to all other node from src
/*for(auto d:dist)
{
cout<<d.first<<",is located at distance of "<<d.second<<endl;
}*/
}
int main()
{ system("notify-send -t 5000 -i /home/nightwarrior-xxx/Documents/MetroWorksDS/train1.png \"Metro Works\"");
system("gnome-terminal -x sh -c \"fim --autowindow graph.png\"");
system("clear");
//system("printf '\e[45;5;196m'");
//system("echo \"\e[96m\"");
system("sl -alfe");
system("clear");
cout<<"\t\t"<<" __ __ _ __ __ _ "<<endl;
cout<<"\t\t"<<"| \\/ | ___| |_ _ __ ___ \\ \\ / /__ _ __| | _____"<<endl;
cout<<"\t\t"<<"| |\\/| |/ _ \\ __| '__/ _ \\ \\ \\ /\\ / / _ \\| '__| |/ / __|"<<endl;
cout<<"\t\t"<<"| | | | __/ |_| | | (_) | \\ V V / (_) | | | <\\__ \\ " <<endl;
cout<<"\t\t"<<"|_| |_|\\___|\\__|_| \\___/ \\_/\\_/ \\___/|_| |_|\\_\\___/"<<endl;
system("echo \"\e[96m\"");
//system("figlet Metro Works");
string source, destination;
Graph<string> Metro;
//red
Metro.addEdge("Rithala","Netaji Subhash Place",5.2);
Metro.addEdge("Netaji Subhash Place","Keshav Puram",1.2);
Metro.addEdge("Keshav Puram","Kanhaiya Nagar",0.8);
Metro.addEdge("Kanhaiya Nagar","Inderlok",1.2);
Metro.addEdge("Inderlok","Shastri Nagar",1.2);
Metro.addEdge("Shastri Nagar","Pratap Nagar",1.7);
Metro.addEdge("Pratap Nagar","Pulbangash",0.8);
Metro.addEdge("Pulbangash","Tis Hazari",0.9);
Metro.addEdge("Tis Hazari","Kashmere Gate",1.1);
Metro.addEdge("Kashmere Gate","Shastri Park",2.2);
Metro.addEdge("Shastri Park","Seelampur",1.6);
Metro.addEdge("Seelampur","Welcome",1.1);
//blue
Metro.addEdge("Rajouri Garden","Ramesh Nagar",1);
Metro.addEdge("Ramesh Nagar","Moti Nagar",1.2);
Metro.addEdge("Moti Nagar","Kirti Nagar",1);
Metro.addEdge("Kirti Nagar","Shadipur",0.7);
Metro.addEdge("Shadipur","Patel Nagar",1.3);
Metro.addEdge("Patel Nagar","Rajender Place",0.9);
Metro.addEdge("Rajender Place","Karol Bagh",1);
Metro.addEdge("Karol Bagh","Rajiv Chowk",3.4);
Metro.addEdge("Rajiv Chowk","Barakhamba Road",0.7);
Metro.addEdge("Barakhamba Road","Mandi House",1);
Metro.addEdge("Mandi House","Pragati Maiden",0.8);
Metro.addEdge("Pragati Maiden","Inderprastha",0.8);
Metro.addEdge("Inderprastha","Yamuna Bank",1.8);
Metro.addEdge("Yamuna Bank","Laxmi Nagar",1.3);
Metro.addEdge("Laxmi Nagar","Nirman Vihar",1.1);
Metro.addEdge("Nirman Vihar","Preet Vihar",1.0);
Metro.addEdge("Preet Vihar","Karkar Duma",1.2);
Metro.addEdge("Karkar Duma","Anand Vihar",1.1);
Metro.addEdge("Anand Vihar","Kaushambi",0.8);
Metro.addEdge("Kaushambi","Vaishali",1.6);
Metro.addEdge("Yamuna Bank","Akshardham",1.3);
Metro.addEdge("Akshardham","Mayur Vihar Phase-1",1.8);
Metro.addEdge("Mayur Vihar Phase-1","Mayur Vihar Extention",1.2);
Metro.addEdge("Mayur Vihar Extention","New Ashok Nagar",0.9);
Metro.addEdge("New Ashok Nagar","Noida Sector-15",1.0);
Metro.addEdge("Noida Sector-15","Noida Sector-16",1.1);
Metro.addEdge("Noida Sector-16","Noida Sector-18",1.1);
Metro.addEdge("Noida Sector-18","Botanical Garden",1.1);
Metro.addEdge("Botanical Garden","Golf Course",1.2);
Metro.addEdge("Golf Course","Noida City Center",1.3);
//green
Metro.addEdge("Madipur","Shivaji Park",1.1);
Metro.addEdge("Shivaji Park","Punjabi Bagh",1.6);
Metro.addEdge("Punjabi Bagh","Ashok Park",0.9);
Metro.addEdge("Ashok Park","Inderlok",1.4);
Metro.addEdge("Ashok Park","Sant Guru Ram Singh Marg",1.1);
Metro.addEdge("Sant Guru Ram Singh Marg","Kirti Nagar",1);
Metro.addEdge("Kashmere Gate","Lal Qila",1.5);
Metro.addEdge("Lal Qila","Jama Masjid",0.8);
Metro.addEdge("Jama Masjid","Delhi Gate",1.4);
Metro.addEdge("Delhi Gate","ITO",1.3);
Metro.addEdge("ITO","Mandi House",0.8);
Metro.addEdge("Mandi House","Janptah",1.4);
Metro.addEdge("Janptah","Central Secretariat",1.3);
Metro.addEdge("Central Secretariat","Khan Market",2.1);
Metro.addEdge("Khan Market","JL Nehru Stadium",1.4);
Metro.addEdge("JL Nehru Stadium","Jangpura",0.9);
//yellow
Metro.addEdge("Vishwavidyalaya","Vidhan Sabha",1);
Metro.addEdge("Vidhan Sabha","Civil Lines",1.3);
Metro.addEdge("Civil Lines","Kashmere Gate",1.1);
Metro.addEdge("Kashmere Gate","Chandni Chowk",1.1);
Metro.addEdge("Chandni Chowk","Chawri Bazar",1);
Metro.addEdge("Chawri Bazar","New Delhi",0.8);
Metro.addEdge("New Delhi","Rajiv Chowk",1.1);
Metro.addEdge("Rajiv Chowk","Patel Chowk",1.3);
Metro.addEdge("Patel Chowk","Central Secretariat",0.9);
Metro.addEdge("Central Secretariat","Udyog Bhawan",0.3);
Metro.addEdge("Udyog Bhawan","Lok Kalyan Marg",1.6);
Metro.addEdge("Lok Kalyan Marg","Jor Bagh",1.2);
Metro.addEdge("Samaypur Badli","Rohini Sector - 18",0.8);
Metro.addEdge("Rohini Sector - 18","Haiderpur Badli Mor",1.3);
Metro.addEdge("Haiderpur Badli Mor","Jahangirpuri",1.3);
Metro.addEdge("Jahangirpuri","Adarsh Nagar",1.3);
Metro.addEdge("Adarsh Nagar","Azadpur",1.5);
Metro.addEdge("Azadpur","Model Town",1.4);
Metro.addEdge("Model Town","GTB Nagar",1.4);
Metro.addEdge("GTB Nagar","Vishwavidyalaya",0.8);
Metro.addEdge("Jor Bagh","INA",1.3);
Metro.addEdge("INA","AIIMS",0.8);
Metro.addEdge("AIIMS","Green Park",1.0);
Metro.addEdge("Green Park","Hauz Khas",1.8);
Metro.addEdge("Hauz Khas","Malviya Nagar",1.7);
Metro.addEdge("Malviya Nagar","Saket",0.9);
Metro.addEdge("Saket","Qutab Minar",1.7);
Metro.addEdge("Qutab Minar","Chhattarpur",1.3);
Metro.addEdge("Chhattarpur","Sultanpur",1.6);
Metro.addEdge("Sultanpur","Ghitorni",1.3);
Metro.addEdge("Ghitorni","Arjan Garh",2.7);
Metro.addEdge("Arjan Garh","Guru Dronacharya",2.3);
Metro.addEdge("Guru Dronacharya","Sikandarpur",1.0);
Metro.addEdge("Sikandarpur","MG Road",1.2);
Metro.addEdge("MG Road","IFFCO Chowk",1.1);
Metro.addEdge("IFFCO Chowk","Huda City Centre",1.5);
map<string,float> dist;
map<string,string> prev;
string sourcestn, deststn;
cout<<endl<<endl<<endl;
cout<<"\t\t";
cout<<"Enter source station in capital case: ";
getline(cin,sourcestn);
//system("echo \"\e[92m\"");
cout<<endl;
cout<<"\t\t";
cout<<"Enter destination station in capital case: ";
//system("echo \"\e[96m\"");
getline(cin,deststn);
bool res=Metro.printAdj(sourcestn,deststn);
if(res==false)
{
system("zenity --error --title \"Error Occured\" --text='Invalid Station Entered'");
system("clear");
return 0;
}
//system("echo \"\e[92m\"");
Metro.dijsktraSSSP(sourcestn, dist, prev);
//system("echo \"\e[96m\"");
cout<<endl<<"\t\t";
cout<<"Distance from "<<sourcestn<<" to "<<deststn<<" - "<<dist[deststn]<<" Kms"<<endl;
cout<<endl<<"\t\tPath: "<<endl;
Metro.DijkstraGetShortestPathTo(deststn,prev);
Metro.makedotfile();
Metro.calcPrice(sourcestn,deststn);
system("dot -Tpng finalmap.dot -o path.png");
system("gnome-terminal -- sh -c \"fim --autowindow path.png\"");
return 0;
}