clrs

my notes and implementation (in rust) of some algorithms in:

Algorithms Illuminated

Sort

1. merge sort
2. heap sort

Graph

graphs are represented with adjancency list, currently (with two usize Vecs in Rust)

at the moment: parallel edges aren't allowed

at the moment: self-loops aren't allowed

1. undirected graph
   1. breadth-first search BFS
   2. undirected connected componenets UCC
   3. depth first search
   4. dijkstra
2. directed graph
   1. depth-first search DFS (iterative & recursive)
   2. Topo Sort
   3. kosaraju

TODO:

• track memory footprint