A complete overview of graph theory algorithms in computer science and mathematics.
InstructorWilliam Fiset
Free
Free
Free
Animations are used to shorten explanation time and aid understanding of algorithm mechanics.
Editorial course preview
These 3 complementary views highlight concrete, legible examples from the course presentation.
This educational slide defines a Minimum Spanning Tree as a subset of edges connecting all vertices without cycles at minimum weight, illustrated with a labeled graph example.
This flow network diagram illustrates a matching problem where input pairs connect to possible answers with unit capacities, demonstrating how graph theory models assignment constraints.
This complex graph visualization demonstrates how large-scale datasets are represented with thousands of colored nodes and edges to illustrate intricate network structures.
Lectures include specific source code walkthroughs for algorithms such as Dijkstra's, Floyd-Warshall, and Dinic's.
The curriculum lacks significant mathematical treatment and detailed path derivations for shortest path topics.
Certain advanced topics, such as the Traveling Salesman Problem involving bitwise operations, lack sufficient explanation of how code relates to the problem.
The curriculum aligns with the target of a deep dive into graph theory and meets the prerequisite of computer science fundamentals.