Learn Graphs Algorithms in Computer Science & Mathematics, theory + hands-on coding and ace Competitive Coding problems!
The curriculum moves beyond basics into specialized topics such as Euler Tour, Lowest Common Ancestor via binary lifting, and tree re-rooting.
Instruction provides significant depth on specific complex topics, such as articulation points.
Editorial course preview
These 3 complementary views highlight concrete, legible examples from the course presentation.
This lecture slide introduces Dijkstra's Algorithm for finding shortest paths in weighted graphs, specifically covering Single Source Shortest Paths (SSSP) concepts.
This image displays a programming problem involving a Snakes and Ladders board game, alongside handwritten notes mapping dice rolls to graph theory concepts and a C++ function signature.
This screenshot displays C++ source code implementing a recursive solution for the Traveling Salesperson Problem, utilizing bitmask dynamic programming to calculate minimum distances between cities.
Coding practice appears restricted to C++, which may exclude those working in other languages. Additionally, the online compiler has been reported as unreliable.
One signal suggests difficulties with instructor pronunciation affecting clarity, as well as a lack of detailed explanations within the GitHub solution repository. Note that these reports predated the displayed update date, which does not prove a correction has been made.
The curriculum aligns with competitive programming goals but presents a mismatch for learners intending to practice in languages other than C++.
