final class NodeBase extends InnerNodeImpl with InnerNodeTraversalImpl
- Attributes
- protected
- Annotations
- @SerialVersionUID()
Linear Supertypes
Type Hierarchy
Ordering
- Alphabetic
- By Inheritance
Inherited
- NodeBase
- InnerNodeTraversalImpl
- InnerNodeState
- InnerNodeImpl
- InnerNode
- NodeBase
- InnerNode
- TraverserInnerNode
- NodeBase
- InnerNode
- InnerElem
- Node
- Serializable
- InnerNodeParam
- NodeParam
- OutParam
- Param
- AnyRef
- Any
Implicitly
- by toDefaultTraverser
- by EdgeAssoc
- by anyToNode
- by ChainingOps
- by toValue
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
Visibility
- Public
- Protected
Instance Constructors
- new NodeBase(value: N, hints: Hints)
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##(): Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- final def +=(edge: DefaultGraphImpl.EdgeT): NodeBase.this.type
- Attributes
- protected[collection]
- Definition Classes
- InnerNode
- Annotations
- @inline()
- def ->[B](y: B): (NodeBase, B)
- final def <~(from: NodeT): Set[DefaultGraphImpl.EdgeT] with FilterableSet[DefaultGraphImpl.EdgeT]
- Definition Classes
- InnerNode
- Annotations
- @inline()
- final def <~: Set[DefaultGraphImpl.EdgeT] with FilterableSet[DefaultGraphImpl.EdgeT]
- Definition Classes
- InnerNode
- Annotations
- @inline()
- final def <~?(from: NodeT): Option[DefaultGraphImpl.EdgeT]
- Definition Classes
- InnerNode
- Annotations
- @inline()
- final def <~|: Set[NodeT]
- Definition Classes
- InnerNode
- Annotations
- @inline()
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- var _diSuccessors: EqSet[NodeT]
- Attributes
- protected
- Definition Classes
- InnerNodeImpl
- def add(edge: DefaultGraphImpl.EdgeT): Boolean
- Attributes
- protected[collection]
- Definition Classes
- InnerNode
- Annotations
- @inline()
- final def addDiPredecessors(edge: DefaultGraphImpl.EdgeT, add: (NodeT) => Unit): Unit
- Attributes
- protected[collection]
- Definition Classes
- InnerNode → InnerNode
- final def addDiSuccessors(edge: DefaultGraphImpl.EdgeT, add: (NodeT) => Unit): Unit
- Attributes
- protected[collection]
- Definition Classes
- InnerNode → InnerNode
- final def addNeighbors(edge: DefaultGraphImpl.EdgeT, add: (NodeT) => Unit): Unit
- Attributes
- protected[collection]
- Definition Classes
- InnerNode → InnerNode
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- final def asNodeT[N <: N, E[+X] <: EdgeLikeIn[X], G <: GraphBase[N, E]](g: G): GraphPredef.InnerNodeParam.asNodeT.G.NodeT
- Attributes
- protected[collection]
- Definition Classes
- InnerNodeParam
- final def asNodeTProjection[N <: N, E[+X] <: EdgeLikeIn[X]]: GraphBase.NodeT
- Attributes
- protected[collection]
- Definition Classes
- InnerNodeParam
- 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
- InnerNode
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- final def connectionsWith(other: NodeT): Set[DefaultGraphImpl.EdgeT] with FilterableSet[DefaultGraphImpl.EdgeT]
- Definition Classes
- InnerNode → InnerNode
- final def containingGraph: DefaultGraphImpl.ThisGraph
- Definition Classes
- InnerNode
- final def degree: Int
- Definition Classes
- InnerNode → InnerNode
- final def diPredecessors: Set[NodeT]
- Definition Classes
- InnerNode → InnerNode
- final def diSuccessors: Set[NodeT]
- Definition Classes
- InnerNodeImpl → InnerNode
- def dumpState: Array[Long]
- Definition Classes
- InnerNodeState
- final val edges: ArraySet[DefaultGraphImpl.EdgeT]
- Definition Classes
- InnerNodeImpl → InnerNode → InnerNode
- def ensuring(cond: (NodeBase) => Boolean, msg: => Any): NodeBase
- def ensuring(cond: (NodeBase) => Boolean): NodeBase
- def ensuring(cond: Boolean, msg: => Any): NodeBase
- def ensuring(cond: Boolean): NodeBase
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(other: Any): Boolean
- Definition Classes
- InnerNode → AnyRef → Any
- final def findConnected[U](pred: DefaultGraphImpl.NodeFilter)(implicit visitor: (NodeT) => U): Option[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
- def findCycle[U](implicit visitor: (NodeT) => U): Option[DefaultGraphImpl.Cycle]
- 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]
- Definition Classes
- InnerNode → InnerNode
- final def findOutgoingTo(to: NodeT): Option[DefaultGraphImpl.EdgeT]
- Definition Classes
- InnerNode → InnerNode
- final def findPredecessor[U](pred: DefaultGraphImpl.NodeFilter)(implicit visitor: (NodeT) => U): Option[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 findSuccessor[U](pred: DefaultGraphImpl.NodeFilter)(implicit visitor: (NodeT) => U): Option[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
- val flags: FlagWord
- Attributes
- protected[State[N, E]]
- Definition Classes
- InnerNodeState
- val flagsExt: FlagWords
- Attributes
- protected[State[N, E]]
- Definition Classes
- InnerNodeState
- final def fold[N <: N, E[+X] <: EdgeLikeIn[X], G <: GraphBase[N, E], T](g: G)(fa: (GraphPredef.InnerNodeParam.fold.G.NodeT) => T, fb: (GraphBase.NodeT) => T): T
- Definition Classes
- InnerNodeParam
- def formatted(fmtstr: String): String
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def hasOnlyHooks: Boolean
- Definition Classes
- InnerNode → InnerNode
- final def hasPredecessor[U](potentialPredecessor: NodeT)(implicit visitor: (NodeT) => U): Boolean
- 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
- Definition Classes
- InnerNode → InnerNode
- final def hasSuccessor[U](potentialSuccessor: NodeT)(implicit visitor: (NodeT) => U): Boolean
- 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
- Definition Classes
- InnerNode → InnerNode
- def hashCode(): Int
- Definition Classes
- InnerNode → AnyRef → Any
- final def hook: Option[DefaultGraphImpl.EdgeT]
- Definition Classes
- InnerNode → InnerNode
- final def inDegree(nodeFilter: DefaultGraphImpl.NodeFilter, edgeFilter: DefaultGraphImpl.EdgeFilter, includeHooks: Boolean, ignoreMultiEdges: Boolean): Int
- Definition Classes
- InnerNode → InnerNode
- final def inDegree: Int
- Definition Classes
- InnerNode → InnerNode
- final def inNeighbors: Set[NodeT]
- Definition Classes
- InnerNode
- Annotations
- @inline()
- final def incoming: Set[DefaultGraphImpl.EdgeT] with FilterableSet[DefaultGraphImpl.EdgeT]
- Definition Classes
- InnerNode → InnerNode
- final def incomingFrom(from: NodeT): Set[DefaultGraphImpl.EdgeT] with FilterableSet[DefaultGraphImpl.EdgeT]
- Definition Classes
- InnerNode → InnerNode
- final def innerEdgeTraverser(implicit parameters: Parameters): DefaultGraphImpl.InnerEdgeTraverser
- Definition Classes
- TraverserInnerNode
- Annotations
- @inline()
- final def innerElemTraverser(implicit parameters: Parameters): DefaultGraphImpl.InnerElemTraverser
- Definition Classes
- TraverserInnerNode
- Annotations
- @inline()
- final def innerNodeDownUpTraverser(implicit parameters: Parameters): DefaultGraphImpl.InnerNodeDownUpTraverser
- Definition Classes
- TraverserInnerNode
- Annotations
- @inline()
- final def innerNodeTraverser(implicit parameters: Parameters): DefaultGraphImpl.InnerNodeTraverser
- Definition Classes
- TraverserInnerNode
- Annotations
- @inline()
- final def isConnectedWith[U](potentialConnected: NodeT)(implicit visitor: (NodeT) => U): Boolean
- 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[+X] <: EdgeLikeIn[X]](g: GraphBase[N, E]): Boolean
- Definition Classes
- NodeBase → InnerNodeParam
- def isDefined: Boolean
- Definition Classes
- Param
- final def isDirectPredecessorOf(that: NodeT): Boolean
- Definition Classes
- InnerNode → InnerNode
- final def isEdge: Boolean
- Definition Classes
- Param
- def isIn: Boolean
- Definition Classes
- OutParam → Param
- final def isIndependentOf(that: NodeT): Boolean
- Definition Classes
- InnerNode → InnerNode
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def isIsolated: Boolean
- Definition Classes
- InnerNode
- Annotations
- @inline()
- final def isLeaf: Boolean
- Definition Classes
- InnerNode
- Annotations
- @inline()
- def isNode: Boolean
- Definition Classes
- NodeParam
- final def isOut: Boolean
- Definition Classes
- Param
- final def isPredecessorOf[U](potentialSuccessor: NodeT)(implicit visitor: (NodeT) => U): Boolean
- 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): Boolean
- 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()
- val n1: NodeBase
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def neighbors: Set[NodeT]
- Definition Classes
- InnerNode → InnerNode
- final def nodeEqThis: (NodeT) => Boolean
- Attributes
- protected
- Definition Classes
- InnerNode
- 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.NodeFilter, edgeFilter: DefaultGraphImpl.EdgeFilter, includeHooks: Boolean, ignoreMultiEdges: Boolean): Int
- Definition Classes
- InnerNode → InnerNode
- final def outDegree: Int
- Definition Classes
- InnerNode → InnerNode
- final def outNeighbors: Set[NodeT]
- Definition Classes
- InnerNode
- Annotations
- @inline()
- final def outerEdgeTraverser(implicit parameters: Parameters): DefaultGraphImpl.OuterEdgeTraverser
- Definition Classes
- TraverserInnerNode
- Annotations
- @inline()
- final def outerElemTraverser(implicit parameters: Parameters): DefaultGraphImpl.OuterElemTraverser
- Definition Classes
- TraverserInnerNode
- Annotations
- @inline()
- final def outerNodeDownUpTraverser(implicit parameters: Parameters): DefaultGraphImpl.OuterNodeDownUpTraverser
- Definition Classes
- TraverserInnerNode
- Annotations
- @inline()
- final def outerNodeTraverser(implicit parameters: Parameters): DefaultGraphImpl.OuterNodeTraverser
- Definition Classes
- TraverserInnerNode
- Annotations
- @inline()
- final def outgoing: Set[DefaultGraphImpl.EdgeT] with FilterableSet[DefaultGraphImpl.EdgeT]
- Definition Classes
- InnerNode → InnerNode
- final def outgoingTo(to: NodeT): Set[DefaultGraphImpl.EdgeT] with FilterableSet[DefaultGraphImpl.EdgeT]
- Definition Classes
- InnerNode → InnerNode
- def partOfCycle[U](implicit visitor: (NodeT) => U): Option[DefaultGraphImpl.Cycle]
- 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): Option[DefaultGraphImpl.Path]
- 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.NodeFilter)(implicit visitor: (NodeT) => U): Option[DefaultGraphImpl.Path]
- 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 pipe[B](f: (NodeBase) => B): B
- Implicit
- This member is added by an implicit conversion from NodeBase toChainingOps[NodeBase] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- def productElementNames: Iterator[String]
- 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
- val self: NodeBase
- Implicit
- This member is added by an implicit conversion from NodeBase toChainingOps[NodeBase] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- final def shortestPathTo[T](potentialSuccessor: NodeT, weight: (DefaultGraphImpl.EdgeT) => T)(implicit arg0: Numeric[T]): Option[DefaultGraphImpl.Path]
- 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): Option[DefaultGraphImpl.Path]
- 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]
- 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 stringPrefix: String
- Definition Classes
- NodeParam
- def strongComponents[U](implicit visitor: (NodeT) => U): Iterable[DefaultGraphImpl.Component]
- 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
- def tap[U](f: (NodeBase) => U): NodeBase
- Implicit
- This member is added by an implicit conversion from NodeBase toChainingOps[NodeBase] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- 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
- final def toNodeT[N <: N, E[+X] <: EdgeLikeIn[X], G <: GraphBase[N, E]](g: G)(f: (GraphBase.NodeT) => GraphPredef.InnerNodeParam.toNodeT.G.NodeT): GraphPredef.InnerNodeParam.toNodeT.G.NodeT
- Definition Classes
- InnerNodeParam
- final def toOuter: N
- Definition Classes
- InnerNode
- Annotations
- @inline()
- def toString(): String
- Definition Classes
- NodeParam → AnyRef → Any
- def topologicalSort[U](ignorePredecessors: Boolean)(implicit visitor: (DefaultGraphImpl.InnerElem) => U): DefaultGraphImpl.CycleNodeOrTopologicalOrder
- 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 value: N
- Definition Classes
- NodeBase → InnerNode → NodeParam
- final def visited(implicit handle: Handle): Boolean
- Attributes
- protected[collection]
- Definition Classes
- InnerNodeState
- Annotations
- @inline()
- final def visited_=(visited: Boolean)(implicit handle: Handle): Unit
- 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): DefaultGraphImpl.Component
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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.NodeFilter, edges: DefaultGraphImpl.EdgeFilter): DefaultGraphImpl.InnerNodeTraverser
- 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 ~: ExtSet[DefaultGraphImpl.EdgeT]
- Definition Classes
- InnerNode
- Annotations
- @inline()
- final def ~>(to: NodeT): Set[DefaultGraphImpl.EdgeT] with FilterableSet[DefaultGraphImpl.EdgeT]
- Definition Classes
- InnerNode
- Annotations
- @inline()
- final def ~>: Set[DefaultGraphImpl.EdgeT] with FilterableSet[DefaultGraphImpl.EdgeT]
- Definition Classes
- InnerNode
- Annotations
- @inline()
- final def ~>?(to: NodeT): Option[DefaultGraphImpl.EdgeT]
- Definition Classes
- InnerNode
- Annotations
- @inline()
- final def ~>|: Set[NodeT]
- Definition Classes
- InnerNode
- Annotations
- @inline()
- final def ~|: Set[NodeT]
- Definition Classes
- InnerNode
- Annotations
- @inline()
Shadowed Implicit Value Members
- def isDefined: Boolean
- Implicit
- This member is added by an implicit conversion from NodeBase toOuterNode[NodeBase] 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:(nodeBase: OuterNode[NodeBase]).isDefined
- Definition Classes
- Param
- final def isEdge: Boolean
- Implicit
- This member is added by an implicit conversion from NodeBase toOuterNode[NodeBase] 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:(nodeBase: OuterNode[NodeBase]).isEdge
- Definition Classes
- Param
- def isIn: Boolean
- Implicit
- This member is added by an implicit conversion from NodeBase toOuterNode[NodeBase] 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:(nodeBase: OuterNode[NodeBase]).isIn
- Definition Classes
- InParam → Param
- def isNode: Boolean
- Implicit
- This member is added by an implicit conversion from NodeBase toOuterNode[NodeBase] 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:(nodeBase: OuterNode[NodeBase]).isNode
- Definition Classes
- NodeParam
- final def isOut: Boolean
- Implicit
- This member is added by an implicit conversion from NodeBase toOuterNode[NodeBase] 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:(nodeBase: OuterNode[NodeBase]).isOut
- Definition Classes
- Param
- def stringPrefix: String
- Implicit
- This member is added by an implicit conversion from NodeBase toOuterNode[NodeBase] 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:(nodeBase: OuterNode[NodeBase]).stringPrefix
- Definition Classes
- NodeParam
- def toString(): String
- Implicit
- This member is added by an implicit conversion from NodeBase toOuterNode[NodeBase] 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:(nodeBase: OuterNode[NodeBase]).toString()
- Definition Classes
- NodeParam → AnyRef → Any
- val value: NodeBase
- Implicit
- This member is added by an implicit conversion from NodeBase toOuterNode[NodeBase] 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:(nodeBase: OuterNode[NodeBase]).value
- Definition Classes
- OuterNode → NodeParam
- def ~[N >: N1](n2: N): UnDiEdge[N]
- Implicit
- This member is added by an implicit conversion from NodeBase toEdgeAssoc[NodeBase] 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:(nodeBase: EdgeAssoc[NodeBase]).~(n2)
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
- def ~>[N >: N1](n2: N): DiEdge[N]
- Implicit
- This member is added by an implicit conversion from NodeBase toEdgeAssoc[NodeBase] 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:(nodeBase: EdgeAssoc[NodeBase]).~>(n2)
- Definition Classes
- EdgeAssoc
- Annotations
- @inline()
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated @deprecated
- Deprecated
(Since version ) see corresponding Javadoc for more information.
- 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.