LEAST COST AND ACCURATE ESTIMATION OF SHORTEST PATH IN LARGE GRAPH
Author’s Name : D Dhayalan | K Kanimozhi
Volume 02 Issue 03 Year 2015 ISSN No: 2349-3828 Page no: 15-17
Abstract – Shortest path is a fundamental operation in large-area networks. All methods take area scheme; it selects specific graph nodes as landmark and finding the shortest path from each node .In existing answer we can find out the fast and exact shortest path between two nodes. In this paper, we propose a using bellman-fords algorithm it can solves the shortest path length from the source to all other nodes or determines that a negative cycle exists. It can also find out the minimum cost we build our network and it also find out the minimum path weight. However, it cannot find the shortest path if there is a negative cycle exists.
Keywords –Landmark approach, RDF graphs processor, query optimization, shortest path approximation, social networks