William Fiset's Graph Theory Playlist: study plan and how long it takes
The WilliamFiset playlist is 43 videos and 8.3 hours long. Here's how long it takes at different paces, a week-by-week schedule built from the real videos, and a planner that turns it into your own daily plan.
43 videos · 8.3 hours · WilliamFiset
William Fiset's graph theory playlist is known for clear animations and source code walkthroughs. It covers BFS and DFS, trees and LCA, shortest paths on DAGs, Dijkstra, Bellman-Ford and Floyd-Warshall, bridges and SCCs, the travelling salesman problem, Eulerian paths, and network flow with Ford-Fulkerson, bipartite matching and Dinic's algorithm.
The network flow section goes further than most interview courses and is popular with competitive programmers.
Who it's for: Students and competitive programmers who want visual explanations of graph algorithms, including advanced ones like max flow.
How long does it take?
The full playlist is 8.3 hours across 43 videos. Here's roughly how many days that is at different daily watch times and speeds, counting video time only:
| Daily time | At 1x | At 1.5x | At 2x |
|---|---|---|---|
| 30 min a day | 17 days | 12 days | 9 days |
| 1 h a day | 9 days | 6 days | 5 days |
| 2 h a day | 5 days | 3 days | 3 days |
Make your own schedule
The playlist link is already filled in. Press Plan, set how much time you have each day and your speed, and you'll get a day-by-day schedule with a finish date and a calendar file. It reads the live playlist, so new videos are included.
Week-by-week schedule
A sample plan at 1 hour a day and normal speed, using whole videos so none is split across days. That's 2 weeks in total. For a different pace, start date or speed, use the planner above.
Week 1Videos 1–31 · 6h 12m
Day 1 · 45m
- 1Graph Theory Algorithms3m
- 2Graph Theory Introduction14m
- 3Overview of algorithms in Graph Theory10m
- 4Depth First Search Algorithm | Graph Theory10m
- 5Breadth First Search Algorithm | Shortest Path | Graph Theory7m
Day 2 · 1h
- 6Breadth First Search grid shortest path | Graph Theory17m
- 7Introduction to tree algorithms | Graph Theory10m
- 8Beginner tree algorithms | Graph Theory10m
- 9Rooting a tree | Graph Theory5m
- 10Tree center(s) | Graph Theory6m
- 11Identifying Isomorphic Trees | Graph Theory11m
Day 3 · 48m
- 12Identifying Isomorphic Trees | Source Code | Graph Theory10m
- 13Lowest Common Ancestor (LCA) Problem | Eulerian path method17m
- 14Lowest Common Ancestor (LCA) Problem | Source Code7m
- 15Topological Sort Algorithm | Graph Theory14m
Day 4 · 58m
- 16Topological Sort | Kahn's Algorithm | Graph Theory14m
- 17Shortest/Longest path on a Directed Acyclic Graph (DAG) | Graph Theory10m
- 18Dijkstra's Shortest Path Algorithm | Graph Theory25m
- 19Dijkstra's Shortest Path Algorithm | Source Code | Graph Theory9m
Day 5 · 58m
- 20Bellman Ford Algorithm | Shortest path & Negative cycles | Graph Theory15m
- 21Floyd Warshall All Pairs Shortest Path Algorithm | Graph Theory | Dynamic Programming16m
- 22Floyd Warshall All Pairs Shortest Path Algorithm | Graph Theory | Dynamic Programming | Source Code9m
- 23Tarjan's Strongly Connected Component (SCC) Algorithm (UPDATED) | Graph Theory18m
Day 6 · 50m
- 24Tarjans Strongly Connected Components algorithm source code | Graph Theory7m
- 25Traveling Salesman Problem | Dynamic Programming | Graph Theory20m
- 26Travelling Salesman Problem source code | Dynamic Programming | Graph Theory13m
- 27Existence of Eulerian Paths and Circuits | Graph Theory10m
Day 7 · 53m
- 28Eulerian Path/Circuit algorithm (Hierholzer's algorithm) | Graph Theory16m
- 29Eulerian Path Algorithm | Graph Theory | Source Code8m
- 30Prim's Minimum Spanning Tree Algorithm | Graph Theory15m
- 31Eager Prim's Minimum Spanning Tree Algorithm | Graph Theory15m
Week 2Videos 32–43 · 2h 3m
Day 8 · 59m
- 32Eager Prim's Minimum Spanning Tree Algorithm | Source Code8m
- 33Max Flow Ford Fulkerson | Network Flow | Graph Theory13m
- 34Max Flow Ford Fulkerson | Source Code17m
- 35Unweighted Bipartite Matching | Network Flow | Graph Theory11m
- 36Bipartite Matching | Mice and Owls problem | Network Flow | Graph Theory8m
Day 9 · 55m
- 37Bipartite Matching | Elementary Math problem | Network Flow | Graph Theory11m
- 38Edmonds Karp Algorithm | Network Flow | Graph Theory10m
- 39Edmonds Karp Algorithm | Source Code6m
- 40Capacity Scaling | Network Flow | Graph Theory10m
- 41Capacity Scaling | Network Flow | Source Code6m
- 42Dinic's Algorithm | Network Flow | Graph Theory12m
Day 10 · 10m
- 43Dinic's Algorithm | Network Flow | Source Code10m
Tips for finishing
- Most algorithms have a theory video followed by a source code video. Watch them back to back, then implement it yourself.
- If you're preparing for interviews rather than contests, you can stop before the network flow videos.