Graph Algorithms Courses

Master Prim's Algorithm for Minimum Spanning Trees: grow one tree from a start vertex by always adding the cheapest crossing edge. Build it in your language of choice and answer bottleneck-edge and connectivity queries, the counterpart to Kruskal.

Graph Algorithms Courses

Certificate on completion

• 9
• 3
• 1
• 55

Master Kruskal's Algorithm for Minimum Spanning Trees. Build union-find, grow an MST by adding the cheapest cycle-free edge in your language of choice, and answer connectivity and bottleneck-edge queries.

Graph Algorithms Courses

Certificate on completion

• 9
• 3
• 1
• 57

Master the Bellman-Ford algorithm: single-source shortest paths that work with negative edge weights, plus negative-cycle detection. Build a relaxation pass, the full algorithm in your language of choice, and answer distance and cycle queries.

Graph Algorithms Courses

Certificate on completion

• 9
• 3
• 1
• 54

Master Dijkstra's Algorithm, the greedy single-source shortest-path method for graphs with non-negative weights. Read weighted edges, build the full distance computation in your language of choice, and answer point-to-point and farthest-vertex queries.

Graph Algorithms Courses

Certificate on completion

• 9
• 3
• 1
• 54

Master Topological Sort, the ordering of a directed acyclic graph so every edge points forward. Compute in-degrees, build an order with Kahn's algorithm in your language of choice, detect cycles, and find the longest path in a DAG.

Graph Algorithms Courses

Certificate on completion

• 9
• 3
• 1
• 55

Master Breadth-First Search, the layer-by-layer graph traversal behind shortest paths. Build the neighbor lookup, write an iterative BFS with a queue in your language of choice, and use it to find shortest-path distances in unweighted graphs.

Graph Algorithms Courses

Certificate on completion

• 9
• 3
• 1
• 54

Master Depth-First Search, a fundamental way to explore a graph. Build the adjacency lookup, write an iterative DFS in your language of choice, analyze its O(V + E) complexity, and use it to count and measure connected components.

Graph Algorithms Courses

Certificate on completion

• 9
• 3
• 1
• 54