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.
