Dijkstra’s Algorithm

[ishu9bansal]

GeeksForGeeks link
https://www.geeksforgeeks.org/dijkstras-algorithm-for-adjacency-list-representation-greedy-algo-8/

Possible use case
https://leetcode.com/contest/biweekly-contest-136/problems/time-taken-to-mark-all-nodes/

Do we need a unified way of representing graph in my c++ codes?
Is it the start of coding all the graph algorithms in my repo and creating a rich library that works well on different use-cases?

This would require a carefully planned data structure to store the graphs.
Its internal states might vary according to the problem's needs; and different sets of algorithms could be triggered depending on that state.