Computes first level neighbours for each vertex
Computes first level neighbours for each vertex
graph where vertex is associated with its first level neighbours
Computes second level neighbours for each vertex
Computes second level neighbours for each vertex
returns map of first level neighbours to their neighbours
Created by Roman Bartusiak (roman.bartusiak@pwr.edu.pl http://riomus.github.io). Utitlity class that produces graphs where vertices are associated with maps of neighbours using it.unimi.dsi.fastutil as data store