GraphReaderFromDirectory

abstract def directory: String

Directory name to read files from

abstract def nodeNumberer: NodeNumberer[T]

Define node numberer

abstract def oneShardReader(filename: String): Iterable[NodeIdEdgesMaxId]

Returns a reader for a given file (shard).

abstract def reverseParseNode(n: NodeIdEdgesMaxId): String

The reader knows the format as it knows how to read the file.

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def iterableSeq: Seq[Iterable[NodeIdEdgesMaxId]]

Should return a sequence of NodeIdEdgesMaxId iterables

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def parallelismLimit: Int

def prefixFileNames: String

Filenames prefix

def storedGraphDir: StoredGraphDir

Override to modify the graph's stored direction

final def synchronized[T0](arg0: ⇒ T0): T0

def toArrayBasedDirectedGraph(neighborsSortingStrategy: NeighborsSortingStrategy = LeaveUnsorted, forceSparseRepr: Option[Boolean] = None): ArrayBasedDirectedGraph

Create an ArrayBasedDirectedGraph

def toArrayBasedDynamicDirectedGraph(): ArrayBasedDynamicDirectedGraph

Create an ArrayBasedDynamicDirectedGraph

def toSharedArrayBasedDirectedGraph(forceSparseRepr: Option[Boolean] = None): SharedArrayBasedDirectedGraph

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit