Class

scalax.collection.constrained.mutable.DefaultGraphImpl

NodeBase

Related Doc: package DefaultGraphImpl

Permalink

class NodeBase extends InnerNodeImpl with InnerNodeTraversalImpl

Attributes
protected
Annotations
@SerialVersionUID()
Linear Supertypes
DefaultGraphImpl.InnerNodeTraversalImpl, DefaultGraphImpl.InnerNodeState, DefaultGraphImpl.InnerNodeImpl, DefaultGraphImpl.InnerNode, DefaultGraphImpl.InnerNode, DefaultGraphImpl.InnerNodeOps, DefaultGraphImpl.NodeBase, DefaultGraphImpl.InnerNode, DefaultGraphImpl.TraverserInnerNode, DefaultGraphImpl.NodeBase, DefaultGraphImpl.InnerNode, DefaultGraphImpl.InnerElem, DefaultGraphImpl.Node, Serializable, Serializable, InnerNodeParam[N], NodeParam[N], OutParam[N, Nothing], Param[N, Nothing], AnyRef, Any
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NodeBase
  2. InnerNodeTraversalImpl
  3. InnerNodeState
  4. InnerNodeImpl
  5. InnerNode
  6. InnerNode
  7. InnerNodeOps
  8. NodeBase
  9. InnerNode
  10. TraverserInnerNode
  11. NodeBase
  12. InnerNode
  13. InnerElem
  14. Node
  15. Serializable
  16. Serializable
  17. InnerNodeParam
  18. NodeParam
  19. OutParam
  20. Param
  21. AnyRef
  22. Any
Implicitly
  1. by anyToNode
  2. by toDefaultTraverser
  3. by EdgeAssoc
  4. by CollectionsHaveToParArray
  5. by toValue
  6. by any2stringadd
  7. by StringFormat
  8. by Ensuring
  9. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new NodeBase(value: N, hints: Hints)

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. def +(other: String): String

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

  4. final def +=(edge: DefaultGraphImpl.EdgeT): NodeBase.this.type

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNode
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

  9. 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): DefaultGraphImpl.EdgeT

    Permalink
    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

  13. def ->[B](y: B): (NodeBase, B)

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to ArrowAssoc[NodeBase] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    InnerNode
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    InnerNode
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    InnerNode
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    InnerNode
    Annotations
    @inline()

  18. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  19. final def add(edge: DefaultGraphImpl.EdgeT): Boolean

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeImpl → InnerNode

  20. final def addDiPredecessors(edge: DefaultGraphImpl.EdgeT, add: (NodeT) ⇒ Unit): Unit

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNode → InnerNode

  21. final def addDiSuccOrHook(edge: DefaultGraphImpl.EdgeT): Unit

    Permalink
    Attributes
    protected
    Definition Classes
    InnerNodeImpl

  22. final def addDiSuccessors(edge: DefaultGraphImpl.EdgeT, add: (NodeT) ⇒ Unit): Unit

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNode → InnerNode

  23. final def addNeighbors(edge: DefaultGraphImpl.EdgeT, add: (NodeT) ⇒ Unit): Unit

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNode → InnerNode

  24. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

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

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeParam

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

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeParam

  27. final def bit[T](implicit handle: Handle): Boolean

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeState
    Annotations
    @inline()

  28. final def bit_=[T](isSet: Boolean)(implicit handle: Handle): Unit

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeState
    Annotations
    @inline()

  29. def canEqual(that: Any): Boolean

    Permalink
    Definition Classes
    InnerNode

  30. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

  35. 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): DefaultGraphImpl.EdgeT

    Permalink
    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

  37. 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): DefaultGraphImpl.EdgeT

    Permalink
    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

  39. final def connectionsWith(other: NodeT): FilteredSet[DefaultGraphImpl.EdgeT]

    Permalink
    Definition Classes
    InnerNode → InnerNode

  40. final def containingGraph: DefaultGraphImpl.ThisGraph

    Permalink
    Definition Classes
    InnerNode

  41. final def degree: Int

    Permalink
    Definition Classes
    InnerNode → InnerNode

  42. final def diPredecessors: Set[NodeT]

    Permalink
    Definition Classes
    InnerNode → InnerNode

  43. final def diSuccessors: Set[NodeT]

    Permalink
    Definition Classes
    InnerNodeImpl → InnerNode

  44. def dumpState: Array[Long]

    Permalink
    Definition Classes
    InnerNodeState

  45. final val edges: ArraySet[DefaultGraphImpl.EdgeT]

    Permalink
    Definition Classes
    InnerNodeImpl → InnerNode → InnerNode

  46. def ensuring(cond: (NodeBase) ⇒ Boolean, msg: ⇒ Any): NodeBase

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

  47. def ensuring(cond: (NodeBase) ⇒ Boolean): NodeBase

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

  48. def ensuring(cond: Boolean, msg: ⇒ Any): NodeBase

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

  49. def ensuring(cond: Boolean): NodeBase

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

  50. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  51. def equals(other: Any): Boolean

    Permalink
    Definition Classes
    InnerNode → AnyRef → Any

  52. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  53. final def findConnected[U](pred: DefaultGraphImpl.NodeFilter)(implicit visitor: (NodeT) ⇒ U): Option[NodeT]

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods

  54. def findCycle[U](implicit visitor: (NodeT) ⇒ U): Option[DefaultGraphImpl.Cycle]

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods

  55. final def findIncomingFrom(from: NodeT): Option[DefaultGraphImpl.EdgeT]

    Permalink
    Definition Classes
    InnerNode → InnerNode

  56. final def findOutgoingTo(to: NodeT): Option[DefaultGraphImpl.EdgeT]

    Permalink
    Definition Classes
    InnerNode → InnerNode

  57. final def findPredecessor[U](pred: DefaultGraphImpl.NodeFilter)(implicit visitor: (NodeT) ⇒ U): Option[NodeT]

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods

  58. final def findSuccessor[U](pred: DefaultGraphImpl.NodeFilter)(implicit visitor: (NodeT) ⇒ U): Option[NodeT]

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods

  59. var flags: FlagWord

    Permalink
    Attributes
    protected[scalax.collection.State]
    Definition Classes
    InnerNodeState

  60. var flagsExt: FlagWords

    Permalink
    Attributes
    protected[scalax.collection.State]
    Definition Classes
    InnerNodeState

  61. 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

    Permalink
    Definition Classes
    InnerNodeParam

  62. def formatted(fmtstr: String): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to StringFormat[NodeBase] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()

  63. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  64. final def hasOnlyHooks: Boolean

    Permalink
    Definition Classes
    InnerNode → InnerNode

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

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

  66. final def hasPredecessors: Boolean

    Permalink
    Definition Classes
    InnerNode → InnerNode

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

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

  68. final def hasSuccessors: Boolean

    Permalink
    Definition Classes
    InnerNode → InnerNode

  69. def hashCode(): Int

    Permalink
    Definition Classes
    InnerNode → AnyRef → Any

  70. final def inDegree(nodeFilter: DefaultGraphImpl.NodeFilter, edgeFilter: DefaultGraphImpl.EdgeFilter, includeHooks: Boolean, ignoreMultiEdges: Boolean): Int

    Permalink
    Definition Classes
    InnerNode → InnerNode

  71. final def inDegree: Int

    Permalink
    Definition Classes
    InnerNode → InnerNode

  72. final def inNeighbors: Set[NodeT]

    Permalink
    Definition Classes
    InnerNode
    Annotations
    @inline()

  73. final def incoming: FilteredSet[DefaultGraphImpl.EdgeT]

    Permalink
    Definition Classes
    InnerNode → InnerNode

  74. final def incomingFrom(from: NodeT): FilteredSet[DefaultGraphImpl.EdgeT]

    Permalink
    Definition Classes
    InnerNode → InnerNode

  75. final def innerEdgeTraverser(implicit parameters: Parameters): DefaultGraphImpl.InnerEdgeTraverser

    Permalink
    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()

  76. final def innerElemTraverser(implicit parameters: Parameters): DefaultGraphImpl.InnerElemTraverser

    Permalink
    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()

  77. final def innerNodeDownUpTraverser(implicit parameters: Parameters): DefaultGraphImpl.InnerNodeDownUpTraverser

    Permalink
    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()

  78. final def innerNodeTraverser(implicit parameters: Parameters): DefaultGraphImpl.InnerNodeTraverser

    Permalink
    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()

  79. final def isConnectedWith[U](potentialConnected: NodeT)(implicit visitor: (NodeT) ⇒ U): Boolean

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

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

    Permalink
    Definition Classes
    NodeBase → InnerNodeParam

  81. def isDefined: Boolean

    Permalink
    Definition Classes
    Param

  82. final def isDirectPredecessorOf(that: NodeT): Boolean

    Permalink
    Definition Classes
    InnerNode → InnerNode

  83. def isEdge: Boolean

    Permalink
    Definition Classes
    NodeParam

  84. def isIn: Boolean

    Permalink
    Definition Classes
    OutParam → Param

  85. final def isIndependentOf(that: NodeT): Boolean

    Permalink
    Definition Classes
    InnerNode → InnerNode

  86. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  87. final def isIsolated: Boolean

    Permalink
    Definition Classes
    InnerNode
    Annotations
    @inline()

  88. final def isLeaf: Boolean

    Permalink
    Definition Classes
    InnerNode
    Annotations
    @inline()

  89. def isNode: Boolean

    Permalink
    Definition Classes
    NodeParam

  90. def isOut: Boolean

    Permalink
    Definition Classes
    OutParam → Param

  91. final def isPredecessorOf[U](potentialSuccessor: NodeT)(implicit visitor: (NodeT) ⇒ U): Boolean

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

  92. final def isSuccessorOf[U](potentialPredecessor: NodeT)(implicit visitor: (NodeT) ⇒ U): Boolean

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

  93. val n1: NodeBase

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to EdgeAssoc[NodeBase] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc

  94. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  95. final def neighbors: Set[NodeT]

    Permalink
    Definition Classes
    InnerNode → InnerNode

  96. final def nodeEqThis: (NodeT) ⇒ Boolean

    Permalink
    Attributes
    protected
    Definition Classes
    InnerNode
    Annotations
    @inline()

  97. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  98. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  99. final def outDegree(nodeFilter: DefaultGraphImpl.NodeFilter, edgeFilter: DefaultGraphImpl.EdgeFilter, includeHooks: Boolean, ignoreMultiEdges: Boolean): Int

    Permalink
    Definition Classes
    InnerNode → InnerNode

  100. final def outDegree: Int

    Permalink
    Definition Classes
    InnerNode → InnerNode

  101. final def outNeighbors: Set[NodeT]

    Permalink
    Definition Classes
    InnerNode
    Annotations
    @inline()

  102. final def outerEdgeTraverser(implicit parameters: Parameters): DefaultGraphImpl.OuterEdgeTraverser

    Permalink
    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()

  103. final def outerElemTraverser(implicit parameters: Parameters): DefaultGraphImpl.OuterElemTraverser

    Permalink
    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()

  104. final def outerNodeDownUpTraverser(implicit parameters: Parameters): DefaultGraphImpl.OuterNodeDownUpTraverser

    Permalink
    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()

  105. final def outerNodeTraverser(implicit parameters: Parameters): DefaultGraphImpl.OuterNodeTraverser

    Permalink
    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()

  106. final def outgoing: FilteredSet[DefaultGraphImpl.EdgeT]

    Permalink
    Definition Classes
    InnerNode → InnerNode

  107. final def outgoingTo(to: NodeT): FilteredSet[DefaultGraphImpl.EdgeT]

    Permalink
    Definition Classes
    InnerNode → InnerNode

  108. final def pathTo[U](potentialSuccessor: NodeT)(implicit visitor: (NodeT) ⇒ U): Option[DefaultGraphImpl.Path]

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods

  109. def pathUntil[U](pred: DefaultGraphImpl.NodeFilter)(implicit visitor: (NodeT) ⇒ U): Option[DefaultGraphImpl.Path]

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods

  110. def remove(edge: DefaultGraphImpl.EdgeT): Boolean

    Permalink
    Attributes
    protected[scalax.collection.mutable.AdjacencyListGraph]
    Definition Classes
    InnerNodeImpl

  111. def root: NodeT

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods

  112. final def shortestPathTo[T](potentialSuccessor: NodeT, weight: (DefaultGraphImpl.EdgeT) ⇒ T)(implicit arg0: Numeric[T]): Option[DefaultGraphImpl.Path]

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

  113. final def shortestPathTo[U](potentialSuccessor: NodeT)(implicit visitor: (NodeT) ⇒ U): Option[DefaultGraphImpl.Path]

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

  114. def shortestPathTo[T, U](potentialSuccessor: NodeT, weight: (DefaultGraphImpl.EdgeT) ⇒ T, visitor: (NodeT) ⇒ U)(implicit arg0: Numeric[T]): Option[DefaultGraphImpl.Path]

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods

  115. def stringPrefix: String

    Permalink
    Definition Classes
    NodeParam

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

    Permalink
    Definition Classes
    AnyRef

  117. final def toInnerElemTraverser(root: NodeT): DefaultGraphImpl.InnerElemTraverser

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties

  118. 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

    Permalink
    Definition Classes
    InnerNodeParam

  119. final def toOuter: N

    Permalink
    Definition Classes
    InnerNode
    Annotations
    @inline()

  120. def toParArray: ParArray[T]

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

  121. def toString(): String

    Permalink
    Definition Classes
    NodeParam → AnyRef → Any

  122. def topologicalSort[U](ignorePredecessors: Boolean)(implicit visitor: (DefaultGraphImpl.InnerElem) ⇒ U): DefaultGraphImpl.CycleNodeOrTopologicalOrder

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods

  123. def upsert(edge: DefaultGraphImpl.EdgeT): Boolean

    Permalink
    Attributes
    protected[scalax.collection.mutable.AdjacencyListGraph]
    Definition Classes
    InnerNodeImpl

  124. val value: N

    Permalink
    Definition Classes
    NodeBase → InnerNode → NodeParam

  125. final def visited(implicit handle: Handle): Boolean

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeState
    Annotations
    @inline()

  126. final def visited_=(visited: Boolean)(implicit handle: Handle): Unit

    Permalink
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeState
    Annotations
    @inline()

  127. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  129. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  130. final def withDirection(direction: Direction): DefaultGraphImpl.InnerNodeTraverser

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties

  131. final def withFlagsExt[T](block: (ExtBitSet) ⇒ T): T

    Permalink
    Attributes
    protected
    Definition Classes
    InnerNodeState
    Annotations
    @inline()

  132. final def withKind(kind: Kind): DefaultGraphImpl.InnerNodeTraverser

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties

  133. final def withMaxDepth(maxDepth: Int): DefaultGraphImpl.InnerNodeTraverser

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties

  134. final def withMaxWeight(max: Long): DefaultGraphImpl.InnerNodeTraverser

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties

  135. final def withMaxWeight[W](max: W, edgeWeight: (DefaultGraphImpl.EdgeT) ⇒ W)(implicit arg0: Numeric[W]): DefaultGraphImpl.InnerNodeTraverser

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties

  136. def withMaxWeight(maxWeight: Option[DefaultGraphImpl.Weight]): DefaultGraphImpl.InnerNodeTraverser

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties

  137. final def withOrdering(ordering: DefaultGraphImpl.ElemOrdering): DefaultGraphImpl.InnerNodeTraverser

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties

  138. final def withParameters(parameters: Parameters): DefaultGraphImpl.InnerNodeTraverser

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties

  139. final def withRoot(root: NodeT): DefaultGraphImpl.InnerNodeTraverser

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods

  140. final def withSubgraph(nodes: DefaultGraphImpl.NodeFilter, edges: DefaultGraphImpl.EdgeFilter): DefaultGraphImpl.InnerNodeTraverser

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to DefaultGraphImpl.TraverserMethods[NodeT, DefaultGraphImpl.InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties

  141. final def ~: ExtSet[DefaultGraphImpl.EdgeT]

    Permalink
    Definition Classes
    InnerNode
    Annotations
    @inline()

  142. final def ~>(to: NodeT): Set[DefaultGraphImpl.EdgeT] with FilterableSet[DefaultGraphImpl.EdgeT]

    Permalink
    Definition Classes
    InnerNode
    Annotations
    @inline()

  143. final def ~>: Set[DefaultGraphImpl.EdgeT] with FilterableSet[DefaultGraphImpl.EdgeT]

    Permalink
    Definition Classes
    InnerNode
    Annotations
    @inline()

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

    Permalink
    Definition Classes
    InnerNode
    Annotations
    @inline()

  145. final def ~>|: Set[NodeT]

    Permalink
    Definition Classes
    InnerNode
    Annotations
    @inline()

  146. final def ~|: Set[NodeT]

    Permalink
    Definition Classes
    InnerNode
    Annotations
    @inline()

  147. def →[B](y: B): (NodeBase, B)

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

Shadowed Implicit Value Members

  1. def isDefined: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to OuterNode[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

  2. def isEdge: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to OuterNode[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
    NodeParam

  3. def isIn: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to OuterNode[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

  4. def isNode: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to OuterNode[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

  5. def isOut: Boolean

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to OuterNode[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
    InParam → Param

  6. def stringPrefix: String

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to OuterNode[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

  7. def toString(): String

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to OuterNode[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

  8. val value: NodeBase

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to OuterNode[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

  9. def ~[N >: N1](n2: N): UnDiEdge[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to EdgeAssoc[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()

  10. def ~>[N >: N1](n2: N): DiEdge[N]

    Permalink
    Implicit information
    This member is added by an implicit conversion from NodeBase to EdgeAssoc[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()

Inherited from DefaultGraphImpl.InnerNodeTraversalImpl

Inherited from DefaultGraphImpl.InnerNodeState

Inherited from DefaultGraphImpl.InnerNodeImpl

Inherited from DefaultGraphImpl.InnerNode

Inherited from DefaultGraphImpl.InnerNode

Inherited from DefaultGraphImpl.InnerNodeOps

Inherited from DefaultGraphImpl.NodeBase

Inherited from DefaultGraphImpl.InnerNode

Inherited from DefaultGraphImpl.TraverserInnerNode

Inherited from DefaultGraphImpl.NodeBase

Inherited from DefaultGraphImpl.InnerNode

Inherited from DefaultGraphImpl.InnerElem

Inherited from DefaultGraphImpl.Node

Inherited from Serializable

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 NodeBase to OuterNode[NodeBase]

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

Inherited by implicit conversion EdgeAssoc from NodeBase to EdgeAssoc[NodeBase]

Inherited by implicit conversion CollectionsHaveToParArray from NodeBase to CollectionsHaveToParArray[NodeBase, T]

Inherited by implicit conversion toValue from NodeBase to N

Inherited by implicit conversion any2stringadd from NodeBase to any2stringadd[NodeBase]

Inherited by implicit conversion StringFormat from NodeBase to StringFormat[NodeBase]

Inherited by implicit conversion Ensuring from NodeBase to Ensuring[NodeBase]

Inherited by implicit conversion ArrowAssoc from NodeBase to ArrowAssoc[NodeBase]

Ungrouped