As seen in the paper (https://www.cs.cmu.edu/~jshun/ligra.pdf): "The
framework has two very simple routines, one for mapping over
edges and one for mapping over vertices. The routines can be applied
to any subset of the vertices, which makes the framework
useful for many graph traversal algorithms that operate on subsets
of the vertices. Based on recent ideas used in a very fast algorithm
for breadth-first search (BFS), the routines automatically adapt to
the density of vertex sets."
As seen in the paper (https://www.cs.cmu.edu/~jshun/ligra.pdf): "The framework has two very simple routines, one for mapping over edges and one for mapping over vertices. The routines can be applied to any subset of the vertices, which makes the framework useful for many graph traversal algorithms that operate on subsets of the vertices. Based on recent ideas used in a very fast algorithm for breadth-first search (BFS), the routines automatically adapt to the density of vertex sets."