Construct a shared array-based graph from a sequence of iterators over NodeIdEdgesMaxId.
Construct a shared array-based graph from a sequence of iterators over NodeIdEdgesMaxId. Eg each NodeIdEdgesMaxId could correspond to one graph dump file.
This function builds the graph using similar steps as in ArrayBasedDirectedGraph. The main difference here is that instead of each node has a separate edge array, here one shared array is used, thus each node can find its edges through an offset into this shared array. The avoid huge arrays, this edge array is also sharded based on node's id.
the sequence of nodes each with its own edges
the executor for parallel execution
the direction of the graph to be built
specifies the number of shards to use in creating shared array
provides methods for constructing a shared array based graph