Graph Traversal:
- Breadth first traversal
- Depth first traversal
Searching:
- Breadth first search (BFS)
- Iterative deepning search (IDS)
Minimum Spanning Trees:
- Prims algorithm
Pathfinding:
- Dijkstra's Algorithm
- Floyd-Warshall's Algorithm
Cycle detection for undirected graph
Cycle detection for directed graph