Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

freeCodeCamp

Algorithms Course - Graph Theory Tutorial from a Google Engineer

via freeCodeCamp

Overview

This course on Graph Theory algorithms in computer science aims to teach learners how to create and design excellent algorithms. The course covers a wide range of important algorithms such as Depth First Search, Dijkstra's Shortest Path, Prim's Minimum Spanning Tree, and various Network Flow algorithms. By providing working source code in Java, the course helps solidify understanding and implementation skills. The intended audience for this course includes programmers looking to enhance their algorithm design and problem-solving abilities.

Syllabus

) Graph Theory Introduction.
) Problems in Graph Theory.
) Depth First Search Algorithm.
) Breadth First Search Algorithm.
) Breadth First Search grid shortest path.
) Topological Sort Algorithm.
) Shortest/Longest path on a Directed Acyclic Graph (DAG).
) Dijkstra's Shortest Path Algorithm.
) Dijkstra's Shortest Path Algorithm | Source Code.
) Bellman Ford Algorithm.
) Floyd Warshall All Pairs Shortest Path Algorithm.
) Floyd Warshall All Pairs Shortest Path Algorithm | Source Code.
) Bridges and Articulation points Algorithm.
) Bridges and Articulation points source code.
) Tarjans Strongly Connected Components algorithm.
) Tarjans Strongly Connected Components algorithm source code.
) Travelling Salesman Problem | Dynamic Programming.
) Travelling Salesman Problem source code | Dynamic Programming.
) Existence of Eulerian Paths and Circuits.
) Eulerian Path Algorithm.
) Eulerian Path Algorithm | Source Code.
) Prim's Minimum Spanning Tree Algorithm.
) Eager Prim's Minimum Spanning Tree Algorithm.
) Eager Prim's Minimum Spanning Tree Algorithm | Source Code.
) Max Flow Ford Fulkerson | Network Flow.
) Max Flow Ford Fulkerson | Source Code.
) Unweighted Bipartite Matching | Network Flow.
) Mice and Owls problem | Network Flow.
) Elementary Math problem | Network Flow.
) Edmonds Karp Algorithm | Network Flow.
) Edmonds Karp Algorithm | Source Code.
) Capacity Scaling | Network Flow.
) Capacity Scaling | Network Flow | Source Code.
) Dinic's Algorithm | Network Flow.
) Dinic's Algorithm | Network Flow | Source Code.

Taught by

freeCodeCamp.org

Reviews

Start your review of Algorithms Course - Graph Theory Tutorial from a Google Engineer

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.