SMutableGraph

Type Members

case class Edge(i: I, j: I) extends Product with Serializable

Represents an edge in the graph.
Represents an edge in the graph. Contains both the indices and the data of the edge.
i
The first index of the edge.
j
The second index of the edge.

Definition Classes
Graph
case class Vertex(i: I) extends Node[(I, V)] with Product with Serializable

Represents a vertex in the graph.
Represents a vertex in the graph. Contains both the index and the data of the vertex.
i
The index of the vertex.

Definition Classes
Graph

Abstract Value Members

abstract def addEdge(i: I, j: I, edge: E): Unit

Adds an edge.
Adds an edge.
i
The first index of the new edge.
j
The second index of the new edge.
edge
The data of the enw edge.
abstract def addVertex(i: I, v: V): Unit

Adds a vertex.
Adds a vertex.
i
The index of the new vertex.
v
The data of the new vertex.
abstract def apply(i: I, j: I): E

Gets the data of the edge at the given pair of indices.
Gets the data of the edge at the given pair of indices.
i
The first index of the edge.
j
The second index of the edge.
returns
The label of the desired edge.

Definition Classes
Graph
abstract def apply(i: I): V

Gets the data of the vertex at the given index.
Gets the data of the vertex at the given index.
i
The index of the desired vertex.
returns
The data of the desired vertex.

Definition Classes
Graph
abstract def edgeIds: Set[(I, I)]

Gets the index pairs of all edges.
Gets the index pairs of all edges.
returns
A set of index pairs of all edges.

Definition Classes
Graph
abstract def edges: Set[Edge]

Gets the edge objects of all edges.
Gets the edge objects of all edges.
returns
A set of edge objects of all edges.

Definition Classes
Graph
abstract def outgoingEdgesOf(i: I): Set[Edge]

Gets the edge objects of the outgoing vertices of the vertex at the given index.
Gets the edge objects of the outgoing vertices of the vertex at the given index.
i
The index of the vertex queried.
returns
A set of edge objects of all outgoing vertices of the vertex queried.

Definition Classes
Graph
abstract def outgoingIdsOf(i: I): Set[I]

Gets the indices of the outgoing vertices of the vertex at the given index.
Gets the indices of the outgoing vertices of the vertex at the given index.
i
The index of the vertex queried.
returns
A set of indices of all outgoing vertices of the vertex queried.

Definition Classes
Graph
abstract def outgoingVerticesOf(i: I): Set[Vertex]

Gets the vertex objects of the outgoing vertices of the vertex at the given index.
Gets the vertex objects of the outgoing vertices of the vertex at the given index.
i
The index of the vertex queried.
returns
A set of vertex objects of all outgoing vertices of the vertex queried.

Definition Classes
Graph
abstract def removeEdgeAt(i: I, j: I): Unit

Removes the edge at the given index.
Removes the edge at the given index.
i
The first index of the edge to be deleted.
j
The second index of the edge to be deleted.
abstract def removeVertexAt(i: I): Unit

Removes the vertex at the give index.
Removes the vertex at the give index.
i
The index of the vertex to be deleted.
abstract def update(i: I, j: I, e: E): Unit

Updates the data of the edge at the give pair of indices.
Updates the data of the edge at the give pair of indices.
i
The first index of the edge.
j
The second index of the edge.
e
The new data for the edge.

Definition Classes
DMutableGraph
abstract def update(i: I, v: V): Unit

Updates the data of the vertex at the given index.
Updates the data of the vertex at the given index.
i
The index of the vertex to be updated.
v
The new data for the vertex.

Definition Classes
DMutableGraph
abstract def vertexIds: Set[I]

Gets the indices of all vertices.
Gets the indices of all vertices.
returns
A set of indices of all vertices.

Definition Classes
Graph
abstract def vertices: Set[Vertex]

Gets the vertex objects of all vertices.
Gets the vertex objects of all vertices.
returns
A set of all vertex objects of all vertices.

Definition Classes
Graph

Concrete Value Members

final def !=(arg0: Any): Boolean

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

Definition Classes
AnyRef → Any
def +=(e: (I, I, E)): Unit
def +=(v: (I, V)): Unit
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( ... )
def edge(i: I, j: I): Edge

Gets the edge object at the given pair of indices.
Gets the edge object at the given pair of indices.
i
The first index of the edge.
j
The second index of the edge.
returns
The desired edge object.

Definition Classes
Graph
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 ougDegreeOf(i: I): Int

The out degree of the vertex at the given index.
The out degree of the vertex at the given index.
i
The index of the vertex queried.
returns
The out degree of the vertex queried.

Definition Classes
Graph
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
def vertexAt(i: I): Vertex

Gets the vertex object at the given index.
Gets the vertex object at the given index.
i
The index of the vertex.
returns
The vertex object.

Definition Classes
Graph
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 graph

trait SMutableGraph[I, V, E] extends DMutableGraph[I, V, E]

Type Members

case class Edge(i: I, j: I) extends Product with Serializable

case class Vertex(i: I) extends Node[(I, V)] with Product with Serializable

Abstract Value Members

abstract def addEdge(i: I, j: I, edge: E): Unit

abstract def addVertex(i: I, v: V): Unit

abstract def apply(i: I, j: I): E

abstract def apply(i: I): V

abstract def edgeIds: Set[(I, I)]

abstract def edges: Set[Edge]

abstract def outgoingEdgesOf(i: I): Set[Edge]

abstract def outgoingIdsOf(i: I): Set[I]

abstract def outgoingVerticesOf(i: I): Set[Vertex]

abstract def removeEdgeAt(i: I, j: I): Unit

abstract def removeVertexAt(i: I): Unit

abstract def update(i: I, j: I, e: E): Unit

abstract def update(i: I, v: V): Unit

abstract def vertexIds: Set[I]

abstract def vertices: Set[Vertex]

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

def +=(e: (I, I, E)): Unit

def +=(v: (I, V)): Unit

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def edge(i: I, j: I): Edge

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 ougDegreeOf(i: I): Int

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

def toString(): String

def vertexAt(i: I): Vertex

final def wait(): Unit

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

final def wait(arg0: Long): Unit

Inherited from DMutableGraph[I, V, E]

Inherited from Graph[I, V, E]

Inherited from AnyRef

Inherited from Any

Ungrouped