To find the shortest distance between two nodes in a graph we have several algorithms such as Dijkstra’s algorithm, Bellmen ford algorithm, Floyd warshall algorithm etc.