Search Hamiltonian path and cycle|
Depth-first search and breadth-first search|
Search all paths from vertex A to vertex B|
Search strongly connected component|
Search longest path on graph|
Bellman–Ford algorithm|