UCSY's Research Repository

Searching Shortest Path for Military Map

Show simple item record

dc.contributor.author Hein, Nay Zaw
dc.date.accessioned 2019-08-02T04:24:56Z
dc.date.available 2019-08-02T04:24:56Z
dc.date.issued 2009-08-03
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/1608
dc.description.abstract Combinatorial reasoning underlines all analysis of computer systems. It plays a similar role in discrete operational research problems. Two of the most basic mathematical aspects of computer science concern the speed and logical structure of a computer program, Dijkstra’s algorithm solve the single source shortest path problem for a non-negative weights graph. It finds the shortest path from an initial vertex to all the other vertices. This system applies the Dijkstra’s algorithm that search the shortest path. This paper presents searches the Line of Operation on the Military Map. The system is already implemented to reduce the time consuming by searching the shortest path on the Military Map. en_US
dc.language.iso en en_US
dc.publisher Third Local Conference on Parallel and Soft Computing en_US
dc.title Searching Shortest Path for Military Map en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository



Browse

My Account