Graph Theory37 sections · 1633 units
Open in Course

Common Mistakes

Pitfalls in pattern recognition.

Common mistakes:

1.1. Confusing Euler and Hamiltonian: One is polynomial, one is exponential. Double-check which one the problem asks for.

2.2. Missing the SCC step: If you need to do DP on a directed graph with cycles, condense to DAG first.

3.3. Wrong flow model: Not every optimization is max flow. Check if capacities and conservation laws apply.

4.4. Overcomplicating: Sometimes BFS or DFS is enough. Don't force advanced techniques.

5.5. Forgetting edge cases: Empty graphs, single nodes, disconnected components.

Step back and verify your model matches the problem.