106
DAFTAR PUSTAKA
Aini, Asghar. & Salehipour, Amir. 2012. Speeding Up the Floyd WarshallAlgorithm For The cycle Shortest Path problem. Journal Applied
Mathematics Letters.25,(1-5).
Aprian, Raden Diaz novandi. 2007. Perbandigan Algoritma Djikstra dan Algoritma Floyd Warshall Dalam Penentuan Lintasan Terpendek (Single Pair Shortest Path). Skripsi.Bandung. Institut Teknologi Bandung.
Diestel, Reinhard. 2006. Graph Theory Third Edition, Germany : Springer.
Douglas, R Shier.1981. A Computational Study Of Floyd’s Algorithm. Journal Computerd, Vol 8, No.4, pp (275-293).
Francois, Jean Mondou.Dkk. 1991. Shortest Path Algorithms : A Computational Study With The C programming Language. Journal Computers, Vol.18, no.8, pp.767-786.
Giorgio, Gallo & Steffano, Pallotino. 1998. Shortest Path Algorithm. Pisa: J.C. Baltzer AG. Scientific Publishing Company.
Khan, Pritam. Dkk. 2014. Modification of Floyd Warshall’s Algorithm For Shortest Path Routing in Wireless Sensor Networks. Journal India
Conference.
Munir, R. 2007. Matematika Diskrit Edisi Ketiga. Bandung: Institut Teknologi Bandung.
Barakbah, Ali Ridho., Karlita, Tita., Ahsan, Ahmad Syauqi. 2013. Logika dan Algoritma. Surabaya.
Rudi, Y Kr.Dkk.2014. Penentuan Jarak Terpendek Dengan Algoritma Floyd Warshall. Palembang : Sekolah Tinggi Teknik Musi.
Thomas, H Cormen.2009. Introduction to Algorithm.Third Edition. London: The MIT Press.
Wei, Dachuan.2010. An Optimized Floyd Algorithm For the Shortest Path Problem. Journal Of Networks, Vol.5, No.12.
