EULERIAN & HAMILTONIAN

BFS, DFS, SHORTEST PATH:

 

Combinatorics:

 

GRAPH PARTITIONING

SPANNING & STEINER TREES

 

DYNAMIC PROGRAMMING: