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
