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
if false (default), the edges are guaranteed to be unique
if true, the neighbors of a node should be sorted by this class
the character that separates the source and destination ids
the directory to read from
the directory to read from
Should return a sequence of NodeIdEdgesMaxId iterables
Should return a sequence of NodeIdEdgesMaxId iterables
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
The reader knows the format as it knows how to read the file.
The reader knows the format as it knows how to read the file. This reverse parses
the input n to a string in that same format.
Override to modify the graph's stored direction
Override to modify the graph's stored direction
Create an ArrayBasedDirectedGraph
Create an ArrayBasedDirectedGraph
Create an ArrayBasedDynamicDirectedGraph
Create an ArrayBasedDynamicDirectedGraph
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. Each edge is in its own line and is of the form: source-id<separator>destination-id where separator is a single character.
One can optionally specify which files in a directory to read. For example, one may have files starting with "part-" that one would like to read, perhaps containing subgraphs of one single graph.
One can optionally specify two additional operations during reading: - to remove duplicate edges - to sort list of adjacent nodes
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.