Fixing bug raised about uGraph::deleteVertex function leaving null edges in the graph. Implemented an unordered_map that takes a set of vertexdata and returns an iterator to the position of the adjlist containing that vertex in our vector of adjlists. It reduces the lookup time for a given vertex from O(n_v) to O(1)