Graph Algorithms¶

Graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. Graph algorithms are used in many applications, from social networks to GPS navigation.

Topics¶

• Breadth-First Search (BFS) - Exploring a graph level by level.
• Depth-First Search (DFS) - Exploring a graph branch by branch.
• Dijkstra's Algorithm - Finding the shortest path in weighted graphs.
• Floyd-Warshall Algorithm - Finding all-pairs shortest paths in weighted graphs.
• Topological Sort - Ordering vertices in a DAG based on dependencies.
• Kruskal's Algorithm - Finding the Minimum Spanning Tree (MST) of a graph.
• Prim's Algorithm - Finding the Minimum Spanning Tree (MST) using a node-based approach.