Please use this identifier to cite or link to this item:
http://irepo.futminna.edu.ng:8080/jspui/handle/123456789/1682
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Nafiu, L. A. | - |
dc.contributor.author | Salu, A. M. | - |
dc.contributor.author | Shehu, Musa Danjuma | - |
dc.date.accessioned | 2021-06-06T09:35:46Z | - |
dc.date.available | 2021-06-06T09:35:46Z | - |
dc.date.issued | 2009-12 | - |
dc.identifier.citation | L. A. Nafiu, A. M. Saliu and M. D. Shehu. (2009): On the Application of Shortest Path Algorithm in Graph Theory to Road Network Analysis. Journal of Mathematical Sciences (JMS). 20(4), 349-357, December. | en_US |
dc.identifier.issn | 0974-5548 | - |
dc.identifier.uri | http://repository.futminna.edu.ng:8080/jspui/handle/123456789/1682 | - |
dc.description.abstract | In this paper, graph theory is being applied to road network analysis of Federal university of Technology, Bosso Campus, Minna. The shortest path algorithm was described and ten data points (locations) were used. The result was generated using software developed in Visual Basic Programming Language for easy computation. It was found that the shortest and most economical route from the main gate to the exit gate is to pass through Geography Laboratory, Professor's Block and Science Complex. Hence, this route is recommended for any visitor moving from the main gate to the exit gate. | en_US |
dc.language.iso | en | en_US |
dc.publisher | . Journal of Mathematical Sciences | en_US |
dc.relation.ispartofseries | 20(4);p349-357 | - |
dc.title | On the Application of Shortest Path Algorithm in Graph Theory to Road Network Analysis. | en_US |
dc.type | Article | en_US |
Appears in Collections: | Mathematics |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Shortest Path.pdf | Journal | 2.61 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.