APPLICATION OF GRAPH THEORY IN ONLINE NETWORK SERVICES TO DETERMINE THE SHORTEST JOURNEY

In this paper, we determine the shortest route in online network services by applying the concept of graph theory. The investigation shows how the journey can be visualized as graphs in the nature of vertices and edges. In our research paper, the smallest distance from starting point to final destination is estimated using google map which provides the smallest cumulative cost. In this paper, our focus is to achieve the process in working of google map services using graph theoretical approach to determine the shortest journey and its implementation in computer science using Floyd Warshall algorithm. In this paper, we also give illustrations and prove some results.