GraphBase

Type Members

trait Edge extends Serializable
class EdgeBase extends InnerEdgeParam[N, E, NodeT, E] with InnerEdge
type EdgeFilter = (EdgeT) ⇒ Boolean
sealed trait EdgeOrdering extends Ordering[EdgeT] with ElemOrdering
trait EdgeSet extends AnySet[EdgeT] with ExtSetMethods[EdgeT] with Serializable
abstract type EdgeSetT <: EdgeSet
abstract type EdgeT <: InnerEdgeParam[N, E, NodeT, E] with InnerEdge with Serializable
sealed trait ElemOrdering extends AnyRef

Base trait for graph Orderings.
Base trait for graph Orderings.

Attributes
protected
trait InnerEdge extends Iterable[NodeT] with InnerEdgeParam[N, E, NodeT, E] with Edge with InnerElem
sealed trait InnerElem extends AnyRef
trait InnerNode extends InnerNodeParam[N] with Node with InnerElem
trait Node extends Serializable
abstract class NodeBase extends InnerNode

Attributes
protected
type NodeFilter = (NodeT) ⇒ Boolean
sealed trait NodeOrdering extends Ordering[NodeT] with ElemOrdering

Ordering for the path dependent type NodeT.
trait NodeSet extends AnySet[NodeT] with ExtSetMethods[NodeT] with Serializable
abstract type NodeSetT <: NodeSet
abstract type NodeT <: InnerNode 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 isDirected: Boolean
abstract def isHyper: Boolean
abstract def isMulti: Boolean
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: Any): Boolean

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

Definition Classes
AnyRef → Any
def +(other: String): String

Implicit information
This member is added by an implicit conversion from GraphBase[N, E] to any2stringadd[GraphBase[N, E]] performed by method any2stringadd in scala.Predef.
Definition Classes
any2stringadd
def ->[B](y: B): (GraphBase[N, E], B)

Implicit information
This member is added by an implicit conversion from GraphBase[N, E] to ArrowAssoc[GraphBase[N, E]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@inline()
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
object Edge extends Serializable
object EdgeOrdering extends Serializable

Ordering for the path dependent type EdgeT.
object EdgeT
object InnerEdge extends Serializable
object InnerNode extends Serializable
object NoOrdering extends ElemOrdering with Serializable

The empty ElemOrdering.
object Node extends Serializable
object NodeOrdering extends Serializable
final val anyEdge: EdgeFilter

Default edge filter letting path all edges (non-filter).
final val anyNode: NodeFilter

Default node filter letting traverse all nodes (non-filter).
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()
def ensuring(cond: (GraphBase[N, E]) ⇒ Boolean, msg: ⇒ Any): GraphBase[N, E]

Implicit information
This member is added by an implicit conversion from GraphBase[N, E] to Ensuring[GraphBase[N, E]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: (GraphBase[N, E]) ⇒ Boolean): GraphBase[N, E]

Implicit information
This member is added by an implicit conversion from GraphBase[N, E] to Ensuring[GraphBase[N, E]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean, msg: ⇒ Any): GraphBase[N, E]

Implicit information
This member is added by an implicit conversion from GraphBase[N, E] to Ensuring[GraphBase[N, E]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean): GraphBase[N, E]

Implicit information
This member is added by an implicit conversion from GraphBase[N, E] to Ensuring[GraphBase[N, E]] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
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] )
def formatted(fmtstr: String): String

Implicit information
This member is added by an implicit conversion from GraphBase[N, E] to StringFormat[GraphBase[N, E]] performed by method StringFormat in scala.Predef.
Definition Classes
StringFormat
Annotations
@inline()
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 isCustomEdgeFilter(f: EdgeFilter): Boolean

true if f is not equivalent to anyEdge.
true if f is not equivalent to anyEdge.

Annotations
@inline()
final def isCustomNodeFilter(f: NodeFilter): Boolean

true if f is not equivalent to anyNode.
true if f is not equivalent to anyNode.

Annotations
@inline()
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 noNode: NodeFilter

Node predicate always returning false.
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( ... )
def →[B](y: B): (GraphBase[N, E], B)

Implicit information
This member is added by an implicit conversion from GraphBase[N, E] to ArrowAssoc[GraphBase[N, E]] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd from GraphBase[N, E] to any2stringadd[GraphBase[N, E]]

Inherited by implicit conversion StringFormat from GraphBase[N, E] to StringFormat[GraphBase[N, E]]

Inherited by implicit conversion Ensuring from GraphBase[N, E] to Ensuring[GraphBase[N, E]]

Inherited by implicit conversion ArrowAssoc from GraphBase[N, E] to ArrowAssoc[GraphBase[N, E]]

Ungrouped

Related Docs: object GraphBase | package collection

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

Type Members

trait Edge extends Serializable

class EdgeBase extends InnerEdgeParam[N, E, NodeT, E] with InnerEdge

type EdgeFilter = (EdgeT) ⇒ Boolean

sealed trait EdgeOrdering extends Ordering[EdgeT] with ElemOrdering

trait EdgeSet extends AnySet[EdgeT] with ExtSetMethods[EdgeT] with Serializable

abstract type EdgeSetT <: EdgeSet

abstract type EdgeT <: InnerEdgeParam[N, E, NodeT, E] with InnerEdge with Serializable

sealed trait ElemOrdering extends AnyRef

trait InnerEdge extends Iterable[NodeT] with InnerEdgeParam[N, E, NodeT, E] with Edge with InnerElem

sealed trait InnerElem extends AnyRef

trait InnerNode extends InnerNodeParam[N] with Node with InnerElem

trait Node extends Serializable

abstract class NodeBase extends InnerNode

type NodeFilter = (NodeT) ⇒ Boolean

sealed trait NodeOrdering extends Ordering[NodeT] with ElemOrdering

trait NodeSet extends AnySet[NodeT] with ExtSetMethods[NodeT] with Serializable

abstract type NodeSetT <: NodeSet

abstract type NodeT <: InnerNode with Serializable

Abstract Value Members

abstract def edges: EdgeSetT

abstract def isDirected: Boolean

abstract def isHyper: Boolean

abstract def isMulti: Boolean

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

abstract def newNode(n: N): NodeT

abstract def nodes: NodeSetT

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

def ->[B](y: B): (GraphBase[N, E], B)

final def ==(arg0: Any): Boolean

object Edge extends Serializable

object EdgeOrdering extends Serializable

object EdgeT

object InnerEdge extends Serializable

object InnerNode extends Serializable

object NoOrdering extends ElemOrdering with Serializable

object Node extends Serializable

object NodeOrdering extends Serializable

final val anyEdge: EdgeFilter

final val anyNode: NodeFilter

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]

def ensuring(cond: (GraphBase[N, E]) ⇒ Boolean, msg: ⇒ Any): GraphBase[N, E]

def ensuring(cond: (GraphBase[N, E]) ⇒ Boolean): GraphBase[N, E]

def ensuring(cond: Boolean, msg: ⇒ Any): GraphBase[N, E]

def ensuring(cond: Boolean): GraphBase[N, E]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def formatted(fmtstr: String): String

final def getClass(): Class[_]

def graphSize: Int

def hashCode(): Int

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

final def isCustomEdgeFilter(f: EdgeFilter): Boolean

final def isCustomNodeFilter(f: NodeFilter): Boolean

final def isInstanceOf[T0]: Boolean

final def isTrivial: Boolean

final def ne(arg0: AnyRef): Boolean

final val noNode: NodeFilter

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