clrs my notes and implementation (in rust) of some algorithms in: CLRS Sort merge sort 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 undirected graph breadth-first search BFS undirected connected componenets UCC directed graph depth-first search DFS (iterative & recursive) Topo Sort