NodeBase

Instance Constructors

new NodeBase()

Abstract Value Members

abstract def edges: ExtSet[EdgeT]

All edges at this node - commonly denoted as E(v).
All edges at this node - commonly denoted as E(v).
returns
all edges with at least one end connecting to this node.

Definition Classes
InnerNodeLike
abstract def isContaining[N, E[X] <: EdgeLikeIn[X]](g: GraphBase[N, E]): Boolean

Definition Classes
NodeOut
abstract def value: N

The outer node as supplied by the user at instantiation time or by adding nodes this graph.
The outer node as supplied by the user at instantiation time or by adding nodes this graph.
returns
Reference to the user-supplied outer node.

Definition Classes
InnerNodeLike → GraphParamNode

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 <~(from: NodeT): Set[EdgeT]

Synonym for incomingFrom.
Synonym for incomingFrom.

Definition Classes
InnerNodeLike
Annotations
@inline()
final def <~: Set[EdgeT]

Synonym for incoming.
Synonym for incoming.

Definition Classes
InnerNodeLike
Annotations
@inline()
final def <~?(from: NodeT): Option[EdgeT]

Synonym for findIncomingFrom.
Synonym for findIncomingFrom.

Definition Classes
InnerNodeLike
Annotations
@inline()
final def <~|: Set[NodeT]

Synonym for diPredecessors.
Synonym for diPredecessors.

Definition Classes
InnerNodeLike
Annotations
@inline()
final def ==(arg0: AnyRef): Boolean

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

Definition Classes
Any
def addDiPredecessors(edge: EdgeT, add: (NodeT) ⇒ Unit): Unit

Attributes
protected[scalax.collection]
Definition Classes
InnerNodeLike
def addDiSuccessors(edge: EdgeT, add: (NodeT) ⇒ Unit): Unit

Attributes
protected[scalax.collection]
Definition Classes
InnerNodeLike
def addNeighbors(edge: EdgeT, add: (NodeT) ⇒ Unit): Unit

Attributes
protected[scalax.collection]
Definition Classes
InnerNodeLike
final def asInstanceOf[T0]: T0

Definition Classes
Any
final def asNodeT[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G): GraphPredef.NodeOut.asNodeT.G.NodeT

Attributes
protected[scalax.collection]
Definition Classes
NodeOut
final def asNodeTProjection[N <: N, E[X] <: EdgeLikeIn[X]]: NodeT

Attributes
protected[scalax.collection]
Definition Classes
NodeOut
def canEqual(that: Any): Boolean

Definition Classes
InnerNodeLike
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def degree: Int

The degree of this node.
The degree of this node.
returns
the number of edges that connect to this node. An edge that connects to this node at more than one ends (loop) is counted as much times as it is connected to this node.

Definition Classes
InnerNodeLike
def diPredecessors: Set[NodeT]

All direct predecessors of this node, also called predecessor set or open in-neighborhood: source nodes of directed incident edges and / or adjacent nodes of undirected incident edges excluding this node.
All direct predecessors of this node, also called predecessor set or open in-neighborhood: source nodes of directed incident edges and / or adjacent nodes of undirected incident edges excluding this node.
returns
set of all direct predecessors of this node.

Definition Classes
InnerNodeLike
def diSuccessors: Set[NodeT]

All direct successors of this node, also called successor set or open out-neighborhood: target nodes of directed incident edges and / or adjacent nodes of undirected incident edges excluding this node.
All direct successors of this node, also called successor set or open out-neighborhood: target nodes of directed incident edges and / or adjacent nodes of undirected incident edges excluding this node.
returns
set of all direct successors of this node.

Definition Classes
InnerNodeLike
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(other: Any): Boolean

Definition Classes
InnerNodeLike → AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def findIncomingFrom(from: NodeT): Option[EdgeT]

An edge at from having this node as a successor.
An edge at from having this node as a successor.
from
The node being at an edge which has this node as a successor.
returns
An edges at from having this node as a successor. If from equals this node a hook may be returned. If from is not an adjacent node None is returned.

Definition Classes
InnerNodeLike
def findOutgoingTo(to: NodeT): Option[EdgeT]

An outgoing edge connecting this node with to.
An outgoing edge connecting this node with to.
to
The node which is the end point of an edge starting at this node.
returns
One of possibly several edges connecting this node with to. If to equals this node a hook may be returned. If to is not an adjacent node None is returned.

Definition Classes
InnerNodeLike
final def fold[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton, T](g: G)(fa: (GraphPredef.NodeOut.fold.G.NodeT) ⇒ T, fb: (NodeT) ⇒ T): T

Definition Classes
NodeOut
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hasOnlyHooks: Boolean

Checks whether this node has only hooks or no edges at all.
Checks whether this node has only hooks or no edges at all.
returns
true if this node has only hooks or it does not participate in any edge

Definition Classes
InnerNodeLike
def hashCode(): Int

Definition Classes
InnerNodeLike → AnyRef → Any
def inDegree: Int

The incoming degree of this node.
The incoming degree of this node.
returns
the number of edges that come in to this node including undirected edges. Every loop on this node is counted twice.

Definition Classes
InnerNodeLike
final def inNeighbors: Set[NodeT]

Synonym for diPredecessors.
Synonym for diPredecessors.

Definition Classes
InnerNodeLike
Annotations
@inline()
def incoming: Set[EdgeT]

Incoming edges of this node.
Incoming edges of this node.
returns
set of all edges incoming to of this including undirected edges.

Definition Classes
InnerNodeLike
def incomingFrom(from: NodeT): Set[EdgeT]

All incoming edges connecting from with this node.
All incoming edges connecting from with this node.
from
The node with zero, one or more edges having this node as a direct successor.
returns
All edges at from having this node as a direct successor. If from equals this node all hooks are returned. If from is not an adjacent node an empty set is returned.

Definition Classes
InnerNodeLike
def isDirectPredecessorOf(that: NodeT): Boolean

Whether that is an adjacent (direct successor) to this node.
Whether that is an adjacent (direct successor) to this node.
that
The node to check for adjacency.
returns
true if that is adjacent to this node.

Definition Classes
InnerNodeLike
def isEdge: Boolean

Definition Classes
GraphParamNode
def isIn: Boolean

Definition Classes
GraphParamOut → GraphParam
def isIndependentOf(that: NodeT): Boolean

Whether that is independent of this node meaning that there exists no edge connecting this node with that.
Whether that is independent of this node meaning that there exists no edge connecting this node with that.
that
The node to check for independency.
returns
true if that node is independent of this node.

Definition Classes
InnerNodeLike
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def isIsolated: Boolean

Returns whether this node's degree equals to 0.
Returns whether this node's degree equals to 0.

Definition Classes
InnerNodeLike
Annotations
@inline()
final def isLeaf: Boolean

Returns whether this node's degree equals to 1.
Returns whether this node's degree equals to 1.

Definition Classes
InnerNodeLike
Annotations
@inline()
def isNode: Boolean

Definition Classes
GraphParamNode
def isOut: Boolean

Definition Classes
GraphParamOut → GraphParam
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def neighbors: Set[NodeT]

All adjacent nodes (direct successors and predecessors) of this node, also called open neighborhood excluding this node.
All adjacent nodes (direct successors and predecessors) of this node, also called open neighborhood excluding this node.
returns
set of all neighbors.

Definition Classes
InnerNodeLike
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def outDegree: Int

The outgoing degree of this node.
The outgoing degree of this node.
returns
the number of edges that go out from this node including undirected edges. Every loop on this node is counted twice.

Definition Classes
InnerNodeLike
final def outNeighbors: Set[NodeT]

Synonym for diSuccessors.
Synonym for diSuccessors.

Definition Classes
InnerNodeLike
Annotations
@inline()
def outgoing: Set[EdgeT]

All edges outgoing from this node.
All edges outgoing from this node.
returns
set of all edges outgoing from this node including undirected edges and hooks.

Definition Classes
InnerNodeLike
def outgoingTo(to: NodeT): Set[EdgeT]

All outgoing edges connecting this node with to.
All outgoing edges connecting this node with to.
to
The node which is the end point of zero, one or more edges starting at this node.
returns
All edges connecting this node with to. If to equals this node all hooks are returned. If to is not an adjacent an empty set is returned.

Definition Classes
InnerNodeLike
def stringPrefix: String

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

Definition Classes
AnyRef
final def toNodeT[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G)(f: (NodeT) ⇒ GraphPredef.NodeOut.toNodeT.G.NodeT): GraphPredef.NodeOut.toNodeT.G.NodeT

Definition Classes
NodeOut
def toString(): String

Definition Classes
GraphParamNode → 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( ... )
final def ~: ExtSet[EdgeT]

Synonym for edges.
Synonym for edges.

Definition Classes
InnerNodeLike
Annotations
@inline()
final def ~>(to: NodeT): Set[EdgeT]

Synonym for outgoingTo.
Synonym for outgoingTo.

Definition Classes
InnerNodeLike
Annotations
@inline()
final def ~>: Set[EdgeT]

Synonym for outgoing.
Synonym for outgoing.

Definition Classes
InnerNodeLike
Annotations
@inline()
final def ~>?(to: NodeT): Option[EdgeT]

Synonym for outgoingTo.
Synonym for outgoingTo.

Definition Classes
InnerNodeLike
Annotations
@inline()
final def ~>|: Set[NodeT]

Synonym for diSuccessors.
Synonym for diSuccessors.

Definition Classes
InnerNodeLike
Annotations
@inline()
final def ~|: Set[NodeT]

Synonym for neighbors.
Synonym for neighbors.

Definition Classes
InnerNodeLike
Annotations
@inline()

abstract class NodeBase extends InnerNodeLike

Instance Constructors

new NodeBase()

Abstract Value Members

abstract def edges: ExtSet[EdgeT]

abstract def isContaining[N, E[X] <: EdgeLikeIn[X]](g: GraphBase[N, E]): Boolean

abstract def value: N

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def <~(from: NodeT): Set[EdgeT]

final def <~: Set[EdgeT]

final def <~?(from: NodeT): Option[EdgeT]

final def <~|: Set[NodeT]

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def addDiPredecessors(edge: EdgeT, add: (NodeT) ⇒ Unit): Unit

def addDiSuccessors(edge: EdgeT, add: (NodeT) ⇒ Unit): Unit

def addNeighbors(edge: EdgeT, add: (NodeT) ⇒ Unit): Unit

final def asInstanceOf[T0]: T0

final def asNodeT[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G): GraphPredef.NodeOut.asNodeT.G.NodeT

final def asNodeTProjection[N <: N, E[X] <: EdgeLikeIn[X]]: NodeT

def canEqual(that: Any): Boolean

def clone(): AnyRef

def degree: Int

def diPredecessors: Set[NodeT]

def diSuccessors: Set[NodeT]

final def eq(arg0: AnyRef): Boolean

def equals(other: Any): Boolean

def finalize(): Unit

def findIncomingFrom(from: NodeT): Option[EdgeT]

def findOutgoingTo(to: NodeT): Option[EdgeT]

final def fold[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton, T](g: G)(fa: (GraphPredef.NodeOut.fold.G.NodeT) ⇒ T, fb: (NodeT) ⇒ T): T

final def getClass(): Class[_]

def hasOnlyHooks: Boolean

def hashCode(): Int

def inDegree: Int

final def inNeighbors: Set[NodeT]

def incoming: Set[EdgeT]

def incomingFrom(from: NodeT): Set[EdgeT]

def isDirectPredecessorOf(that: NodeT): Boolean

def isEdge: Boolean

def isIn: Boolean

def isIndependentOf(that: NodeT): Boolean

final def isInstanceOf[T0]: Boolean

final def isIsolated: Boolean

final def isLeaf: Boolean

def isNode: Boolean

def isOut: Boolean

final def ne(arg0: AnyRef): Boolean

def neighbors: Set[NodeT]

final def notify(): Unit

final def notifyAll(): Unit

def outDegree: Int

final def outNeighbors: Set[NodeT]

def outgoing: Set[EdgeT]

def outgoingTo(to: NodeT): Set[EdgeT]

def stringPrefix: String

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

final def toNodeT[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G)(f: (NodeT) ⇒ GraphPredef.NodeOut.toNodeT.G.NodeT): GraphPredef.NodeOut.toNodeT.G.NodeT

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

final def ~: ExtSet[EdgeT]

final def ~>(to: NodeT): Set[EdgeT]

final def ~>: Set[EdgeT]

final def ~>?(to: NodeT): Option[EdgeT]

final def ~>|: Set[NodeT]

final def ~|: Set[NodeT]

Inherited from InnerNodeLike

Inherited from Node

Inherited from Serializable

Inherited from Serializable

Inherited from NodeOut[N]

Inherited from GraphParamNode[N]

Inherited from GraphParamOut[N, Nothing]

Inherited from GraphParam[N, Nothing]