cs3012-1 This is a solution to the lowest common ancestor problem implemented in rust. The implementation supports Directed Acyclic Graphs and currently the implementation is O(V) where V is the number of vertices.