should be done in JAVA. We required to implement Dijkstra’s algorithm code in java and determine the shortest commute time between any two airports in the network. we read given data from file(airline_network )
should be done in JAVA. We required to implement Dijkstra’s algorithm code in java and determine the shortest commute time between any two airports in the network. we read given data from file(airline_network )
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
Code should be done in JAVA. We required to implement Dijkstra’s
network. we read given data from file(airline_network )
![46
1 35.4
K/s
40
41
42
43
44
45
46
47
48
MES
CNBC
airline-network (1) - Read-only
0
D
8
Read Only To make changes, save a copy of this file into ...
-
E
A
A
B
C
1
// source [destinati time]*;
2 CPT;JNB;124;DUR;110;BFN;59;HLA;87;GRJ;129;PLZ;117;
ELS;66;KIM; 130
3 JNB;CPT;109;DUR;135;BFN;86; HLA;116;GRJ;47;PLZ;106; ELS;112;MQP;53;KIM;67;UTN;59
4 DUR;CPT;96;JNB; 109;HLA;47;MQP;59
5 BFN;CPT;103;JNB;118;HLA;132
6 HLA;CPT;75;JNB;54;DUR;70;BFN;62;UTN;116
7 GRJ;CPT;97;JNB;102;HLA;134
8 PLZ;CPT;46;JNB;50
9 ELS;CPT;109;JNB;72
10 MQP;CPT;52;JNB;54;DUR;95
11 KIM;CPT;91;JNB;96
12
UTN;JNB;61;HLA;100
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
fx Enter text or formula here
65%
F
5
8
12:00
G
o
H
1](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F3491c8b3-b740-49e2-9489-50e982fb3ce6%2Fec655bf3-81a4-486c-8100-6ab872bc4abc%2Fn20hf2b_processed.jpeg&w=3840&q=75)
Transcribed Image Text:46
1 35.4
K/s
40
41
42
43
44
45
46
47
48
MES
CNBC
airline-network (1) - Read-only
0
D
8
Read Only To make changes, save a copy of this file into ...
-
E
A
A
B
C
1
// source [destinati time]*;
2 CPT;JNB;124;DUR;110;BFN;59;HLA;87;GRJ;129;PLZ;117;
ELS;66;KIM; 130
3 JNB;CPT;109;DUR;135;BFN;86; HLA;116;GRJ;47;PLZ;106; ELS;112;MQP;53;KIM;67;UTN;59
4 DUR;CPT;96;JNB; 109;HLA;47;MQP;59
5 BFN;CPT;103;JNB;118;HLA;132
6 HLA;CPT;75;JNB;54;DUR;70;BFN;62;UTN;116
7 GRJ;CPT;97;JNB;102;HLA;134
8 PLZ;CPT;46;JNB;50
9 ELS;CPT;109;JNB;72
10 MQP;CPT;52;JNB;54;DUR;95
11 KIM;CPT;91;JNB;96
12
UTN;JNB;61;HLA;100
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
fx Enter text or formula here
65%
F
5
8
12:00
G
o
H
1
![Key
BFN
CPT
DUR
ELS
GRJ
HLA
KIM
MQP
PLZ
FlyMzansi, a new South African airline, has revealed its domestic flight network. As a
travel agent, you need to be aware of the commute times to better advise your clients.
You are provided with the average commute time (in minutes) between each airport.
Note that the commute time may be different for inbound and outbound flights due to
uncontrolled conditions like weather and air traffic. Your task is to implement Dijkstra's
algorithm and determine the shortest commute time between any two airports in the
network.
UTN
Bloemfontein
Cape Town
Durban
East London
George
Lanseria
Kimberley
KIM
Mpumalanga.
Gqeberha/Port Elizabeth
Upington
UTN
MQP; CPT; 52; JNB; 54; DUR; 95
KIM; CPT; 91; JNB; 96
UTN; JNB; 61; HLA; 100
GRI
BFN
PLZ
HLA
JNB
• Kimberley, Gqeberha/Port Elizabeth
Mpumalanga George
ELS
MQP
DUR
The data is included in airline-network.csv:
// source, [destination, time]*;
CPT; JNB; 124; DUR; 110; BFN; 59; HLA; 87; GRJ; 129; PLZ; 117; ELS; 66; KIM; 130
JNB; CPT; 109; DUR; 135; BFN; 86; HLA; 116; GRJ; 47; PLZ; 106; ELS; 112; MQP;53; KIM; 67; UTN; 59
DUR; CPT; 96; JNB; 109; HLA; 47; MQP; 59
BFN; CPT; 103; JNB; 118; HLA; 132
HLA; CPT; 75; JNB; 54; DUR; 70; BFN; 62; UTN; 116
GRJ; CPT;97; JNB; 102; HLA; 134
PLZ; CPT;46; JNB; 50
ELS; CPT; 109; JNB; 72
Your driver program must be named Question1.java.
Write a brief report in which you discuss the shortest path and optimal commute time
between the following airports (source, destination):
2](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F3491c8b3-b740-49e2-9489-50e982fb3ce6%2Fec655bf3-81a4-486c-8100-6ab872bc4abc%2Fh402l_processed.jpeg&w=3840&q=75)
Transcribed Image Text:Key
BFN
CPT
DUR
ELS
GRJ
HLA
KIM
MQP
PLZ
FlyMzansi, a new South African airline, has revealed its domestic flight network. As a
travel agent, you need to be aware of the commute times to better advise your clients.
You are provided with the average commute time (in minutes) between each airport.
Note that the commute time may be different for inbound and outbound flights due to
uncontrolled conditions like weather and air traffic. Your task is to implement Dijkstra's
algorithm and determine the shortest commute time between any two airports in the
network.
UTN
Bloemfontein
Cape Town
Durban
East London
George
Lanseria
Kimberley
KIM
Mpumalanga.
Gqeberha/Port Elizabeth
Upington
UTN
MQP; CPT; 52; JNB; 54; DUR; 95
KIM; CPT; 91; JNB; 96
UTN; JNB; 61; HLA; 100
GRI
BFN
PLZ
HLA
JNB
• Kimberley, Gqeberha/Port Elizabeth
Mpumalanga George
ELS
MQP
DUR
The data is included in airline-network.csv:
// source, [destination, time]*;
CPT; JNB; 124; DUR; 110; BFN; 59; HLA; 87; GRJ; 129; PLZ; 117; ELS; 66; KIM; 130
JNB; CPT; 109; DUR; 135; BFN; 86; HLA; 116; GRJ; 47; PLZ; 106; ELS; 112; MQP;53; KIM; 67; UTN; 59
DUR; CPT; 96; JNB; 109; HLA; 47; MQP; 59
BFN; CPT; 103; JNB; 118; HLA; 132
HLA; CPT; 75; JNB; 54; DUR; 70; BFN; 62; UTN; 116
GRJ; CPT;97; JNB; 102; HLA; 134
PLZ; CPT;46; JNB; 50
ELS; CPT; 109; JNB; 72
Your driver program must be named Question1.java.
Write a brief report in which you discuss the shortest path and optimal commute time
between the following airports (source, destination):
2
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY