scalax.collection.constrained.immutable.DefaultGraphImpl

NodeBase

final class NodeBase extends InnerNodeImpl with InnerNodeTraversalImpl

Attributes
protected
Definition Classes
DefaultGraphImpl → GraphLike → GraphBase
Annotations
@SerialVersionUID( 8081L )
Linear Supertypes
DefaultGraphImpl.InnerNodeTraversalImpl, DefaultGraphImpl.InnerNodeState, DefaultGraphImpl.InnerNodeImpl, DefaultGraphImpl.InnerNode, 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 Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. NodeBase
  2. InnerNodeTraversalImpl
  3. InnerNodeState
  4. InnerNodeImpl
  5. InnerNode
  6. NodeBase
  7. InnerNode
  8. TraverserInnerNode
  9. NodeBase
  10. InnerNode
  11. InnerElem
  12. Node
  13. Serializable
  14. Serializable
  15. InnerNodeParam
  16. NodeParam
  17. OutParam
  18. Param
  19. AnyRef
  20. Any
Implicitly
  1. by anyToNode
  2. by toDefaultTraverser
  3. by EdgeAssoc
  4. by toValue
  5. by any2stringadd
  6. by any2stringfmt
  7. by any2ArrowAssoc
  8. by any2Ensuring
  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. def +(other: String): String

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

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

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

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

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

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

    Definition Classes
    InnerNode
    Annotations
    @inline()

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

    Definition Classes
    InnerNode
    Annotations
    @inline()

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

    Definition Classes
    InnerNode
    Annotations
    @inline()

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

    Definition Classes
    InnerNode
    Annotations
    @inline()

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

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

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

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

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

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

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

  16. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

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

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

    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeParam

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

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

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

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

  21. def canEqual(that: Any): Boolean

    Definition Classes
    InnerNode

  22. def clone(): AnyRef

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

  23. final def connectionsWith(other: NodeT): ArraySet[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNode → InnerNode

  24. final def containingGraph: DefaultGraphImpl.ThisGraph

    Definition Classes
    InnerNode

  25. def degree: Int

    Definition Classes
    InnerNode

  26. final def diPredecessors: Set[NodeT]

    Definition Classes
    InnerNode → InnerNode

  27. final lazy val diSuccessors: Set[NodeT]

    Definition Classes
    InnerNodeImpl → InnerNode

  28. def dumpState: Array[Long]

    Definition Classes
    InnerNodeState

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

    Definition Classes
    InnerNodeImpl → InnerNode → InnerNode

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

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

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

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

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

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

  33. def ensuring(cond: Boolean): NodeBase

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

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

    Definition Classes
    AnyRef

  35. def equals(other: Any): Boolean

    Definition Classes
    InnerNode → AnyRef → Any

  36. def finalize(): Unit

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

  37. final def findConnected(pred: (NodeT) ⇒ Boolean)(implicit visitor: (NodeT) ⇒ Unit): Option[NodeT]

    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

  38. def findCycle(implicit visitor: (NodeT) ⇒ Unit): Option[DefaultGraphImpl.Cycle]

    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

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

    Definition Classes
    InnerNode → InnerNode

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

    Definition Classes
    InnerNode → InnerNode

  41. final def findPredecessor(pred: (NodeT) ⇒ Boolean)(implicit visitor: (NodeT) ⇒ Unit): Option[NodeT]

    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

  42. final def findSuccessor(pred: (NodeT) ⇒ Boolean)(implicit visitor: (NodeT) ⇒ Unit): Option[NodeT]

    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

  43. var flags: FlagWord

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

  44. var flagsExt: FlagWords

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

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

  46. def formatted(fmtstr: String): String

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

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

    Definition Classes
    AnyRef → Any

  48. final def hasOnlyHooks: Boolean

    Definition Classes
    InnerNode → InnerNode

  49. final def hasPredecessor(potentialPredecessor: NodeT)(implicit visitor: (NodeT) ⇒ Unit): Boolean

    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()

  50. final def hasSuccessor(potentialSuccessor: NodeT)(implicit visitor: (NodeT) ⇒ Unit): Boolean

    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()

  51. def hashCode(): Int

    Definition Classes
    InnerNode → AnyRef → Any

  52. def inDegree: Int

    Definition Classes
    InnerNode

  53. final def inNeighbors: Set[NodeT]

    Definition Classes
    InnerNode
    Annotations
    @inline()

  54. final def incoming: Set[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNode → InnerNode

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

    Definition Classes
    InnerNode → InnerNode

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

    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()

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

    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()

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

    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()

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

    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()

  60. final def isConnectedWith(potentialConnected: NodeT)(implicit visitor: (NodeT) ⇒ Unit): Boolean

    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()

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

    Definition Classes
    NodeBase → InnerNodeParam

  62. def isDefined: Boolean

    Definition Classes
    Param

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

    Definition Classes
    InnerNode → InnerNode

  64. def isEdge: Boolean

    Definition Classes
    NodeParam

  65. def isIn: Boolean

    Definition Classes
    OutParam → Param

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

    Definition Classes
    InnerNode → InnerNode

  67. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  68. final def isIsolated: Boolean

    Definition Classes
    InnerNode
    Annotations
    @inline()

  69. final def isLeaf: Boolean

    Definition Classes
    InnerNode
    Annotations
    @inline()

  70. def isNode: Boolean

    Definition Classes
    NodeParam

  71. def isOut: Boolean

    Definition Classes
    OutParam → Param

  72. final def isPredecessorOf(potentialSuccessor: NodeT)(implicit visitor: (NodeT) ⇒ Unit): Boolean

    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()

  73. final def isSuccessorOf(potentialPredecessor: NodeT)(implicit visitor: (NodeT) ⇒ Unit): Boolean

    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()

  74. val monitor: AnyRef

    Definition Classes
    InnerNodeState

  75. val n1: NodeBase

    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

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

    Definition Classes
    AnyRef

  77. final def neighbors: Set[NodeT]

    Definition Classes
    InnerNode → InnerNode

  78. final def nodeEqThis: (NodeT) ⇒ Boolean

    Attributes
    protected
    Definition Classes
    InnerNode
    Annotations
    @inline()

  79. final def notify(): Unit

    Definition Classes
    AnyRef

  80. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  81. def outDegree: Int

    Definition Classes
    InnerNode

  82. final def outNeighbors: Set[NodeT]

    Definition Classes
    InnerNode
    Annotations
    @inline()

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

    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()

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

    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()

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

    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()

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

    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()

  87. final def outgoing: Set[DefaultGraphImpl.EdgeT]

    Definition Classes
    InnerNode → InnerNode

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

    Definition Classes
    InnerNode → InnerNode

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

    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

  90. def pathUntil(pred: (NodeT) ⇒ Boolean)(implicit visitor: (NodeT) ⇒ Unit): Option[DefaultGraphImpl.Path]

    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

  91. def root: NodeT

    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

  92. def shortestPathTo(potentialSuccessor: NodeT)(implicit visitor: (NodeT) ⇒ Unit): Option[DefaultGraphImpl.Path]

    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

  93. def stringPrefix: String

    Definition Classes
    NodeParam

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

    Definition Classes
    AnyRef

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

    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

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

  97. def toString(): String

    Definition Classes
    NodeParam → AnyRef → Any

  98. val value: NodeBase

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

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

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

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

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

  101. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    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

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

    Attributes
    protected
    Definition Classes
    InnerNodeState
    Annotations
    @inline()

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

    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

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

    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

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

    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

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

    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

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

    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

  111. final def withSubgraph(nodes: (NodeT) ⇒ Boolean, edges: (DefaultGraphImpl.EdgeT) ⇒ Boolean): DefaultGraphImpl.InnerNodeTraverser

    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

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

    Definition Classes
    InnerNode
    Annotations
    @inline()

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

    Definition Classes
    InnerNode
    Annotations
    @inline()

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

    Definition Classes
    InnerNode
    Annotations
    @inline()

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

    Definition Classes
    InnerNode
    Annotations
    @inline()

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

    Definition Classes
    InnerNode
    Annotations
    @inline()

  117. final def ~|: Set[NodeT]

    Definition Classes
    InnerNode
    Annotations
    @inline()

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

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

Shadowed Implicit Value Members

  1. def isDefined: Boolean

    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

    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

    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

    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

    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. val self: Any

    Implicit information
    This member is added by an implicit conversion from NodeBase to StringAdd performed by method any2stringadd in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (nodeBase: StringAdd).self
    Definition Classes
    StringAdd

  7. val self: Any

    Implicit information
    This member is added by an implicit conversion from NodeBase to StringFormat performed by method any2stringfmt in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (nodeBase: StringFormat).self
    Definition Classes
    StringFormat

  8. def stringPrefix: String

    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

  9. def toString(): String

    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

  10. def ~[N >: N1, N2 <: N](n2: N2): UnDiEdge[N]

    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()

  11. def ~>[N >: N1, N2 <: N](n2: N2): DiEdge[N]

    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()

Deprecated Value Members

  1. 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): Option[NodeT]

    Definition Classes
    TraverserInnerNode
    Annotations
    @deprecated
    Deprecated

    (Since version 1.8.0) use innerElemTraverser or outerElemTraverser instead.

  2. 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
    TraverserInnerNode
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 1.8.0) use innerNodeDownUpTraverser or outerNodeDownUpTraverser instead.

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

    Definition Classes
    TraverserInnerNode
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 1.8.0) use innerEdgeTraverser or outerEdgeTraverser instead.

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

    Definition Classes
    TraverserInnerNode
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 1.8.0) use innerNodeTraverser or outerNodeTraverser instead.

  5. def x: NodeBase

    Implicit information
    This member is added by an implicit conversion from NodeBase to ArrowAssoc[NodeBase] performed by method any2ArrowAssoc in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (nodeBase: ArrowAssoc[NodeBase]).x
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use leftOfArrow instead

  6. def x: NodeBase

    Implicit information
    This member is added by an implicit conversion from NodeBase to Ensuring[NodeBase] performed by method any2Ensuring in scala.Predef.
    Shadowing
    This implicitly inherited member is ambiguous. One or more implicitly inherited members have similar signatures, so calling this member may produce an ambiguous implicit conversion compiler error.
    To access this member you can use a type ascription:
    (nodeBase: Ensuring[NodeBase]).x
    Definition Classes
    Ensuring
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use resultOfEnsuring instead

Inherited from DefaultGraphImpl.InnerNodeTraversalImpl

Inherited from DefaultGraphImpl.InnerNodeState

Inherited from DefaultGraphImpl.InnerNodeImpl

Inherited from DefaultGraphImpl.InnerNode

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 toValue from NodeBase to N

Inherited by implicit conversion any2stringadd from NodeBase to StringAdd

Inherited by implicit conversion any2stringfmt from NodeBase to StringFormat

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

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

Ungrouped