Graph2

The Graph2 class is used for representing "Directed Graphs". It uses an adjacency list 'adj' representation, e.g., adj = { (1, 2), (0), (1) } means that the graph has the following edges { (0, 1), (0, 2), (1, 0), (2, 1) }. Options: (1) the graph may have vertex labels, (2) the graph may have edge labels, and (3) the graph may maintain inverse adjacency via the parent 'par' array can be stored at the cost of nearly doubling the storage requirements.

adj: the array of vertex (child) adjacency list (outgoing edges)
label: the array of vertex labels
elabel: the map of edge labels
inverse: whether to store inverse adjacency list (parents)

Linear Supertypes

Serializable, Serializable, Product, Equals, AnyRef, Any

Instance Constructors

new Graph2(adj: Array[AList], label: Array[TLabel] = Array.ofDim [TLabel] (0), elabel: Map[(Int, Int), TLabel] = Map (), inverse: Boolean = false)

adj
the array of vertex (child) adjacency list (outgoing edges)
label
the array of vertex labels
elabel
the map of edge labels
inverse
whether to store inverse adjacency list (parents)

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
val adj: Array[AList]

the array of vertex (child) adjacency list (outgoing edges)
final def asInstanceOf[T0]: T0

Definition Classes
Any
def buildLabelMap(label: Array[TLabel]): Map[TLabel, AList]

Given an array of labels, returns an index from labels to the lists of vertices containing those labels
Given an array of labels, returns an index from labels to the lists of vertices containing those labels
label
the array of vertex labels of type TLabel
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
val elabel: Map[(Int, Int), TLabel]

the map of edge labels
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
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 getVerticesWithLabel(l: TLabel): AList

Returns the list of vertices in the graph with label 'l'.
Returns the list of vertices in the graph with label 'l'.
l
the vertex label
val inverse: Boolean

whether to store inverse adjacency list (parents)
def isConnected: Boolean

Determines whether or not the graph is connected.
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
val label: Array[TLabel]

the array of vertex labels
val labelMap: Map[TLabel, AList]

the map from label to the list of vertices with the label
def makePar(): Array[AList]

Add the inverse adjacency list for rapid accesses to parent vertices.
def nEdges: Int

Returns the number of edges in the graph.
def nSelfLoops: Int

Determines the number of vertices in the graph that have outgoing edges to themselves.
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
val par: Array[AList]

the optional array of vertex inverse (parent) adjacency list (incoming edges)
def print: Unit

Prints the adjacency list, labels, and labelMap of the graph.
def size: Int

Returns the number of vertices in the graph.
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Indicate basic information about this graph.
Indicate basic information about this graph. Due to its potential size, use print to show graph details.

Definition Classes
Graph2 → 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 graphalytics

case class Graph2(adj: Array[AList], label: Array[TLabel] = Array.ofDim [TLabel] (0), elabel: Map[(Int, Int), TLabel] = Map (), inverse: Boolean = false) extends Product with Serializable

Instance Constructors

new Graph2(adj: Array[AList], label: Array[TLabel] = Array.ofDim [TLabel] (0), elabel: Map[(Int, Int), TLabel] = Map (), inverse: Boolean = false)

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

val adj: Array[AList]

final def asInstanceOf[T0]: T0

def buildLabelMap(label: Array[TLabel]): Map[TLabel, AList]

def clone(): AnyRef

val elabel: Map[(Int, Int), TLabel]

final def eq(arg0: AnyRef): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def getVerticesWithLabel(l: TLabel): AList

val inverse: Boolean

def isConnected: Boolean

final def isInstanceOf[T0]: Boolean

val label: Array[TLabel]

val labelMap: Map[TLabel, AList]

def makePar(): Array[AList]

def nEdges: Int

def nSelfLoops: Int

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val par: Array[AList]

def print: Unit

def size: Int

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped