Shortest Path of a Graph using Centrality Measures
G. Vadivu · International Journal of Advanced Trends in Computer Science and Engineering · 2020
When it comes to finding the shortest path in a graph, most people think of Dijkstra's algorithm.While Dijkstra's algorithm is indeed very useful, there are some other parameters that can be used to find the shortest path while communicating in a weighted network.In a graph network, there are different types of centrality measures used to find the importance of a node.In that Degree Centrality, Closeness Centrality and Betweenness Centrality are useful for identifying the amount of importanceof a node in a graph.Centrality measures are used to find nodes that act as a bridge from one part of a network to another part of a network.In this paper, results shows that there is better possibility to find shortest path using Degree Centrality or Closeness Centrality or Betweenness centrality compared with Dijkstra's algorithm.