Found in
compilers
Articles
GRA
Algorithm
Depth-first search
Goes deep, marks each vertex's entry and exit and finds cycles by them in O(V + E).
O(V + E)
2 problems
GRA
Algorithm
Graph colouring
Different colours for neighbours: the greedy way, the smallest-last order, DSatur and exact search on maps and timetables.
O(V + E) for greedy in a given order and smallest last; O((V + E) log V) for DSatur with a heap
2 problems
Problems
Often together
graph 2 classic 2 traversal 1 connectivity 1 dependency order 1 stack 1 recursion 1 builds and packages 1 interviews 1 greedy 1 backtracking 1 heuristic 1