Find out whether some operations runs faster on adjacency matrix (adjacency list) and change graph representation when useful
The idea is that if some operations (like comparing neighborhoods for trading) are faster on matrix rows, then maybe it is useful to change the graph representation from adjacency map to adjacency matrix (for couple of rows) in order to speed up the computation