Graphs line
Advanced Graphs problems
Graphs whose links have costs or an order. The problems find the cheapest route, the cheapest way to join every place, and an order for tasks that depend on each other.
- 3 medium
- 3 hard
The 6 problems
In the order the app teaches them. Each page has the problem, five hints and the explained solution.
On the roadmap
Advanced Graphs is a station on the graphs line. It builds on Heap / Priority Queue and Graphs. No line goes on from here.
The roadmap says why each line runs in its order.
Patterns
5 patterns solve these problems. Naming them gives the problems’ methods away, so the list is folded.
Show the 5
- Graph traversal with a visited set1 problem
- Minimum spanning tree1 problem
- Weighted shortest path2 problems
- Binary search on the answer1 problem
- Topological ordering1 problem