Minimum Spanning Trees - Kruskals

Tries

Single source shortest path algorithms

Dijkstra's
The heap functions are same as in Prims

Data-structures for disjoint sets

Minimum Spanning Trees - Prims

Graph Traversal

Recursive DFS
Iterative DFS
BFS

AVL Trees