com.twitter.cassovary.util.io

GraphReader

Related Doc: package io

trait GraphReader[T] extends AnyRef

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
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. GraphReader
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def iterableSeq: Seq[Iterable[NodeIdEdgesMaxId]]

    Should return a sequence of NodeIdEdgesMaxId iterables

  2. abstract def nodeNumberer: NodeNumberer[T]

    Define node numberer

  3. 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

  1. final def !=(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  5. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  6. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  7. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  8. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  9. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  10. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  11. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  12. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  13. final def notify(): Unit

    Definition Classes
    AnyRef

  14. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  15. def parallelismLimit: Int

  16. def storedGraphDir: StoredGraphDir

    Override to modify the graph's stored direction

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

    Definition Classes
    AnyRef

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

    Create an ArrayBasedDirectedGraph

  19. def toArrayBasedDynamicDirectedGraph(): ArrayBasedDynamicDirectedGraph

    Create an ArrayBasedDynamicDirectedGraph

  20. def toSharedArrayBasedDirectedGraph(numShards: Int = 128): SharedArrayBasedDirectedGraph

    Create a SharedArrayBasedDirectedGraph

    Create a SharedArrayBasedDirectedGraph

    numShards

    Number of shards to split the in-memory array into 128 is an arbitrary default

  21. def toString(): String

    Definition Classes
    AnyRef → Any

  22. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  24. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped