#1: KMP in string matching

graph traversal
single-source shortest path
all-pairs shortest path

heapsort — fairly imp

data structure of graph: matrix, sparse matrix