GraphBase

Base template trait for graphs.

This trait provides the common structure and base operations for immutable graphs independently of their representation. Base operations also cover one-step traversals. For unlimited traversals see trait GraphTraversal.

Users of Graph usually don't interact directly with this trait but with trait Graph instead which inherits the functionality provided by this trait.

If E inherits DirectedEdgeLike the graph is directed, otherwise it is undirected or mixed.

N: the user type of the nodes (vertices) in this graph.
E: the kind of the edges (links) in this graph.

Self Type: GraphBase[N, E]

Linear Supertypes

Serializable, Serializable, AnyRef, Any

Known Subclasses

AdjacencyListGraph, AdjacencyListGraph, DefaultGraphImpl, DefaultGraphImpl, Graph, Graph, Graph, GraphAux, GraphLike, GraphLike, GraphTraversal, GraphTraversalImpl

Type Members

trait Edge extends Serializable
class EdgeBase extends EdgeOut[N, E, NodeT, E] with InnerEdgeLike
sealed trait EdgeOrdering extends Ordering[EdgeT] with ElemOrdering
trait EdgeSet extends Set[EdgeT] with Serializable
abstract type EdgeSetT <: EdgeSet
abstract type EdgeT <: InnerEdge with InnerEdgeLike with Serializable
sealed trait ElemOrdering extends AnyRef

Base trait for graph Orderings.
type InnerEdge = EdgeOut[N, E, NodeT, E]

Attributes
protected
trait InnerEdgeLike extends Iterable[NodeT] with Edge
trait InnerNodeLike extends NodeOut[N] with Node
sealed class NoOrdering extends ElemOrdering

The empty ElemOrdering.
trait Node extends Serializable
abstract class NodeBase extends InnerNodeLike

Attributes
protected
sealed trait NodeOrdering extends Ordering[NodeT] with ElemOrdering

Ordering for the path dependent type NodeT.
trait NodeSet extends Set[NodeT] with Serializable
abstract type NodeSetT <: NodeSet
abstract type NodeT <: InnerNodeLike with Serializable

Abstract Value Members

abstract def edges: EdgeSetT

The edge set of this Graph commonly referred to as E(G).
The edge set of this Graph commonly referred to as E(G).
returns
Set of all contained edges.
abstract def newEdge(innerEdge: E[NodeT]): EdgeT

Attributes
protected
abstract def newNode(n: N): NodeT

Attributes
protected
abstract def nodes: NodeSetT

The node (vertex) set of this Graph commonly referred to as V(G).
The node (vertex) set of this Graph commonly referred to as V(G).
returns
Set of all contained nodes.

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

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

Definition Classes
Any
final def ##(): Int

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

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

Definition Classes
Any
object Edge extends Serializable
object EdgeOrdering extends Serializable

Ordering for the path dependent type EdgeT.
object Node extends Serializable
object NodeOrdering extends Serializable
final lazy val anyOrdering: AnyOrdering[N]

Attributes
protected
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws()
final lazy val defaultEdgeOrdering: EdgeOrdering
final lazy val defaultNodeOrdering: NodeOrdering
implicit final def edgeToEdgeCont(e: E[N]): E[NodeT]

Attributes
protected
Annotations
@inline()
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()
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def graphSize: Int

The size - commonly referred to as ||G|| - of this graph equaling to the number of edges.
The size - commonly referred to as ||G|| - of this graph equaling to the number of edges.
Method size is reserved for the number of nodes and edges because Graph is also SetLike with set elements being nodes or edges.
def hashCode(): Int

Definition Classes
AnyRef → Any
def initialize(nodes: Iterable[N], edges: Iterable[E[N]]): Unit

Populates this graph with nodes and edges.
Populates this graph with nodes and edges.
The implementing class will typically have a constructor with the same parameters which is invoked by from of the companion object.
nodes
The isolated (and optionally any other) outer nodes that the node set of this graph is to be populated with.
edges
The outer edges that the edge set of this graph is to be populated with. Nodes being the end of any of these edges will be added to the node set.

Attributes
protected
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def isTrivial: Boolean

true if this graph has at most 1 node.
true if this graph has at most 1 node.

Annotations
@inline()
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final val noOrdering: NoOrdering
final def nonTrivial: Boolean

true if this graph has at least 2 nodes.
true if this graph has at least 2 nodes.

Annotations
@inline()
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def order: Int

The order - commonly referred to as |G| - of this graph equaling to the number of nodes.
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
def totalWeight: Long
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()

trait GraphBase[N, E[X] <: EdgeLikeIn[X]] extends Serializable

Type Members

trait Edge extends Serializable

class EdgeBase extends EdgeOut[N, E, NodeT, E] with InnerEdgeLike

sealed trait EdgeOrdering extends Ordering[EdgeT] with ElemOrdering

trait EdgeSet extends Set[EdgeT] with Serializable

abstract type EdgeSetT <: EdgeSet

abstract type EdgeT <: InnerEdge with InnerEdgeLike with Serializable

sealed trait ElemOrdering extends AnyRef

type InnerEdge = EdgeOut[N, E, NodeT, E]

trait InnerEdgeLike extends Iterable[NodeT] with Edge

trait InnerNodeLike extends NodeOut[N] with Node

sealed class NoOrdering extends ElemOrdering

trait Node extends Serializable

abstract class NodeBase extends InnerNodeLike

sealed trait NodeOrdering extends Ordering[NodeT] with ElemOrdering

trait NodeSet extends Set[NodeT] with Serializable

abstract type NodeSetT <: NodeSet

abstract type NodeT <: InnerNodeLike with Serializable

Abstract Value Members

abstract def edges: EdgeSetT

abstract def newEdge(innerEdge: E[NodeT]): EdgeT

abstract def newNode(n: N): NodeT

abstract def nodes: NodeSetT

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

object Edge extends Serializable

object EdgeOrdering extends Serializable

object Node extends Serializable

object NodeOrdering extends Serializable

final lazy val anyOrdering: AnyOrdering[N]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final lazy val defaultEdgeOrdering: EdgeOrdering

final lazy val defaultNodeOrdering: NodeOrdering

implicit final def edgeToEdgeCont(e: E[N]): E[NodeT]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def graphSize: Int

def hashCode(): Int

def initialize(nodes: Iterable[N], edges: Iterable[E[N]]): Unit

final def isInstanceOf[T0]: Boolean

final def isTrivial: Boolean

final def ne(arg0: AnyRef): Boolean

final val noOrdering: NoOrdering

final def nonTrivial: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def order: Int

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

def toString(): String

def totalWeight: Long

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 AnyRef

Inherited from Any

Ungrouped