InnerNode

Abstract Value Members

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

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

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

Attributes
protected[scalax.collection]
Definition Classes
InnerNode
abstract def connectionsWith(other: This.NodeT): Set[This.EdgeT] with FilterableSet[This.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
InnerNode
abstract 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
InnerNode
abstract def diPredecessors: Set[This.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
InnerNode
abstract def diSuccessors: Set[This.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
InnerNode
abstract def edges: ExtSet[This.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
InnerNode
abstract def findIncomingFrom(from: This.NodeT): Option[This.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
InnerNode
abstract def findOutgoingTo(to: This.NodeT): Option[This.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
InnerNode
abstract 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
InnerNode
abstract def hasPredecessors: Boolean

Whether this node has any predecessors.
Whether this node has any predecessors.

Definition Classes
InnerNode
abstract def hasSuccessors: Boolean

Whether this node has any successors.
Whether this node has any successors.

Definition Classes
InnerNode
abstract def inDegree(nodeFilter: This.NodeFilter, edgeFilter: This.EdgeFilter = 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
InnerNode
abstract 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
InnerNode
abstract def incoming: Set[This.EdgeT] with FilterableSet[This.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
InnerNode
abstract def incomingFrom(from: This.NodeT): Set[This.EdgeT] with FilterableSet[This.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
InnerNode
abstract def isContaining[N, E[X] <: EdgeLikeIn[X]](g: GraphBase[N, E]): Boolean

Definition Classes
InnerNodeParam
abstract def isDirectPredecessorOf(that: This.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
InnerNode
abstract def isIndependentOf(that: This.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
InnerNode
abstract def neighbors: Set[This.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
InnerNode
abstract def outDegree(nodeFilter: This.NodeFilter, edgeFilter: This.EdgeFilter = 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
InnerNode
abstract 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
InnerNode
abstract def outgoing: Set[This.EdgeT] with FilterableSet[This.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
InnerNode
abstract def outgoingTo(to: This.NodeT): Set[This.EdgeT] with FilterableSet[This.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
InnerNode
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
InnerNode → NodeParam

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 This.InnerNode to any2stringadd[This.InnerNode] performed by method any2stringadd in scala.Predef.
Definition Classes
any2stringadd
final def +~(that: N, those: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind = Bag): This.EdgeT

Synonym to connectWith
Synonym to connectWith

Definition Classes
InnerNodeOps
Annotations
@inline()
final def +~(that: N)(implicit edgeFactory: EdgeCompanion[E]): This.EdgeT

Synonym to connectWith
Synonym to connectWith

Definition Classes
InnerNodeOps
Annotations
@inline()
final def +~%[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](that: N, those: N*)(weight: Long)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): This.EdgeT

Synonym to connectWithW(that, those)(weight).
Synonym to connectWithW(that, those)(weight).

Definition Classes
InnerNodeOps
Annotations
@inline()
final def +~%[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](that: N)(weight: Long)(implicit edgeFactory: WEdgeCompanion[EE]): This.EdgeT

Synonym to connectWithW(that)(weight).
Synonym to connectWithW(that)(weight).

Definition Classes
InnerNodeOps
Annotations
@inline()
final def +~%+[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](that: N, those: N*)(weight: Long, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): This.EdgeT

Synonym to connectWithWL(that, those)(weight, label).
Synonym to connectWithWL(that, those)(weight, label).

Definition Classes
InnerNodeOps
Annotations
@inline()
final def +~%+[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](that: N)(weight: Long, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): This.EdgeT

Synonym to connectWithWL(that)(weight, label).
Synonym to connectWithWL(that)(weight, label).

Definition Classes
InnerNodeOps
Annotations
@inline()
final def +~+[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](that: N, those: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): This.EdgeT

Synonym to connectWithL(that, those)(label).
Synonym to connectWithL(that, those)(label).

Definition Classes
InnerNodeOps
Annotations
@inline()
final def +~+[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](that: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): This.EdgeT

Synonym to connectWithL(that)(label).
Synonym to connectWithL(that)(label).

Definition Classes
InnerNodeOps
Annotations
@inline()
def ->[B](y: B): (This.InnerNode, B)

Implicit information
This member is added by an implicit conversion from This.InnerNode to ArrowAssoc[This.InnerNode] performed by method ArrowAssoc in scala.Predef.
Definition Classes
ArrowAssoc
Annotations
@inline()
final def <~(from: This.NodeT): Set[This.EdgeT] with FilterableSet[This.EdgeT]

Synonym for incomingFrom.
Synonym for incomingFrom.

Definition Classes
InnerNode
Annotations
@inline()
final def <~: Set[This.EdgeT] with FilterableSet[This.EdgeT]

Synonym for incoming.
Synonym for incoming.

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

Synonym for findIncomingFrom.
Synonym for findIncomingFrom.

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

Synonym for diPredecessors.
Synonym for diPredecessors.

Definition Classes
InnerNode
Annotations
@inline()
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
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.InnerNodeParam.asNodeT.G.NodeT

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

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

Definition Classes
InnerNode
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def connectWith(that: N, those: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind = Bag): This.EdgeT

Creates a new inner hyperedge between this node and that plus those using edgeFactory and adds it to the edge set of this graph.
Creates a new inner hyperedge between this node and that plus those using edgeFactory and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. Same as calling addAndGetEdge(this, that, those) on a Graph instance.
that
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
those
The third and possibly more inner or outer nodes to be incident with the hyperedge to be created. In case of a directed edge, these become targets.
edgeFactory
An edge companion who's from is to serve as the edge factory.
returns
true if a new hyperedge has been created. false if no new hyperedge could be created because there exists a corresponding equaling hyperedge.

Definition Classes
InnerNodeOps
Annotations
@inline()
final def connectWith(that: N)(implicit edgeFactory: EdgeCompanion[E]): This.EdgeT

Creates a new inner edge between this node and that using edgeFactory and adds it to the edge set of this graph.
Creates a new inner edge between this node and that using edgeFactory and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. Same as calling addAndGetEdge(this, that).
that
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
edgeFactory
An edge companion who's from is to serve as the edge factory.
returns
true if a new edge has been created. false if no new edge could be created because there exists a corresponding equaling edge.

Definition Classes
InnerNodeOps
Annotations
@inline()
final def connectWithL[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](that: N, those: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): This.EdgeT

Creates a new labeled inner hyperedge between this node and that plus those using edgeFactory and adds it to the edge set of this graph.
Creates a new labeled inner hyperedge between this node and that plus those using edgeFactory and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. Same as addAndGetLEdge(this, that, those)(label) on a Graph instance.
that
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
those
The third and possibly more inner or outer nodes to be incident with the hyperedge to be created. In case of a directed edge, these become targets.
label
The value the labeled edge to be created should have as its label.
edgeFactory
An edge companion who's from is to serve as the edge factory.
returns
true if a new hyperedge has been created. false if no new hyperedge could be created because there exists a corresponding equaling hyperedge.

Definition Classes
InnerNodeOps
Annotations
@inline()
final def connectWithL[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](that: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): This.EdgeT

Creates a new labeled inner edge between this node and that using edgeFactory and adds it to the edge set of this graph.
Creates a new labeled inner edge between this node and that using edgeFactory and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. Same as addAndGetLEdge(this, that)(label) on a Graph instance.
that
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
label
The value the labeled edge to be created should have as its label.
edgeFactory
An edge companion who's from is to serve as the edge factory.
returns
true if a new edge has been created. false if no new edge could be created because there exists a corresponding equaling edge.

Definition Classes
InnerNodeOps
Annotations
@inline()
final def connectWithW[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](that: N, those: N*)(weight: Long)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): This.EdgeT

Creates a new weighted inner hyperedge between this node and that plus those using edgeFactory and adds it to the edge set of this graph.
Creates a new weighted inner hyperedge between this node and that plus those using edgeFactory and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. Same as addAndGetWEdge(this, that, those)(weight) on a Graph instance.
that
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
those
The third and possibly more inner or outer nodes to be incident with the hyperedge to be created. In case of a directed edge, these become targets.
weight
The number the weighted edge to be created should have as its weight.
edgeFactory
An edge companion who's from is to serve as the edge factory.
returns
true if a new hyperedge has been created. false if no new hyperedge could be created because there exists a corresponding equaling hyperedge.

Definition Classes
InnerNodeOps
Annotations
@inline()
final def connectWithW[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](that: N)(weight: Long)(implicit edgeFactory: WEdgeCompanion[EE]): This.EdgeT

Creates a new weighted inner edge between this node and that using edgeFactory and adds it to the edge set of this graph.
Creates a new weighted inner edge between this node and that using edgeFactory and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. Same as addAndGetWEdge(this, that)(weight) on a Graph instance.
that
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
weight
The number the weighted edge to be created should have as its weight.
edgeFactory
An edge companion who's from is to serve as the edge factory.
returns
true if a new edge has been created. false if no new edge could be created because there exists a corresponding equaling edge.

Definition Classes
InnerNodeOps
Annotations
@inline()
final def connectWithWL[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](that: N, those: N*)(weight: Long, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): This.EdgeT

Creates a new weighted and labeled inner hyperedge between this node and that plus those using edgeFactory and adds it to the edge set of this graph.
Creates a new weighted and labeled inner hyperedge between this node and that plus those using edgeFactory and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. Same as addAndGetWLEdge(this, that, those)(weight, label) on a Graph instance.
that
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
those
The third and possibly more inner or outer nodes to be incident with the hyperedge to be created. In case of a directed edge, these become targets.
weight
The number the weighted edge to be created should have as its weight.
label
The value the labeled edge to be created should have as its label.
edgeFactory
An edge companion who's from is to serve as the edge factory.
returns
true if a new hyperedge has been created. false if no new hyperedge could be created because there exists a corresponding equaling hyperedge.

Definition Classes
InnerNodeOps
Annotations
@inline()
final def connectWithWL[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](that: N)(weight: Long, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): This.EdgeT

Creates a new weighted and labeled inner edge between this node and that using edgeFactory and adds it to the edge set of this graph.
Creates a new weighted and labeled inner edge between this node and that using edgeFactory and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. Same as addAndGetWLEdge(this, that)(weight, label) on a Graph instance.
that
The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.
weight
The number the weighted edge to be created should have as its weight.
label
The value the labeled edge to be created should have as its label.
edgeFactory
An edge companion who's from is to serve as the edge factory.
returns
true if a new edge has been created. false if no new edge could be created because there exists a corresponding equaling edge.

Definition Classes
InnerNodeOps
Annotations
@inline()
final def containingGraph: This.ThisGraph

The Graph instance this node is contained in.
The Graph instance this node is contained in.

Definition Classes
InnerNode
def ensuring(cond: (This.InnerNode) ⇒ Boolean, msg: ⇒ Any): This.InnerNode

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

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

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

Implicit information
This member is added by an implicit conversion from This.InnerNode to Ensuring[This.InnerNode] 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
InnerNode → AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def findConnected[U](pred: This.NodeFilter)(implicit visitor: (This.NodeT) ⇒ U = empty): Option[This.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 weekly 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 information
This member is added by an implicit conversion from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
def findCycle[U](implicit visitor: (This.NodeT) ⇒ U = empty): Option[This.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 information
This member is added by an implicit conversion from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
final def findPredecessor[U](pred: This.NodeFilter)(implicit visitor: (This.NodeT) ⇒ U = empty): Option[This.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 information
This member is added by an implicit conversion from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
final def findSuccessor[U](pred: This.NodeFilter)(implicit visitor: (This.NodeT) ⇒ U = empty): Option[This.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 information
This member is added by an implicit conversion from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
final def fold[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton, T](g: G)(fa: (GraphPredef.InnerNodeParam.fold.G.NodeT) ⇒ T, fb: (GraphBase.NodeT) ⇒ T): T

Definition Classes
InnerNodeParam
def formatted(fmtstr: String): String

Implicit information
This member is added by an implicit conversion from This.InnerNode to StringFormat[This.InnerNode] performed by method StringFormat in scala.Predef.
Definition Classes
StringFormat
Annotations
@inline()
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
final def hasPredecessor[U](potentialPredecessor: This.NodeT)(implicit visitor: (This.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 information
This member is added by an implicit conversion from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
Annotations
@inline()
final def hasSuccessor[U](potentialSuccessor: This.NodeT)(implicit visitor: (This.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 information
This member is added by an implicit conversion from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
Annotations
@inline()
def hashCode(): Int

Definition Classes
InnerNode → AnyRef → Any
final def inNeighbors: Set[This.NodeT]

Synonym for diPredecessors.
Synonym for diPredecessors.

Definition Classes
InnerNode
Annotations
@inline()
final def innerEdgeTraverser(implicit parameters: Parameters = Parameters()): This.InnerEdgeTraverser

Instantiates an InnerEdgeTraverser which extends scala.collection.Traversable with elements of type EdgeT and sets its root to this node.
Instantiates an InnerEdgeTraverser which extends scala.collection.Traversable 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.Traversable on this instance.
parameters
The properties controlling subsequent traversals.

Definition Classes
TraverserInnerNode
Annotations
@inline()
final def innerElemTraverser(implicit parameters: Parameters = Parameters()): This.InnerElemTraverser

Instantiates an InnerElemTraverser which extends scala.collection.Traversable with elements of type InnerElem and sets its root to this node.
Instantiates an InnerElemTraverser which extends scala.collection.Traversable 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.Traversable on this instance.
parameters
The properties controlling subsequent traversals.

Definition Classes
TraverserInnerNode
Annotations
@inline()
final def innerNodeDownUpTraverser(implicit parameters: Parameters = Parameters()): This.InnerNodeDownUpTraverser

Instantiates an InnerNodeDownUpTraverser which extends scala.collection.Traversable with elements of type (Boolean, NodeT) and sets its root to this node.
Instantiates an InnerNodeDownUpTraverser which extends scala.collection.Traversable 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.Traversable on this instance.
parameters
The properties controlling subsequent traversals.

Definition Classes
TraverserInnerNode
Annotations
@inline()
final def innerNodeTraverser(implicit parameters: Parameters = Parameters()): This.InnerNodeTraverser

Instantiates an InnerNodeTraverser which extends scala.collection.Traversable with elements of type NodeT and sets its root to this node.
Instantiates an InnerNodeTraverser which extends scala.collection.Traversable 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.Traversable on this instance.
parameters
The properties controlling subsequent traversals.

Definition Classes
TraverserInnerNode
Annotations
@inline()
final def isConnectedWith[U](potentialConnected: This.NodeT)(implicit visitor: (This.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 weekly 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 information
This member is added by an implicit conversion from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
Annotations
@inline()
def isDefined: Boolean

Definition Classes
Param
def isEdge: Boolean

Definition Classes
NodeParam
def isIn: Boolean

Definition Classes
OutParam → Param
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
InnerNode
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
InnerNode
Annotations
@inline()
def isNode: Boolean

Definition Classes
NodeParam
def isOut: Boolean

Definition Classes
OutParam → Param
final def isPredecessorOf[U](potentialSuccessor: This.NodeT)(implicit visitor: (This.NodeT) ⇒ U = empty): Boolean

Same as hasSuccessor.
Same as hasSuccessor.

Implicit information
This member is added by an implicit conversion from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
Annotations
@inline()
final def isSuccessorOf[U](potentialPredecessor: This.NodeT)(implicit visitor: (This.NodeT) ⇒ U = empty): Boolean

Same as hasPredecessor.
Same as hasPredecessor.

Implicit information
This member is added by an implicit conversion from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
Annotations
@inline()
val n1: This.InnerNode

Implicit information
This member is added by an implicit conversion from This.InnerNode to EdgeAssoc[This.InnerNode] performed by method EdgeAssoc in scalax.collection.GraphPredef.
Definition Classes
EdgeAssoc
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def outNeighbors: Set[This.NodeT]

Synonym for diSuccessors.
Synonym for diSuccessors.

Definition Classes
InnerNode
Annotations
@inline()
final def outerEdgeTraverser(implicit parameters: Parameters = Parameters()): This.OuterEdgeTraverser

Instantiates an OuterEdgeTraverser which extends scala.collection.Traversable with elements of type E[N] and sets its root to this node.
Instantiates an OuterEdgeTraverser which extends scala.collection.Traversable 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.Traversable on this instance.
parameters
The properties controlling subsequent traversals.

Definition Classes
TraverserInnerNode
Annotations
@inline()
final def outerElemTraverser(implicit parameters: Parameters = Parameters()): This.OuterElemTraverser

Instantiates an OuterElemTraverser which extends scala.collection.Traversable with elements of type OuterElem and sets its root to this node.
Instantiates an OuterElemTraverser which extends scala.collection.Traversable 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.Traversable on this instance.
parameters
The properties controlling subsequent traversals.

Definition Classes
TraverserInnerNode
Annotations
@inline()
final def outerNodeDownUpTraverser(implicit parameters: Parameters = Parameters()): This.OuterNodeDownUpTraverser

Instantiates an OuterNodeDownUpTraverser which extends scala.collection.Traversable with elements of type (Boolean, N) and sets its root to this node.
Instantiates an OuterNodeDownUpTraverser which extends scala.collection.Traversable 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.Traversable on this instance.
parameters
The properties controlling subsequent traversals.

Definition Classes
TraverserInnerNode
Annotations
@inline()
final def outerNodeTraverser(implicit parameters: Parameters = Parameters()): This.OuterNodeTraverser

Instantiates an OuterNodeTraverser which extends scala.collection.Traversable with elements of type N and sets its root to this node.
Instantiates an OuterNodeTraverser which extends scala.collection.Traversable 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.Traversable on this instance.
parameters
The properties controlling subsequent traversals.

Definition Classes
TraverserInnerNode
Annotations
@inline()
final def pathTo[U](potentialSuccessor: This.NodeT)(implicit visitor: (This.NodeT) ⇒ U = empty): Option[This.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 information
This member is added by an implicit conversion from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
def pathUntil[U](pred: This.NodeFilter)(implicit visitor: (This.NodeT) ⇒ U = empty): Option[This.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 information
This member is added by an implicit conversion from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
def root: This.NodeT

Implicit information
This member is added by an implicit conversion from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
final def shortestPathTo[T](potentialSuccessor: This.NodeT, weight: (This.EdgeT) ⇒ T)(implicit arg0: Numeric[T]): Option[This.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 information
This member is added by an implicit conversion from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
Annotations
@inline()
final def shortestPathTo[U](potentialSuccessor: This.NodeT)(implicit visitor: (This.NodeT) ⇒ U = empty): Option[This.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 information
This member is added by an implicit conversion from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
Annotations
@inline()
def shortestPathTo[T, U](potentialSuccessor: This.NodeT, weight: (This.EdgeT) ⇒ T, visitor: (This.NodeT) ⇒ U)(implicit arg0: Numeric[T]): Option[This.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 information
This member is added by an implicit conversion from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
def stringPrefix: String

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

Definition Classes
AnyRef
final def toInnerElemTraverser(root: This.NodeT): This.InnerElemTraverser

Implicit information
This member is added by an implicit conversion from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
FluentProperties
final def toNodeT[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G)(f: (GraphBase.NodeT) ⇒ GraphPredef.InnerNodeParam.toNodeT.G.NodeT): GraphPredef.InnerNodeParam.toNodeT.G.NodeT

Definition Classes
InnerNodeParam
def toParArray: ParArray[T]

Implicit information
This member is added by an implicit conversion from This.InnerNode to CollectionsHaveToParArray[This.InnerNode, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type (This.InnerNode) ⇒ GenTraversableOnce[T] is in scope.
Definition Classes
CollectionsHaveToParArray
def toString(): String

Definition Classes
NodeParam → AnyRef → Any
def topologicalSort[U](ignorePredecessors: Boolean = false)(implicit visitor: (This.InnerElem) ⇒ U = empty): This.CycleNodeOrTopologicalOrder

Sorts the component designated by the given node topologically.
Sorts the component designated by the given 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 information
This member is added by an implicit conversion from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
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 withDirection(direction: Direction): This.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.

Implicit information
This member is added by an implicit conversion from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
FluentProperties
final def withKind(kind: Kind): This.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 information
This member is added by an implicit conversion from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
FluentProperties
final def withMaxDepth(maxDepth: Int): This.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 information
This member is added by an implicit conversion from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
FluentProperties
final def withOrdering(ordering: This.ElemOrdering): This.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 information
This member is added by an implicit conversion from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
FluentProperties
final def withParameters(parameters: Parameters): This.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 information
This member is added by an implicit conversion from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
FluentProperties
final def withRoot(root: This.NodeT): This.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 information
This member is added by an implicit conversion from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
TraverserMethods
final def withSubgraph(nodes: This.NodeFilter = anyNode, edges: This.EdgeFilter = anyEdge): This.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 information
This member is added by an implicit conversion from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
Definition Classes
FluentProperties
final def ~: ExtSet[This.EdgeT]

Synonym for edges.
Synonym for edges.

Definition Classes
InnerNode
Annotations
@inline()
final def ~>(to: This.NodeT): Set[This.EdgeT] with FilterableSet[This.EdgeT]

Synonym for outgoingTo.
Synonym for outgoingTo.

Definition Classes
InnerNode
Annotations
@inline()
final def ~>: Set[This.EdgeT] with FilterableSet[This.EdgeT]

Synonym for outgoing.
Synonym for outgoing.

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

Synonym for findOutgoingTo.
Synonym for findOutgoingTo.

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

Synonym for diSuccessors.
Synonym for diSuccessors.

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

Synonym for neighbors.
Synonym for neighbors.

Definition Classes
InnerNode
Annotations
@inline()
def →[B](y: B): (This.InnerNode, B)

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

Shadowed Implicit Value Members

def isDefined: Boolean
Implicit information
This member is added by an implicit conversion from This.InnerNode to OuterNode[This.InnerNode] performed by method anyToNode in scalax.collection.GraphPredef.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerNode: OuterNode[This.InnerNode]).isDefined
Definition Classes
Param
def isEdge: Boolean
Implicit information
This member is added by an implicit conversion from This.InnerNode to OuterNode[This.InnerNode] performed by method anyToNode in scalax.collection.GraphPredef.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerNode: OuterNode[This.InnerNode]).isEdge
Definition Classes
NodeParam
def isIn: Boolean
Implicit information
This member is added by an implicit conversion from This.InnerNode to OuterNode[This.InnerNode] performed by method anyToNode in scalax.collection.GraphPredef.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerNode: OuterNode[This.InnerNode]).isIn
Definition Classes
InParam → Param
def isNode: Boolean
Implicit information
This member is added by an implicit conversion from This.InnerNode to OuterNode[This.InnerNode] performed by method anyToNode in scalax.collection.GraphPredef.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerNode: OuterNode[This.InnerNode]).isNode
Definition Classes
NodeParam
def isOut: Boolean
Implicit information
This member is added by an implicit conversion from This.InnerNode to OuterNode[This.InnerNode] performed by method anyToNode in scalax.collection.GraphPredef.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerNode: OuterNode[This.InnerNode]).isOut
Definition Classes
InParam → Param
def stringPrefix: String
Implicit information
This member is added by an implicit conversion from This.InnerNode to OuterNode[This.InnerNode] performed by method anyToNode in scalax.collection.GraphPredef.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerNode: OuterNode[This.InnerNode]).stringPrefix
Definition Classes
NodeParam
def toString(): String
Implicit information
This member is added by an implicit conversion from This.InnerNode to OuterNode[This.InnerNode] performed by method anyToNode in scalax.collection.GraphPredef.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerNode: OuterNode[This.InnerNode]).toString()
Definition Classes
NodeParam → AnyRef → Any
val value: This.InnerNode
Implicit information
This member is added by an implicit conversion from This.InnerNode to OuterNode[This.InnerNode] performed by method anyToNode in scalax.collection.GraphPredef.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerNode: OuterNode[This.InnerNode]).value
Definition Classes
OuterNode → NodeParam
def ~[N >: N1](n2: N): UnDiEdge[N]
Implicit information
This member is added by an implicit conversion from This.InnerNode to EdgeAssoc[This.InnerNode] performed by method EdgeAssoc in scalax.collection.GraphPredef.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerNode: EdgeAssoc[This.InnerNode]).~(n2)
Definition Classes
EdgeAssoc
Annotations
@inline()
def ~>[N >: N1](n2: N): DiEdge[N]
Implicit information
This member is added by an implicit conversion from This.InnerNode to EdgeAssoc[This.InnerNode] performed by method EdgeAssoc in scalax.collection.GraphPredef.
Shadowing
This implicitly inherited member is shadowed by one or more members in this class.
To access this member you can use a type ascription:
(innerNode: EdgeAssoc[This.InnerNode]).~>(n2)
Definition Classes
EdgeAssoc
Annotations
@inline()

Inherited from This.InnerNodeOps

Inherited from This.InnerNode

Inherited from This.TraverserInnerNode

Inherited from This.InnerNode

Inherited from This.InnerElem

Inherited from This.Node

Inherited from Serializable

Inherited from InnerNodeParam[N]

Inherited from NodeParam[N]

Inherited from OutParam[N, Nothing]

Inherited from Param[N, Nothing]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion anyToNode from This.InnerNode to OuterNode[This.InnerNode]

Inherited by implicit conversion toDefaultTraverser from This.InnerNode to This.TraverserMethods[This.NodeT, This.InnerNodeTraverser]

Inherited by implicit conversion EdgeAssoc from This.InnerNode to EdgeAssoc[This.InnerNode]

Inherited by implicit conversion CollectionsHaveToParArray from This.InnerNode to CollectionsHaveToParArray[This.InnerNode, T]

Inherited by implicit conversion any2stringadd from This.InnerNode to any2stringadd[This.InnerNode]

Inherited by implicit conversion StringFormat from This.InnerNode to StringFormat[This.InnerNode]

Inherited by implicit conversion Ensuring from This.InnerNode to Ensuring[This.InnerNode]

Inherited by implicit conversion ArrowAssoc from This.InnerNode to ArrowAssoc[This.InnerNode]

Ungrouped

Related Doc: package GraphLike

trait InnerNode extends This.InnerNode with This.InnerNodeOps

Abstract Value Members

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

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

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

abstract def connectionsWith(other: This.NodeT): Set[This.EdgeT] with FilterableSet[This.EdgeT]

abstract def degree: Int

abstract def diPredecessors: Set[This.NodeT]

abstract def diSuccessors: Set[This.NodeT]

abstract def edges: ExtSet[This.EdgeT]

abstract def findIncomingFrom(from: This.NodeT): Option[This.EdgeT]

abstract def findOutgoingTo(to: This.NodeT): Option[This.EdgeT]

abstract def hasOnlyHooks: Boolean

abstract def hasPredecessors: Boolean

abstract def hasSuccessors: Boolean

abstract def inDegree(nodeFilter: This.NodeFilter, edgeFilter: This.EdgeFilter = anyEdge, includeHooks: Boolean = false, ignoreMultiEdges: Boolean = true): Int

abstract def inDegree: Int

abstract def incoming: Set[This.EdgeT] with FilterableSet[This.EdgeT]

abstract def incomingFrom(from: This.NodeT): Set[This.EdgeT] with FilterableSet[This.EdgeT]

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

abstract def isDirectPredecessorOf(that: This.NodeT): Boolean

abstract def isIndependentOf(that: This.NodeT): Boolean

abstract def neighbors: Set[This.NodeT]

abstract def outDegree(nodeFilter: This.NodeFilter, edgeFilter: This.EdgeFilter = anyEdge, includeHooks: Boolean = false, ignoreMultiEdges: Boolean = true): Int

abstract def outDegree: Int

abstract def outgoing: Set[This.EdgeT] with FilterableSet[This.EdgeT]

abstract def outgoingTo(to: This.NodeT): Set[This.EdgeT] with FilterableSet[This.EdgeT]

abstract def value: N

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

def +(other: String): String

final def +~(that: N, those: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind = Bag): This.EdgeT

final def +~(that: N)(implicit edgeFactory: EdgeCompanion[E]): This.EdgeT

final def +~%[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](that: N, those: N*)(weight: Long)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): This.EdgeT

final def +~%[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](that: N)(weight: Long)(implicit edgeFactory: WEdgeCompanion[EE]): This.EdgeT

final def +~%+[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](that: N, those: N*)(weight: Long, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): This.EdgeT

final def +~%+[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](that: N)(weight: Long, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): This.EdgeT

final def +~+[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](that: N, those: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): This.EdgeT

final def +~+[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](that: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): This.EdgeT

def ->[B](y: B): (This.InnerNode, B)

final def <~(from: This.NodeT): Set[This.EdgeT] with FilterableSet[This.EdgeT]

final def <~: Set[This.EdgeT] with FilterableSet[This.EdgeT]

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

final def <~|: Set[This.NodeT]

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

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

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

def canEqual(that: Any): Boolean

def clone(): AnyRef

final def connectWith(that: N, those: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind = Bag): This.EdgeT

final def connectWith(that: N)(implicit edgeFactory: EdgeCompanion[E]): This.EdgeT

final def connectWithL[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](that: N, those: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): This.EdgeT

final def connectWithL[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](that: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): This.EdgeT

final def connectWithW[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](that: N, those: N*)(weight: Long)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): This.EdgeT

final def connectWithW[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](that: N)(weight: Long)(implicit edgeFactory: WEdgeCompanion[EE]): This.EdgeT

final def connectWithWL[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](that: N, those: N*)(weight: Long, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): This.EdgeT

final def connectWithWL[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](that: N)(weight: Long, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): This.EdgeT

final def containingGraph: This.ThisGraph

def ensuring(cond: (This.InnerNode) ⇒ Boolean, msg: ⇒ Any): This.InnerNode

def ensuring(cond: (This.InnerNode) ⇒ Boolean): This.InnerNode

def ensuring(cond: Boolean, msg: ⇒ Any): This.InnerNode

def ensuring(cond: Boolean): This.InnerNode

final def eq(arg0: AnyRef): Boolean

def equals(other: Any): Boolean

def finalize(): Unit

final def findConnected[U](pred: This.NodeFilter)(implicit visitor: (This.NodeT) ⇒ U = empty): Option[This.NodeT]

def findCycle[U](implicit visitor: (This.NodeT) ⇒ U = empty): Option[This.Cycle]

final def findPredecessor[U](pred: This.NodeFilter)(implicit visitor: (This.NodeT) ⇒ U = empty): Option[This.NodeT]

final def findSuccessor[U](pred: This.NodeFilter)(implicit visitor: (This.NodeT) ⇒ U = empty): Option[This.NodeT]

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

def formatted(fmtstr: String): String

final def getClass(): Class[_]

final def hasPredecessor[U](potentialPredecessor: This.NodeT)(implicit visitor: (This.NodeT) ⇒ U = empty): Boolean

final def hasSuccessor[U](potentialSuccessor: This.NodeT)(implicit visitor: (This.NodeT) ⇒ U = empty): Boolean

def hashCode(): Int

final def inNeighbors: Set[This.NodeT]