An Optimistic Routing Based Web Localization System

Abstract

Dijkstra algorithm among the shortest-path algorithms is to solve the shortest-path problem. Dijkstra’s algorithm is probably the best-known and thus most implemented shortest path algorithm. It is based on a priority queue data structure. The "World Wide Web" is a collection of interconnected documents with images and other information stored on computers around the globe. Internet and Web Information Systems (WWW) is an international, archival, peer-reviewed journal that covers all aspects of the Web, including issues related to architectures, applications, Internet and Web information systems, and communities. This system searches a shortest path from the start point to the goal points by creating any nodes and searches shortest path from single south nodes to all nodes by using Dijkstra algorithm. This system intends to find the shortest-path and updates information and calculates shortest path again.