Breadth-First Search, Depth-First Search, Shortest Path, Arbitrage, Strongly Connected Components and Maximum Flow
InstructorHolczer Balazs
Free
Editorial course preview
These 4 complementary views highlight concrete, legible examples from the course presentation.
This title card introduces the topic of Graph Traversal, specifically highlighting Breadth-First Search and Depth-First Search algorithms against a stylized digital network background.
This title slide introduces the topic of shortest path algorithms, specifically highlighting Dijkstra's Algorithm and the Bellman-Ford Method against a digital network background.
This title card introduces the topic of Spanning Trees, specifically highlighting Kruskal's Algorithm and Prim's Method as key subjects within this section of the course.
A title slide introduces the topic of Eulerian Paths and the Chinese Postman Problem, set against an abstract digital network background.
The curriculum covers a wide range of essential topics including Dijkstra's, Bellman-Ford, Kruskal's, and the Ford-Fulkerson algorithm, alongside a dedicated complexity theory appendix.
Instruction includes specific course challenges that apply algorithms to real-world scenarios like web crawling and arbitrage.
Some learners report that certain core concepts are glossed over too quickly, occasionally requiring external resources to fully grasp the material.
Feedback indicates that the code font size can be difficult to read and that the instructional pace may feel too rapid for some.
The curriculum aligns well with the target audience of developers and scientists seeking advanced algorithmic thinking.