visualgo.net
Unknown
Visualgo.net is an interactive visualization platform for learning graph algorithms and data structures through animated, step-by-step demonstrations. It covers core topics like BFS/DFS, shortest-path algorithms (Dijkstra, Bellman-Ford, Floyd-Warshall), MST (Prim/Kruskal), topological sort, SCCs, and more, with editable graphs and playback controls.
More resources on Graph Algorithms
Algorithms, Part II
This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data structures, sorting, and searching algorithms. Part II focuses on graph- and string-processing algorithms. All the features of this course are available for free. People who are interested in digging deeper into the content may wish to obtain the textbook Algorithms, Fourth Edition (upon which the course is based) or visit the website algs4.cs.princeton.edu for a wealth of additional material. This course does not offer a certificate upon completion.
Visualgo.net
Interactive graph visualizations
GeeksforGeeks Graphs
Tutorials and problems
Dijkstra's Algorithm by William Fiset
Shortest paths detailed
DFS and BFS by Abdul Bari
Clear explanation with examples
Introduction to Algorithms
Learn graph algorithms with this introductory course from MIT professors Erik Demaine and Srinivas Devadas. Explore key concepts & practical applications!