scalax.collection.mutable.DefaultGraphImpl

NodeBase_

final class NodeBase_ extends InnerNodeImpl with InnerNodeTraversalImpl

Attributes: protected
Annotations: @SerialVersionUID()

Linear Supertypes

DefaultGraphImpl.InnerNodeTraversalImpl, DefaultGraphImpl.InnerNodeState, DefaultGraphImpl.InnerNodeImpl, DefaultGraphImpl.AdjacendyListBaseInnerNode, DefaultGraphImpl.GraphLikeInnerNode, DefaultGraphImpl.NodeBase, DefaultGraphImpl.GraphInnerNode, DefaultGraphImpl.TraverserInnerNode, DefaultGraphImpl.BaseNodeBase, DefaultGraphImpl.BaseInnerNode, DefaultGraphImpl.InnerNode, DefaultGraphImpl.InnerElem, DefaultGraphImpl.Node, Serializable, AnyRef, Any

Type Hierarchy

Ordering

Alphabetic
By Inheritance

Inherited

NodeBase_
InnerNodeTraversalImpl
InnerNodeState
InnerNodeImpl
AdjacendyListBaseInnerNode
GraphLikeInnerNode
NodeBase
GraphInnerNode
TraverserInnerNode
BaseNodeBase
BaseInnerNode
InnerNode
InnerElem
Node
Serializable
AnyRef
Any

Implicitly

by toDefaultTraverser
by toOuter
by any2stringadd
by StringFormat
by Ensuring
by ArrowAssoc

Hide All
Show All

Visibility

Public
Protected

Instance Constructors

new NodeBase_(outer: N, hints: Hints)

Value Members

object Adj extends Serializable
Attributes
protected[collection]
Definition Classes
AdjacendyListBaseInnerNode
final def !=(arg0: Any): Boolean
Definition Classes
AnyRef → Any
final def ##: Int
Definition Classes
AnyRef → Any
def +(other: String): String
Implicit
This member is added by an implicit conversion from NodeBase_ toany2stringadd[NodeBase_] performed by method any2stringadd in scala.Predef.
Definition Classes
any2stringadd
final def +=(edge: DefaultGraphImpl.EdgeT): NodeBase_.this.type
Attributes
protected[collection]
Definition Classes
AdjacendyListBaseInnerNode
Annotations
@inline()
def ->[B](y: B): (NodeBase_, B)
Implicit
This member is added by an implicit conversion from NodeBase_ toArrowAssoc[NodeBase_] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@inline()
final def ==(arg0: Any): Boolean
Definition Classes
AnyRef → Any
final def add(edge: DefaultGraphImpl.EdgeT): Boolean
Attributes
protected[collection]
Definition Classes
InnerNodeImpl → AdjacendyListBaseInnerNode
final def addDiPredecessors(edge: DefaultGraphImpl.EdgeT, add: (NodeT) => Unit): Unit
Attributes
protected[collection]
Definition Classes
AdjacendyListBaseInnerNode → BaseInnerNode
final def addDiSuccOrHook(edge: DefaultGraphImpl.EdgeT): Unit
Attributes
protected
Definition Classes
InnerNodeImpl
final def addDiSuccessors(edge: DefaultGraphImpl.EdgeT, add: (NodeT) => Unit): Unit
Attributes
protected[collection]
Definition Classes
AdjacendyListBaseInnerNode → BaseInnerNode
final def addNeighbors(edge: DefaultGraphImpl.EdgeT, add: (NodeT) => Unit): Unit
Attributes
protected[collection]
Definition Classes
AdjacendyListBaseInnerNode → BaseInnerNode
final def asInstanceOf[T0]: T0
Definition Classes
Any
final def asNodeT: NodeT
Attributes
protected[collection]
Definition Classes
NodeBase_ → InnerNode
final def bit[T](implicit handle: Handle): Boolean
Attributes
protected[collection]
Definition Classes
InnerNodeState
Annotations
@inline()
final def bit_=[T](isSet: Boolean)(implicit handle: Handle): Unit
Attributes
protected[collection]
Definition Classes
InnerNodeState
Annotations
@inline()
def canEqual(that: Any): Boolean
Definition Classes
BaseInnerNode
def clone(): AnyRef
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
final def connectWith[AE <: E with AnyEdge[N]](n_1: N, ns: N*)(implicit factory: (N, N) => AE): NodeBase_.this.type
Adds new non-hyper edges connecting this inner node with those outer nodes.
Adds new non-hyper edges connecting this inner node with those outer nodes.
Definition Classes
GraphLikeInnerNode
final def connectWith[AE <: E with AnyEdge[N]](n_1: NodeT, ns: NodeT*)(implicit edgeFactory: (N, N) => AE): NodeBase_.this.type
Adds new non-hyper edges connecting this inner node with those inner nodes.
Adds new non-hyper edges connecting this inner node with those inner nodes.
Definition Classes
GraphLikeInnerNode
final def connectionsWith(other: NodeT): Set[DefaultGraphImpl.EdgeT] with FilterableSet[DefaultGraphImpl.EdgeT]
All edges connecting this node with other including outgoing and incoming edges.
All edges connecting this node with other including outgoing and incoming edges. This method is useful in case of multigraphs.
other
A node which is possibly connected with this node.
returns
All edges connecting this node with other. If other equals this node all hooks are returned. If other is not connected with this node an empty set is returned.
Definition Classes
AdjacendyListBaseInnerNode → BaseInnerNode
final def containingGraph: DefaultGraphImpl.ThisGraph
The Graph instance that contains this inner edge.
The Graph instance that contains this inner edge.
Definition Classes
GraphInnerNode
final 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
AdjacendyListBaseInnerNode → BaseInnerNode
final 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
AdjacendyListBaseInnerNode → BaseInnerNode
final 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
InnerNodeImpl → BaseInnerNode
def dumpState: Array[Long]
Definition Classes
InnerNodeState
final val edges: ArraySet[DefaultGraphImpl.EdgeT]
All edges at this node - commonly denoted as E(v).
All edges at this node - commonly denoted as E(v).
returns
all edges connecting to this node.
Definition Classes
InnerNodeImpl → AdjacendyListBaseInnerNode → BaseInnerNode
def ensuring(cond: (NodeBase_) => Boolean, msg: => Any): NodeBase_
Implicit
This member is added by an implicit conversion from NodeBase_ toEnsuring[NodeBase_] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: (NodeBase_) => Boolean): NodeBase_
Implicit
This member is added by an implicit conversion from NodeBase_ toEnsuring[NodeBase_] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean, msg: => Any): NodeBase_
Implicit
This member is added by an implicit conversion from NodeBase_ toEnsuring[NodeBase_] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
def ensuring(cond: Boolean): NodeBase_
Implicit
This member is added by an implicit conversion from NodeBase_ toEnsuring[NodeBase_] performed by method Ensuring in scala.Predef.
Definition Classes
Ensuring
final def eq(arg0: AnyRef): Boolean
Definition Classes
AnyRef
def equals(other: Any): Boolean
Definition Classes
BaseInnerNode → AnyRef → Any
final def findConnected[U](pred: DefaultGraphImpl.NodePredicate)(implicit visitor: (NodeT) => U = empty): Option[NodeT]
Finds a node connected with root by any number of edges with any direction for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.
Finds a node connected with root by any number of edges with any direction for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. For directed or mixed graphs the node to be found is weakly connected with this node. root itself does not count as a match. This is also true if it has a hook. If several connected nodes exist with pred the algorithm selects any one of these.
pred
The predicate which must hold true for the resulting node.
visitor
An optional function that is applied for its side-effect to every element visited during graph traversal.
returns
A node with the predicate pred or None if either
1. there is no node with pred or
2. there exists no connection to such a node or
3. there exists a connection to such a node but due to withSubgraph settings this path was out of scope.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
def findCycle[U](implicit visitor: (NodeT) => U = empty): Option[DefaultGraphImpl.Cycle]
Finds a cycle starting the search at root taking optional properties like subgraph restriction, ordering or maximum depth into account., if any.
Finds a cycle starting the search at root taking optional properties like subgraph restriction, ordering or maximum depth into account., if any. The resulting cycle may start at any node connected with this node.
visitor
An optional function that is applied for its side-effect to every element visited during graph traversal.
returns
A cycle or None if either
1. there exists no cycle in the component depicting by root or
2. there exists a cycle in the component but due to withSubgraph settings this path was out of scope.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
final def findIncomingFrom(from: NodeT): Option[DefaultGraphImpl.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
AdjacendyListBaseInnerNode → BaseInnerNode
final def findOutgoingTo(to: NodeT): Option[DefaultGraphImpl.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
AdjacendyListBaseInnerNode → BaseInnerNode
final def findPredecessor[U](pred: DefaultGraphImpl.NodePredicate)(implicit visitor: (NodeT) => U = empty): Option[NodeT]
Finds a predecessor of root for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.
Finds a predecessor of root for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. root itself does not count as a match. This is also true if it has a hook. If several predecessors exist the algorithm selects the first of them found.
pred
The predicate which must hold true for the resulting node.
visitor
An optional function that is applied for its side-effect to every element visited during graph traversal.
returns
A node with the predicate pred or None if either
1. there is no node with pred or
2. there exists no path from such a node to this node or
3. there exists a path from such a node to root but due to withSubgraph settings this path was out of scope.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
final def findSuccessor[U](pred: DefaultGraphImpl.NodePredicate)(implicit visitor: (NodeT) => U = empty): Option[NodeT]
Finds a successor of root for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.
Finds a successor of root for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. root itself does not count as a match. This is also true if it has a hook. If several successors holding pred exist any one of them may be returned.
pred
The predicate which must hold for the resulting node.
visitor
An optional function that is applied for its side-effect to every element visited during graph traversal.
returns
A node with the predicate pred or None if either
1. there is no node with pred or
2. there exists no path to such a node or
3. there exists a path to such a node but due to withSubgraph settings this path was out of scope.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
val flags: FlagWord
Attributes
protected[State[N, E]]
Definition Classes
InnerNodeState
val flagsExt: FlagWords
Attributes
protected[State[N, E]]
Definition Classes
InnerNodeState
final def getClass(): Class[_ <: AnyRef]
Definition Classes
AnyRef → Any
Annotations
@native() @HotSpotIntrinsicCandidate()
final 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 isolated.
Definition Classes
AdjacendyListBaseInnerNode → BaseInnerNode
final def hasPredecessor[U](potentialPredecessor: NodeT)(implicit visitor: (NodeT) => U = empty): Boolean
Checks whether potentialPredecessor is a predecessor of root considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.
Checks whether potentialPredecessor is a predecessor of root considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. Same as isSuccessorOf.
potentialPredecessor
The node which is potentially a predecessor of root.
visitor
An optional function that is applied for its side-effect to every element visited during graph traversal.
returns
true if a path exists from potentialPredecessor to root and it had not to be excluded due to subgraph properties.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
Annotations
@inline()
final def hasPredecessors: Boolean
Whether this node has any predecessors.
Whether this node has any predecessors.
Definition Classes
AdjacendyListBaseInnerNode → BaseInnerNode
final def hasSuccessor[U](potentialSuccessor: NodeT)(implicit visitor: (NodeT) => U = empty): Boolean
Checks whether potentialSuccessor is a successor of this node considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.
Checks whether potentialSuccessor is a successor of this node considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. Same as isPredecessorOf.
potentialSuccessor
The node which is potentially a successor of this node.
visitor
An optional function that is applied for its side-effect to every element visited during graph traversal.
returns
true if a path exists from this node to potentialSuccessor and it had not to be excluded due to a subgraph* restriction.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
Annotations
@inline()
final def hasSuccessors: Boolean
Whether this node has any successors.
Whether this node has any successors.
Definition Classes
AdjacendyListBaseInnerNode → BaseInnerNode
def hashCode(): Int
Definition Classes
BaseInnerNode → AnyRef → Any
final def hook: Option[DefaultGraphImpl.EdgeT]
returns
A looping edge out of one or more at this node or None if this node has no looping edge.
Definition Classes
AdjacendyListBaseInnerNode → BaseInnerNode
final def inDegree(nodeFilter: DefaultGraphImpl.NodePredicate, edgeFilter: DefaultGraphImpl.EdgePredicate = anyEdge, includeHooks: Boolean = false, ignoreMultiEdges: Boolean = true): Int
The incoming degree of this node after applying some filters to the incoming edges and predecessors.
The incoming degree of this node after applying some filters to the incoming edges and predecessors.
Definition Classes
AdjacendyListBaseInnerNode → BaseInnerNode
final 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. Loops count once each.
Definition Classes
AdjacendyListBaseInnerNode → BaseInnerNode
final def inNeighbors: Set[NodeT]
Synonym for diPredecessors.
Synonym for diPredecessors.
Definition Classes
BaseInnerNode
Annotations
@inline()
final def incoming: Set[DefaultGraphImpl.EdgeT] with FilterableSet[DefaultGraphImpl.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
AdjacendyListBaseInnerNode → BaseInnerNode
final def incomingFrom(from: NodeT): Set[DefaultGraphImpl.EdgeT] with FilterableSet[DefaultGraphImpl.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
AdjacendyListBaseInnerNode → BaseInnerNode
final def innerEdgeTraverser(implicit parameters: Parameters = Parameters()): DefaultGraphImpl.InnerEdgeTraverser
Instantiates an InnerEdgeTraverser which extends scala.collection.Iterable with elements of type EdgeT and sets its root to this node.
Instantiates an InnerEdgeTraverser which extends scala.collection.Iterable with elements of type EdgeT and sets its root to this node. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.
parameters
The properties controlling subsequent traversals.
Definition Classes
TraverserInnerNode
Annotations
@inline()
final def innerElemTraverser(implicit parameters: Parameters = Parameters()): DefaultGraphImpl.InnerElemTraverser
Instantiates an InnerElemTraverser which extends scala.collection.Iterable with elements of type InnerElem and sets its root to this node.
Instantiates an InnerElemTraverser which extends scala.collection.Iterable with elements of type InnerElem and sets its root to this node. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.
parameters
The properties controlling subsequent traversals.
Definition Classes
TraverserInnerNode
Annotations
@inline()
final def innerNodeDownUpTraverser(implicit parameters: Parameters = Parameters()): DefaultGraphImpl.InnerNodeDownUpTraverser
Instantiates an InnerNodeDownUpTraverser which extends scala.collection.Iterable with elements of type (Boolean, NodeT) and sets its root to this node.
Instantiates an InnerNodeDownUpTraverser which extends scala.collection.Iterable with elements of type (Boolean, NodeT) and sets its root to this node. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.
parameters
The properties controlling subsequent traversals.
Definition Classes
TraverserInnerNode
Annotations
@inline()
final def innerNodeTraverser(implicit parameters: Parameters = Parameters()): DefaultGraphImpl.InnerNodeTraverser
Instantiates an InnerNodeTraverser which extends scala.collection.Iterable with elements of type NodeT and sets its root to this node.
Instantiates an InnerNodeTraverser which extends scala.collection.Iterable with elements of type NodeT and sets its root to this node. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.
parameters
The properties controlling subsequent traversals.
Definition Classes
TraverserInnerNode
Annotations
@inline()
final def isConnectedWith[U](potentialConnected: NodeT)(implicit visitor: (NodeT) => U = empty): Boolean
Checks whether potentialConnected is a node (not necessarily directly) connected with root by any number of edges with any direction considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.
Checks whether potentialConnected is a node (not necessarily directly) connected with root by any number of edges with any direction considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. For directed or mixed graphs it is satisfactory that potentialConnected is weakly connected with root.
potentialConnected
The node which is potentially connected with root.
visitor
An optional function that is applied for its side-effect to every element visited during graph traversal.
returns
true if a path exists from this node to potentialConnected and it had not to be excluded due to subgraph properties.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
Annotations
@inline()
final def isContaining[N, E <: Edge[N]](g: GraphBase[N, E, [X, Y]DefaultGraphImpl[X, Y]]): Boolean
Definition Classes
NodeBase
final 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
AdjacendyListBaseInnerNode → BaseInnerNode
final 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
AdjacendyListBaseInnerNode → BaseInnerNode
final def isInstanceOf[T0]: Boolean
Definition Classes
Any
final def isIsolated: Boolean
true if this node's degree equals to 0.
true if this node's degree equals to 0.
Definition Classes
BaseInnerNode
Annotations
@inline()
final def isLeaf: Boolean
true if this node's degree equals to 1.
true if this node's degree equals to 1.
Definition Classes
BaseInnerNode
Annotations
@inline()
final def isPredecessorOf[U](potentialSuccessor: NodeT)(implicit visitor: (NodeT) => U = empty): Boolean
Same as hasSuccessor.
Same as hasSuccessor.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
Annotations
@inline()
final def isSuccessorOf[U](potentialPredecessor: NodeT)(implicit visitor: (NodeT) => U = empty): Boolean
Same as hasPredecessor.
Same as hasPredecessor.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
Annotations
@inline()
final def ne(arg0: AnyRef): Boolean
Definition Classes
AnyRef
final 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
AdjacendyListBaseInnerNode → BaseInnerNode
final def nodeEqThis: (NodeT) => Boolean
Attributes
protected
Definition Classes
AdjacendyListBaseInnerNode
Annotations
@inline()
final def notify(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
final def notifyAll(): Unit
Definition Classes
AnyRef
Annotations
@native() @HotSpotIntrinsicCandidate()
final def outDegree(nodeFilter: DefaultGraphImpl.NodePredicate, edgeFilter: DefaultGraphImpl.EdgePredicate = anyEdge, includeHooks: Boolean = false, ignoreMultiEdges: Boolean = true): Int
The outgoing degree of this node after applying some filters to the outgoing edges and successors.
The outgoing degree of this node after applying some filters to the outgoing edges and successors.
Definition Classes
AdjacendyListBaseInnerNode → BaseInnerNode
final 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. Loops count once each.
Definition Classes
AdjacendyListBaseInnerNode → BaseInnerNode
final def outNeighbors: Set[NodeT]
Synonym for diSuccessors.
Synonym for diSuccessors.
Definition Classes
BaseInnerNode
Annotations
@inline()
val outer: N
The outer node as supplied by instantiation or addition.
The outer node as supplied by instantiation or addition.
Definition Classes
NodeBase_ → InnerNodeImpl → InnerNode
final def outerEdgeTraverser(implicit parameters: Parameters = Parameters()): DefaultGraphImpl.OuterEdgeTraverser
Instantiates an OuterEdgeTraverser which extends scala.collection.Iterable with elements of type E[N] and sets its root to this node.
Instantiates an OuterEdgeTraverser which extends scala.collection.Iterable with elements of type E[N] and sets its root to this node. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.
parameters
The properties controlling subsequent traversals.
Definition Classes
TraverserInnerNode
Annotations
@inline()
final def outerElemTraverser(implicit parameters: Parameters = Parameters()): DefaultGraphImpl.OuterElemTraverser
Instantiates an OuterElemTraverser which extends scala.collection.Iterable with elements of type OuterElem and sets its root to this node.
Instantiates an OuterElemTraverser which extends scala.collection.Iterable with elements of type OuterElem and sets its root to this node. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.
parameters
The properties controlling subsequent traversals.
Definition Classes
TraverserInnerNode
Annotations
@inline()
final def outerNodeDownUpTraverser(implicit parameters: Parameters = Parameters()): DefaultGraphImpl.OuterNodeDownUpTraverser
Instantiates an OuterNodeDownUpTraverser which extends scala.collection.Iterable with elements of type (Boolean, N) and sets its root to this node.
Instantiates an OuterNodeDownUpTraverser which extends scala.collection.Iterable with elements of type (Boolean, N) and sets its root to this node. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.
parameters
The properties controlling subsequent traversals.
Definition Classes
TraverserInnerNode
Annotations
@inline()
final def outerNodeTraverser(implicit parameters: Parameters = Parameters()): DefaultGraphImpl.OuterNodeTraverser
Instantiates an OuterNodeTraverser which extends scala.collection.Iterable with elements of type N and sets its root to this node.
Instantiates an OuterNodeTraverser which extends scala.collection.Iterable with elements of type N and sets its root to this node. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.
parameters
The properties controlling subsequent traversals.
Definition Classes
TraverserInnerNode
Annotations
@inline()
final def outgoing: Set[DefaultGraphImpl.EdgeT] with FilterableSet[DefaultGraphImpl.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
AdjacendyListBaseInnerNode → BaseInnerNode
final def outgoingTo(to: NodeT): Set[DefaultGraphImpl.EdgeT] with FilterableSet[DefaultGraphImpl.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
AdjacendyListBaseInnerNode → BaseInnerNode
def partOfCycle[U](implicit visitor: (NodeT) => U = empty): Option[DefaultGraphImpl.Cycle]
Finds a cycle that contains root taking optional properties like subgraph restriction, ordering or maximum depth into account..
Finds a cycle that contains root taking optional properties like subgraph restriction, ordering or maximum depth into account.. Irrespective of the current setting for kind, DepthFirst is used internally.
visitor
An optional function that is applied for its side-effect to every element visited during graph traversal.
returns
A cycle containing root or None if either
1. there exists no cycle containing root or
2. there exists such a cycle but due to withSubgraph settings this path was out of scope.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
final def pathTo[U](potentialSuccessor: NodeT)(implicit visitor: (NodeT) => U = empty): Option[DefaultGraphImpl.Path]
Finds a path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.
Finds a path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.
potentialSuccessor
The node a path is to be found to.
visitor
An optional function that is applied for its side-effect to every element visited during graph traversal.
returns
A path to potentialSuccessor or None if either
1. there is no node with pred or
2. there exists no path to such a node
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
def pathUntil[U](pred: DefaultGraphImpl.NodePredicate)(implicit visitor: (NodeT) => U = empty): Option[DefaultGraphImpl.Path]
Finds a path from root to a successor of root for which pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.
Finds a path from root to a successor of root for which pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. root itself does not count as a match. This is also true if it has a hook. If several successors exist the algorithm selects any one of these.
pred
The predicate which must hold true for the successor.
visitor
An optional function that is applied for its side-effect to every element visited during graph traversal.
returns
A path to a node with the predicate pred or None if either
1. there is no node with pred or
2. there exists no path to such a node or
3. there exists a path to such a node but due to withSubgraph settings this path was out of scope.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
def remove(edge: DefaultGraphImpl.EdgeT): Boolean
Attributes
protected[collection]
Definition Classes
InnerNodeImpl
def root: NodeT
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
final def shortestPathTo[T](potentialSuccessor: NodeT, weight: (DefaultGraphImpl.EdgeT) => T)(implicit arg0: Numeric[T]): Option[DefaultGraphImpl.Path]
Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.
Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. The calculation is based on the weight of the edges on the path. Edges have a default weight of 1L that can be overridden by custom edges. A weight function yielding any numeric type may also be passed to shortestPathTo.
potentialSuccessor
The node the shortest path is to be found to.
weight
Function to determine the weight of edges. If supplied, this function takes precedence over edge weights.
returns
The shortest path to potentialSuccessor or None if either
1. there exists no path to potentialSuccessor or
2. there exists a path to potentialSuccessor but due to withSubgraph settings this path was out of scope.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
Annotations
@inline()
final def shortestPathTo[U](potentialSuccessor: NodeT)(implicit visitor: (NodeT) => U = empty): Option[DefaultGraphImpl.Path]
Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.
Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. The calculation is based on the weight of the edges on the path. Edges have a default weight of 1L that can be overridden by custom edges. A weight function yielding any numeric type may also be passed to shortestPathTo.
potentialSuccessor
The node the shortest path is to be found to.
visitor
An optional function that is applied for its side-effect to every element visited during graph traversal.
returns
The shortest path to potentialSuccessor or None if either
1. there exists no path to potentialSuccessor or
2. there exists a path to potentialSuccessor but due to withSubgraph settings this path was out of scope.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
Annotations
@inline()
def shortestPathTo[T, U](potentialSuccessor: NodeT, weight: (DefaultGraphImpl.EdgeT) => T, visitor: (NodeT) => U)(implicit arg0: Numeric[T]): Option[DefaultGraphImpl.Path]
Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.
Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. The calculation is based on the weight of the edges on the path. Edges have a default weight of 1L that can be overridden by custom edges. A weight function yielding any numeric type may also be passed to shortestPathTo.
potentialSuccessor
The node the shortest path is to be found to.
weight
Function to determine the weight of edges. If supplied, this function takes precedence over edge weights.
visitor
An optional function that is applied for its side-effect to every element visited during graph traversal.
returns
The shortest path to potentialSuccessor or None if either
1. there exists no path to potentialSuccessor or
2. there exists a path to potentialSuccessor but due to withSubgraph settings this path was out of scope.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
def strongComponents[U](implicit visitor: (NodeT) => U = empty): Iterable[DefaultGraphImpl.Component]
Finds all strongly connected components reachable from this node.
Finds all strongly connected components reachable from this node. See componentTraverser for more control by means of FluentProperties.
visitor
Function to be called for each inner node or inner edge visited during the search.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
final def synchronized[T0](arg0: => T0): T0
Definition Classes
AnyRef
final def toInnerElemTraverser(root: NodeT): DefaultGraphImpl.InnerElemTraverser
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
FluentProperties
def toString(): String
Definition Classes
BaseInnerNode → AnyRef → Any
def topologicalSort[U](ignorePredecessors: Boolean = false)(implicit visitor: (DefaultGraphImpl.InnerElem) => U = empty): DefaultGraphImpl.TopologicalSort
Sorts the component designated by this node topologically.
Sorts the component designated by this node topologically. Only nodes connected with this node will be included in the resulting topological order. If the graph is known to be connected choose GraphTraversal#topologicalSort instead. See componentTraverser for more control by means of FluentProperties.
ignorePredecessors
If true, the topological sort will be partial in that it will only include successors of root. withSubgraph restricts the successor nodes to be included but not predecessors that will be excluded in total.
visitor
Function to be called for each inner node or inner edge visited during the sort.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
def upsert(edge: DefaultGraphImpl.EdgeT): Boolean
Attributes
protected[collection]
Definition Classes
InnerNodeImpl
final def visited(implicit handle: Handle): Boolean
Whether this node is marked as visited with respect to handle.
Whether this node is marked as visited with respect to handle.
Attributes
protected[collection]
Definition Classes
InnerNodeState
Annotations
@inline()
final def visited_=(visited: Boolean)(implicit handle: Handle): Unit
Sets this node to visited with respect to to handle.
Sets this node to visited with respect to to handle.
Attributes
protected[collection]
Definition Classes
InnerNodeState
Annotations
@inline()
final def wait(arg0: Long, arg1: Int): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
final def wait(arg0: Long): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException]) @native()
final def wait(): Unit
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.InterruptedException])
def weakComponent[U](implicit visitor: (NodeT) => U = empty): DefaultGraphImpl.Component
Determines the weak component that contains this node.
Determines the weak component that contains this node. See componentTraverser for more control by means of FluentProperties.
visitor
Function to be called for each inner node or inner edge visited during the search.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
final def withDirection(direction: Direction): DefaultGraphImpl.InnerNodeTraverser
Creates a new FluentProperties based on this except for an updated direction.
Creates a new FluentProperties based on this except for an updated direction. Note that methods returning a Cycle or Path accept only Successors.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
FluentProperties
final def withFlagsExt[T](block: (ExtBitSet) => T): T
Attributes
protected
Definition Classes
InnerNodeState
Annotations
@inline()
final def withKind(kind: Kind): DefaultGraphImpl.InnerNodeTraverser
Creates a new FluentProperties based on this except for an updated kind.
Creates a new FluentProperties based on this except for an updated kind.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
FluentProperties
final def withMaxDepth(maxDepth: Int): DefaultGraphImpl.InnerNodeTraverser
Creates a new FluentProperties based on this except for an updated maxDepth.
Creates a new FluentProperties based on this except for an updated maxDepth.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
FluentProperties
final def withMaxWeight(max: Long): DefaultGraphImpl.InnerNodeTraverser
Creates a new FluentProperties based on this except for an updated maxWeight having the given max and the default weight function returning edge.weight.
Creates a new FluentProperties based on this except for an updated maxWeight having the given max and the default weight function returning edge.weight.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
FluentProperties
final def withMaxWeight[W](max: W, edgeWeight: (DefaultGraphImpl.EdgeT) => W)(implicit arg0: Numeric[W]): DefaultGraphImpl.InnerNodeTraverser
Creates a new FluentProperties based on this except for an updated maxWeight having the given max value and the given weight function.
Creates a new FluentProperties based on this except for an updated maxWeight having the given max value and the given weight function.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
FluentProperties
def withMaxWeight(maxWeight: Option[DefaultGraphImpl.Weight]): DefaultGraphImpl.InnerNodeTraverser
Creates a new FluentProperties based on this except for an updated maxWeight.
Creates a new FluentProperties based on this except for an updated maxWeight.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
FluentProperties
final def withOrdering(ordering: DefaultGraphImpl.ElemOrdering): DefaultGraphImpl.InnerNodeTraverser
Creates a new FluentProperties based on this except for an updated ordering.
Creates a new FluentProperties based on this except for an updated ordering.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
FluentProperties
final def withParameters(parameters: Parameters): DefaultGraphImpl.InnerNodeTraverser
Creates a new FluentProperties based on this except for an updated parameters.
Creates a new FluentProperties based on this except for an updated parameters.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
FluentProperties
final def withRoot(root: NodeT): DefaultGraphImpl.InnerNodeTraverser
Creates a new FluentProperties based on this except for an updated root.
Creates a new FluentProperties based on this except for an updated root.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
final def withSubgraph(nodes: DefaultGraphImpl.NodePredicate = anyNode, edges: DefaultGraphImpl.EdgePredicate = anyEdge): DefaultGraphImpl.InnerNodeTraverser
Creates a new FluentProperties based on this except for an updated subgraphNodes and/or subgraphEdges.
Creates a new FluentProperties based on this except for an updated subgraphNodes and/or subgraphEdges.
Implicit
This member is added by an implicit conversion from NodeBase_ toDefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
FluentProperties

Deprecated Value Members

def finalize(): Unit
Attributes
protected[lang]
Definition Classes
AnyRef
Annotations
@throws(classOf[java.lang.Throwable]) @Deprecated
Deprecated
def formatted(fmtstr: String): String
Implicit
This member is added by an implicit conversion from NodeBase_ toStringFormat[NodeBase_] performed by method StringFormat in scala.Predef.
Definition Classes
StringFormat
Annotations
@deprecated @inline()
Deprecated
(Since version 2.12.16) Use formatString.format(value) instead of value.formatted(formatString), or use the f"" string interpolator. In Java 15 and later, formatted resolves to the new method in String which has reversed parameters.
def →[B](y: B): (NodeBase_, B)
Implicit
This member is added by an implicit conversion from NodeBase_ toArrowAssoc[NodeBase_] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@deprecated
Deprecated
(Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Inherited from DefaultGraphImpl.InnerNodeTraversalImpl

Packages

NodeBase_

final class NodeBase_ extends InnerNodeImpl with InnerNodeTraversalImpl

Instance Constructors

Value Members

Deprecated Value Members

Inherited from DefaultGraphImpl.InnerNodeTraversalImpl

Inherited from DefaultGraphImpl.InnerNodeState

Inherited from DefaultGraphImpl.InnerNodeImpl

Inherited from DefaultGraphImpl.AdjacendyListBaseInnerNode

Inherited from DefaultGraphImpl.GraphLikeInnerNode

Inherited from DefaultGraphImpl.NodeBase

Inherited from DefaultGraphImpl.GraphInnerNode

Inherited from DefaultGraphImpl.TraverserInnerNode

Inherited from DefaultGraphImpl.BaseNodeBase

Inherited from DefaultGraphImpl.BaseInnerNode

Inherited from DefaultGraphImpl.InnerNode

Inherited from DefaultGraphImpl.InnerElem

Inherited from DefaultGraphImpl.Node

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion toDefaultTraverser fromNodeBase_ to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser]

Inherited by implicit conversion toOuter fromNodeBase_ to N

Inherited by implicit conversion any2stringadd fromNodeBase_ to any2stringadd[NodeBase_]

Inherited by implicit conversion StringFormat fromNodeBase_ to StringFormat[NodeBase_]

Inherited by implicit conversion Ensuring fromNodeBase_ to Ensuring[NodeBase_]

Inherited by implicit conversion ArrowAssoc fromNodeBase_ to ArrowAssoc[NodeBase_]

Ungrouped

Packages

NodeBase_

final class NodeBase_ extends InnerNodeImpl with InnerNodeTraversalImpl

Instance Constructors

Value Members

Deprecated Value Members

Inherited from DefaultGraphImpl.InnerNodeTraversalImpl

Inherited from DefaultGraphImpl.InnerNodeState

Inherited from DefaultGraphImpl.InnerNodeImpl

Inherited from DefaultGraphImpl.AdjacendyListBaseInnerNode

Inherited from DefaultGraphImpl.GraphLikeInnerNode

Inherited from DefaultGraphImpl.NodeBase

Inherited from DefaultGraphImpl.GraphInnerNode

Inherited from DefaultGraphImpl.TraverserInnerNode

Inherited from DefaultGraphImpl.BaseNodeBase

Inherited from DefaultGraphImpl.BaseInnerNode

Inherited from DefaultGraphImpl.InnerNode

Inherited from DefaultGraphImpl.InnerElem

Inherited from DefaultGraphImpl.Node

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion toDefaultTraverser fromNodeBase_ to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser]

Inherited by implicit conversion toOuter fromNodeBase_ to N

Inherited by implicit conversion any2stringadd fromNodeBase_ to any2stringadd[NodeBase_]

Inherited by implicit conversion StringFormat fromNodeBase_ to StringFormat[NodeBase_]

Inherited by implicit conversion Ensuring fromNodeBase_ to Ensuring[NodeBase_]

Inherited by implicit conversion ArrowAssoc fromNodeBase_ to ArrowAssoc[NodeBase_]

Ungrouped

NodeBase_