Graph Algorithms

Graphs in data structures are non-linear data structures made up of a finite number of nodes or vertices and the edges that connect them. Graphs in data structures are used to address real-world problems in which it represents the problem area as a network like telephone networks, circuit networks, and social networks.

Visit the following resources to learn more:

• Graph Algorithms I - Topological Sorting, Minimum Spanning Trees, Prims Algorithm - Lecture 6
• Graph Algorithms II - DFS, BFS, Kruskals Algorithm, Union Find Data Structure - Lecture 7
• Graph Algorithms III: Shortest Path - Lecture 8
• Graph Alg. IV: Intro to geometric algorithms - Lecture 9
• Strongly Connected Components Kosarajus Algorithm Graph Algorithm
• Shortest Path Algorithms (playlist) in 16 minutes
• Minimum Spanning Trees (playlist) in 4 minutes
• Algorithms on Graphs - Coursera