C++ implementation on how to store the connections for the graph in an adjacency matrix using Compressed Sparse Row(less zero) format. There should be 2 iterators, one that produces the neighbors for a given vertex, and other iterator produces each edge of the graph once.