scalax.collection.constrained.mutable.DefaultGraphImpl

NodeBase

class NodeBase extends InnerNodeImpl with InnerNodeTraversalImpl

Attributes
protected
Definition Classes
DefaultGraphImpl → GraphLike → GraphBase
Annotations
@SerialVersionUID( 8082L )
Linear Supertypes
DefaultGraphImpl.InnerNodeTraversalImpl, DefaultGraphImpl.InnerNodeImpl, DefaultGraphImpl.InnerNodeLike, DefaultGraphImpl.InnerNodeLike, DefaultGraphImpl.InnerNodeOps, DefaultGraphImpl.NodeBase, DefaultGraphImpl.InnerNodeLike, DefaultGraphImpl.InnerNodeLike, DefaultGraphImpl.NodeBase, DefaultGraphImpl.InnerNodeLike, DefaultGraphImpl.Node, Serializable, Serializable, NodeOut[N], GraphParamNode[N], GraphParamOut[N, Nothing], GraphParam[N, Nothing], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. NodeBase
  2. InnerNodeTraversalImpl
  3. InnerNodeImpl
  4. InnerNodeLike
  5. InnerNodeLike
  6. InnerNodeOps
  7. NodeBase
  8. InnerNodeLike
  9. InnerNodeLike
  10. NodeBase
  11. InnerNodeLike
  12. Node
  13. Serializable
  14. Serializable
  15. NodeOut
  16. GraphParamNode
  17. GraphParamOut
  18. GraphParam
  19. AnyRef
  20. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

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

Value Members

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

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

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

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

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

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

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

    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

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

    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

    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

    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

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

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

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  14. final def <~: Set[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

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

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

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

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  17. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

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

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

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

    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeLike

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

    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeLike

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

    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeLike

  23. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

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

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

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

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

  26. def canEqual(that: Any): Boolean

    Definition Classes
    InnerNodeLike

  27. final def clear(dirtyFlags: DefaultGraphImpl.StateFlags): Unit

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

  28. def clone(): AnyRef

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

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

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

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

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

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

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

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

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

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

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

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

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

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

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

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

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()

  37. def containingGraph: DefaultGraphImpl.ThisGraph

    Definition Classes
    InnerNodeLike

  38. def degree: Int

    Definition Classes
    InnerNodeLike

  39. def diPredecessors: Set[NodeT]

    Definition Classes
    InnerNodeLike

  40. def diSuccessors: Set[NodeT]

    Definition Classes
    InnerNodeLike

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

    Definition Classes
    InnerNodeImpl → InnerNodeLike → InnerNodeLike

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

    Definition Classes
    AnyRef

  43. def equals(other: Any): Boolean

    Definition Classes
    InnerNodeLike → AnyRef → Any

  44. def finalize(): Unit

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

  45. def findConnected(pred: (NodeT) ⇒ Boolean, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, ordering: DefaultGraphImpl.ElemOrdering): Option[NodeT]

    Definition Classes
    InnerNodeTraversalImpl → InnerNodeLike

  46. def findCycle(nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, maxDepth: Int, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, ordering: DefaultGraphImpl.ElemOrdering): Option[DefaultGraphImpl.Cycle]

    Definition Classes
    InnerNodeTraversalImpl → InnerNodeLike

  47. final def findCycle: Option[DefaultGraphImpl.Cycle]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

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

    Definition Classes
    InnerNodeLike

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

    Definition Classes
    InnerNodeLike

  50. def findPredecessor(pred: (NodeT) ⇒ Boolean, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, ordering: DefaultGraphImpl.ElemOrdering): Option[NodeT]

    Definition Classes
    InnerNodeTraversalImpl → InnerNodeLike

  51. def findSuccessor(pred: (NodeT) ⇒ Boolean, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, ordering: DefaultGraphImpl.ElemOrdering): Option[NodeT]

    Definition Classes
    InnerNodeTraversalImpl → InnerNodeLike

  52. var flags: DefaultGraphImpl.StateFlags

    Definition Classes
    InnerNodeTraversalImpl

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

    Definition Classes
    AnyRef → Any

  54. def hasOnlyHooks: Boolean

    Definition Classes
    InnerNodeLike

  55. final def hasPredecessor(potentialPredecessor: NodeT, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, ordering: DefaultGraphImpl.ElemOrdering): Boolean

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  56. final def hasSuccessor(potentialSuccessor: NodeT, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, ordering: DefaultGraphImpl.ElemOrdering): Boolean

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  57. def hashCode(): Int

    Definition Classes
    InnerNodeLike → AnyRef → Any

  58. def inDegree: Int

    Definition Classes
    InnerNodeLike

  59. final def inNeighbors: Set[NodeT]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  60. def incoming: Set[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNodeLike

  61. def incomingFrom(from: NodeT): Set[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNodeLike

  62. final def isConnectedWith(potentialConnected: NodeT, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, ordering: DefaultGraphImpl.ElemOrdering): Boolean

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  63. def isDirectPredecessorOf(that: NodeT): Boolean

    Definition Classes
    InnerNodeLike

  64. def isEdge: Boolean

    Definition Classes
    GraphParamNode

  65. def isIn: Boolean

    Definition Classes
    GraphParamOut → GraphParam

  66. def isIndependentOf(that: NodeT): Boolean

    Definition Classes
    InnerNodeLike

  67. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  68. final def isIsolated: Boolean

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  69. final def isLeaf: Boolean

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  70. def isNode: Boolean

    Definition Classes
    GraphParamNode

  71. def isOut: Boolean

    Definition Classes
    GraphParamOut → GraphParam

  72. final def isPredecessorOf(potentialSuccessor: NodeT, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, ordering: DefaultGraphImpl.ElemOrdering): Boolean

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  73. final def isSuccessorOf(potentialPredecessor: NodeT, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, ordering: DefaultGraphImpl.ElemOrdering): Boolean

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

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

    Definition Classes
    AnyRef

  75. def neighbors: Set[NodeT]

    Definition Classes
    InnerNodeLike

  76. final def notify(): Unit

    Definition Classes
    AnyRef

  77. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  78. def outDegree: Int

    Definition Classes
    InnerNodeLike

  79. final def outNeighbors: Set[NodeT]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  80. def outgoing: Set[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNodeLike

  81. def outgoingTo(to: NodeT): Set[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNodeLike

  82. final def pathTo(potentialSuccessor: NodeT, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, ordering: DefaultGraphImpl.ElemOrdering): Option[DefaultGraphImpl.Path]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  83. final def pathTo(potentialSuccessor: NodeT): Option[DefaultGraphImpl.Path]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  84. def pathUntil(pred: (NodeT) ⇒ Boolean, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, ordering: DefaultGraphImpl.ElemOrdering): Option[DefaultGraphImpl.Path]

    Definition Classes
    InnerNodeTraversalImpl → InnerNodeLike

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

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

  86. def shortestPathTo(to: NodeT, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, ordering: DefaultGraphImpl.ElemOrdering): Option[DefaultGraphImpl.Path]

    Definition Classes
    InnerNodeTraversalImpl → InnerNodeLike

  87. def stringPrefix: String

    Definition Classes
    GraphParamNode

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

    Definition Classes
    AnyRef

  89. def toString(): String

    Definition Classes
    GraphParamNode → AnyRef → Any

  90. final def traverse(direction: Direction, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, breadthFirst: Boolean, maxDepth: Int, ordering: DefaultGraphImpl.ElemOrdering)(nodeVisitor: (NodeT) ⇒ VisitorReturn, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit): Unit

    Definition Classes
    InnerNodeTraversalImpl → InnerNodeLike

  91. final def traverseDownUp(direction: Direction, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit, maxDepth: Int, ordering: DefaultGraphImpl.ElemOrdering)(nodeDown: (NodeT) ⇒ VisitorReturn, nodeUp: (NodeT) ⇒ Unit): Option[NodeT]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  92. final def traverseEdges(direction: Direction, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, breadthFirst: Boolean, maxDepth: Int, ordering: DefaultGraphImpl.ElemOrdering)(edgeVisitor: (DefaultGraphImpl.EdgeT) ⇒ Unit): Unit

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  93. final def traverseNodes(direction: Direction, nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (DefaultGraphImpl.EdgeT) ⇒ Boolean, breadthFirst: Boolean, maxDepth: Int, ordering: DefaultGraphImpl.ElemOrdering)(nodeVisitor: (NodeT) ⇒ VisitorReturn): Unit

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

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

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

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

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

  96. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    AnyRef
    Annotations
    @throws()

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

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

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

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  101. final def ~>: Set[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

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

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

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

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

  104. final def ~|: Set[NodeT]

    Definition Classes
    InnerNodeLike
    Annotations
    @inline()

Inherited from DefaultGraphImpl.InnerNodeTraversalImpl

Inherited from DefaultGraphImpl.InnerNodeImpl

Inherited from DefaultGraphImpl.InnerNodeLike

Inherited from DefaultGraphImpl.InnerNodeLike

Inherited from DefaultGraphImpl.InnerNodeOps

Inherited from DefaultGraphImpl.NodeBase

Inherited from DefaultGraphImpl.InnerNodeLike

Inherited from DefaultGraphImpl.InnerNodeLike

Inherited from DefaultGraphImpl.NodeBase

Inherited from DefaultGraphImpl.InnerNodeLike

Inherited from DefaultGraphImpl.Node

Inherited from Serializable

Inherited from Serializable

Inherited from NodeOut[N]

Inherited from GraphParamNode[N]

Inherited from GraphParamOut[N, Nothing]

Inherited from GraphParam[N, Nothing]

Inherited from AnyRef

Inherited from Any

Ungrouped