ListOfEdgesGraphReader
Related Docs:
object ListOfEdgesGraphReader
| package io
the directory to read from
the string that each part file starts with
nodeNumberer to use with node ids
function that can read id from String
the directory to read from
the directory to read from
Override to use multiple threads
Override to use multiple threads
Should return a sequence of iterators over NodeIdEdgesMaxId objects
Should return a sequence of iterators over NodeIdEdgesMaxId objects
nodeNumberer to use with node ids
nodeNumberer to use with node ids
Returns a reader for a given file (shard).
Returns a reader for a given file (shard).
the string that each part file starts with
the string that each part file starts with
Override to modify the graph's stored direction
Override to modify the graph's stored direction
Create an ArrayBasedDirectedGraph
Create an ArrayBasedDirectedGraph
Create a SharedArrayBasedDirectedGraph
Create a SharedArrayBasedDirectedGraph
Number of shards to split the in-memory array into 128 is an arbitrary default
Reads in a multi-line list of edges from multiple files in a directory, which nodes have ids of type T. Does not check for duplicate edges or nodes.
You can optionally specify which files in a directory to read. For example, you may have files starting with "part-" that you'd like to read. Only these will be read in if you specify that as the file prefix.
You should also specify
nodeNumberer,idReaderfor reading node ids.For a default version for
Intgraphs see ListOfEdgesGraphReader.forIntIds builder method.In each file, a directed edges is defined by a pair of T: from and to. For example, we use
Stringids withseparator, when reading file:In this file, node
ahas two outgoing edges (tobande), nodebhas an outgoing edge to nodedand nodedhas an outgoing edge to nodec.Note that, it is recommended to use AdjacencyListGraphReader, because of its efficiency.