FRAMEWORK AND TOPOLOGY OF SHORTEST ROUTE PROBLEM IN A MAZE UNDIRECTED GRAPH
The problem of serving the on-time client query of shortest path between two vertices in road network has always been solved using an algorithm that avoid reading all input of the large graph because of the limited capacity of memory and time. Such a method does not always give the realistic shortest path and cannot be used for all types of the shortest path problem that consists of vertex to vertex, all pairs and single-source shortest problems. The realistic shortest path is obtained only when all vertices are visited. The memory requirement and the speed of the computation are challenges that need to be considered. Paths in graphs, represented in terms of sets obtained from applying topology on the edges, are all identified in the undirected graph. Therefore, no edge is possibly distracted or left by searching. Such data of sets contains the realistic shortest path. We presented a framework that includes applying the edge topology on the undirected graph and the process of the finding the shortest path from a large data are presented and discussed. The provision of an immediate response to the client query is proposed within a simple framework that consists of the Internet webserver. The evaluation of the proposal, the topology with the framework, showed that it was successful and applicable and steered the researches towards finding the best and fastest service for the problems through the offline techniques of graph data manipulations at the webserver
Keywords: shortest route problem, graph topology, undirected graph, framework