GraphReader

Trait that classes should implement to read in graphs that nodes have ids of type T.

The reader class is required to implement iteratorSeq, a method which returns a sequence of functions that themselves return an Iterator over NodeIdEdgesMaxId (see its type signature below as well).

It is also required to provide a nodeNumberer[T].

NodeIdEdgesMaxId is a case class defined in ArrayBasedDirectedGraph that stores 1) the id of a node, 2) the ids of its neighbors, and 3) the maximum id of itself and its neighbors.

One useful reference implementation is AdjacencyListGraphReader.

Linear Supertypes

AnyRef, Any

Known Subclasses

AdjacencyListGraphReader, GraphReaderFromDirectory, ListOfEdgesGraphReader

Abstract Value Members

abstract def iterableSeq: Seq[Iterable[NodeIdEdgesMaxId]]

Should return a sequence of NodeIdEdgesMaxId iterables
abstract def nodeNumberer: NodeNumberer[T]

Define node numberer
abstract def reverseParseNode(n: NodeIdEdgesMaxId): String

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.

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def parallelismLimit: Int
def storedGraphDir: StoredGraphDir

Override to modify the graph's stored direction
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
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

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package io

trait GraphReader[T] extends AnyRef

Abstract Value Members

abstract def iterableSeq: Seq[Iterable[NodeIdEdgesMaxId]]

abstract def nodeNumberer: NodeNumberer[T]

abstract def reverseParseNode(n: NodeIdEdgesMaxId): String

Concrete Value Members

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

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def parallelismLimit: Int

def storedGraphDir: StoredGraphDir

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

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

def toArrayBasedDynamicDirectedGraph(): 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

Inherited from AnyRef

Inherited from Any

Ungrouped