Analysis of Searching Deterministic Shortest Path Algorithms (Depth First Search, Breadth First Search, Uniform Cost Search)

dc.contributor.author	Htwe, Khin Mar
dc.contributor.author	Naing, Thinn
dc.date.accessioned	2019-08-02T04:08:08Z
dc.date.available	2019-08-02T04:08:08Z
dc.date.issued	2009-08-03
dc.identifier.uri	http://onlineresource.ucsy.edu.mm/handle/123456789/1599
dc.description.abstract	This paper is intended to implement shortest path way of transportation. To efficiently extract knowledge, Depth First Search (DFS), Breadth First Search (BFS), Uniform Cost Search (UCS) algorithms depend on the efficient processing of nodes. Using these algorithms, nodes will be retrieved on specific path. Specified answering can provide the end user on city and traveler can explore the directory information. It is intended to analysis the DFS, BFS and UCS algorithms for implementing and designing the model of transportation. It emphasizes the shortest path way system. This system is implemented by using J# programming language and data storage for Microsoft SQL server	en_US
dc.language.iso	en	en_US
dc.publisher	Third Local Conference on Parallel and Soft Computing	en_US
dc.title	Analysis of Searching Deterministic Shortest Path Algorithms (Depth First Search, Breadth First Search, Uniform Cost Search)	en_US
dc.type	Article	en_US