2026-04-13T16:45:35Z https://meral.edu.mm/oai

oai:meral.edu.mm:recid/3875 2021-12-13T03:59:37Z 1582963302567:1597824273898 user-ucsy

Analysis of Searching Deterministic Shortest Path Algorithms (Depth First Search, Breadth First Search, Uniform Cost Search) Htwe, Khin Mar Naing, Thinn This paper is intended to implement shortest path way oftransportation. To efficiently extract knowledge, Depth FirstSearch (DFS), Breadth First Search (BFS), Uniform CostSearch (UCS) algorithms depend on the efficient processing ofnodes. Using these algorithms, nodes will be retrieved onspecific path. Specified answering can provide the end user oncity and traveler can explore the directory information. It isintended to analysis the DFS, BFS and UCS algorithms forimplementing and designing the model of transportation. Itemphasizes the shortest path way system. This system isimplemented by using J# programming language and datastorage for Microsoft SQL server 2009-08-03 http://hdl.handle.net/20.500.12678/0000003875 https://meral.edu.mm/records/3875