Journal of Information Technology, Research and Innovation 2020, Vol-1, Issue-1

June, 2020
Figure 2. Minimum Spanning Tree Network of
Airport to Airport in Myanmar
4. RESULT
The result of applying the Prim's algorithm to
the network in figure1 is, as shown in figure2.
A total distance of 4831.2999...km(4831.3km)
is obtained from the minimum spanning tree in
figure2.
5. CONCLUSION
In the course of this work, it has been
discovered that the Prim's algorithm is
providing the shortest distance between
airports. In one way, it reduces the fuel costs
and time for passenger transportation from one
point to another which normally determines
prices in Myanmar transportation. In
Myanmar, the optimum airline network can be
used for various purposes. Since most of these
networks were in operation in Myanmar, it
would be important to consider the network
architecture in this work in other applications.
ACKNOWLEDGEMENTS
I am thankful to the committee of JITRI and
the editorial board for inviting the submission
of this paper. Without the aid and assistance of
people, this paper would have been
impossible. I want to thank all those people
who help me and also thank the anonymous
reviewers for their helpful feedback.. I would
like to deepest thanks to my family for their
kind help and encouragement. I also would
like to thank the two co-authors for their help.
REFERENCES
{1} Cheriton, David; Tarjan, Robert
Endre(1976),"Finding maximum
spanningtrees",
SIAMJournal on Computing, 5(4): 724-742.
Dijkstra, E.W.(December 1959),"A
[2]
note
on two problems in connexion eith
graphs"(PDF),
Numerische Mathematik,1 (1): 269-271
[3] Frederick S. Hiller, Gerald. J.
Liberman,(2001)"Introduction to Operation
Research",7th edition,ISBN0072321695
[4] Foulds L. F.,"Graph Theory
Applications",Springer-Verlag, New
York,1992
Jarnik. v, (1930),"Ojiste'm.
[5]
proble'mu
minima'lni'm,"[About a certain minimal problem],
Pra'ce Morayske' Prirodevedecke, Spolecnosti (in
Czech), 6 (4): 57-63, hdl:10338. dmlcz/500726
[6] Pettie, Seth; Ramachandran, Vijaya
(January 2002),"An Optimal minimum spanning
tree algorithm"(PDF), Journal of the ACM, 49 (1):
16-34.
[7] Prim. R.C.,(November 1957), "Shortest
connection networks And some generalizations",
Bell System Technical Journal, 36 (6):1389-
1401.Bibcode:1957BSTJ...36.1.389P,doi:10.1002/j
1538-7305.1957.tb01515.x.
[8] Rosen, Kenneth (2011), Discrete
Mathematics and Its Applications(7th ed.),
McGraw-Hill Science,p.798.
[9] Sedgewick, Robert; Wayne Kevin
Daniel(2011), Algorithms (4th ed.),Addison
Wesley, p.628,ISBN978-0-321-57351-3
[10] Taha. H. A.. (2006), Operations Research,
An introduction(7th edition), Pearson Prentice Hall
of India, New Delhi.
Heho
Pokakku
Monywa
Mandalay
Naung U
Sittwe
Kyauktu
Kalaymyo
Homalin
Putao
Khamti
Myitkyina
Bhamo
Lasho
Mong Hsat
Kengtung
Tackilek
Kyaukpyu
Magwe
Naypyidaw
Loikaw
Taungoo
Thandwe
Pathein
Yangon
Mawlaymyaing
Dawei
Myeik
Kawthaung
Bokyin
Journal of Information Technology, Research and Innovation 2020, Vol-1, Issue-1
June, 2020
[11] Wikipedia (2008),
Transport.http//en.wikipedia.org/wiki/pipeline
transport.
[12]Wikipedia, List of airports in Myanmar
[13] Wiston, W.L. (2004), Operations
Research; Applications and Algorithms (4th ed.),
Brooks/Cole- Thomas Learning, Belmont.
APPENDIX A
Calculate the distance between two airports
APPENDIX B
Data Input for Prim's Algorithm
The Result by using Prim's Algorithm
Authors
Biograph