Packages

abstract class NodeBase extends InnerNode

Attributes
protected
Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. NodeBase
  2. InnerNode
  3. InnerElem
  4. Node
  5. Serializable
  6. Serializable
  7. InnerNodeParam
  8. NodeParam
  9. OutParam
  10. Param
  11. AnyRef
  12. Any
Implicitly
  1. by anyToNode
  2. by EdgeAssoc
  3. by ChainingOps
  4. by CollectionsHaveToParArray
  5. by any2stringadd
  6. by StringFormat
  7. by Ensuring
  8. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new NodeBase()

Abstract Value Members

  1. abstract def addDiPredecessors(edge: EdgeT, add: (NodeT) ⇒ Unit): Unit
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNode
  2. abstract def addDiSuccessors(edge: EdgeT, add: (NodeT) ⇒ Unit): Unit
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNode
  3. abstract def addNeighbors(edge: EdgeT, add: (NodeT) ⇒ Unit): Unit
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNode
  4. abstract def connectionsWith(other: NodeT): Set[EdgeT] with FilterableSet[EdgeT]

    All edges connecting this node with other including outgoing and incoming edges.

    All edges connecting this node with other including outgoing and incoming edges. This method is useful in case of multigraphs.

    other

    A node which is possibly connected with this node.

    returns

    All edges connecting this node with other. If other equals this node all hooks are returned. If other is not connected with this node an empty set is returned.

    Definition Classes
    InnerNode
  5. abstract def degree: Int

    The degree of this node.

    The degree of this node.

    returns

    the number of edges that connect to this node. An edge that connects to this node at more than one ends (loop) is counted as much times as it is connected to this node.

    Definition Classes
    InnerNode
  6. abstract def diPredecessors: Set[NodeT]

    All direct predecessors of this node, also called predecessor set or open in-neighborhood: source nodes of directed incident edges and / or adjacent nodes of undirected incident edges excluding this node.

    All direct predecessors of this node, also called predecessor set or open in-neighborhood: source nodes of directed incident edges and / or adjacent nodes of undirected incident edges excluding this node.

    returns

    set of all direct predecessors of this node.

    Definition Classes
    InnerNode
  7. abstract def diSuccessors: Set[NodeT]

    All direct successors of this node, also called successor set or open out-neighborhood: target nodes of directed incident edges and / or adjacent nodes of undirected incident edges excluding this node.

    All direct successors of this node, also called successor set or open out-neighborhood: target nodes of directed incident edges and / or adjacent nodes of undirected incident edges excluding this node.

    returns

    set of all direct successors of this node.

    Definition Classes
    InnerNode
  8. abstract def edges: ExtSet[EdgeT]

    All edges at this node - commonly denoted as E(v).

    All edges at this node - commonly denoted as E(v).

    returns

    all edges connecting to this node.

    Definition Classes
    InnerNode
  9. abstract def findIncomingFrom(from: NodeT): Option[EdgeT]

    An edge at from having this node as a successor.

    An edge at from having this node as a successor.

    from

    The node being at an edge which has this node as a successor.

    returns

    An edges at from having this node as a successor. If from equals this node a hook may be returned. If from is not an adjacent node None is returned.

    Definition Classes
    InnerNode
  10. abstract def findOutgoingTo(to: NodeT): Option[EdgeT]

    An outgoing edge connecting this node with to.

    An outgoing edge connecting this node with to.

    to

    The node which is the end point of an edge starting at this node.

    returns

    One of possibly several edges connecting this node with to. If to equals this node a hook may be returned. If to is not an adjacent node None is returned.

    Definition Classes
    InnerNode
  11. abstract def hasOnlyHooks: Boolean

    Checks whether this node has only hooks or no edges at all.

    Checks whether this node has only hooks or no edges at all.

    returns

    true if this node has only hooks or it isolated.

    Definition Classes
    InnerNode
  12. abstract def hasPredecessors: Boolean

    Whether this node has any predecessors.

    Whether this node has any predecessors.

    Definition Classes
    InnerNode
  13. abstract def hasSuccessors: Boolean

    Whether this node has any successors.

    Whether this node has any successors.

    Definition Classes
    InnerNode
  14. abstract def hook: Option[EdgeT]

    returns

    A looping edge out of one or more at this node or None if this node has no looping edge.

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

    The incoming degree of this node after applying some filters to the incoming edges and predecessors.

    The incoming degree of this node after applying some filters to the incoming edges and predecessors.

    Definition Classes
    InnerNode
  16. abstract def inDegree: Int

    The incoming degree of this node.

    The incoming degree of this node.

    returns

    the number of edges that come in to this node including undirected edges. Loops count once each.

    Definition Classes
    InnerNode
  17. abstract def incoming: Set[EdgeT] with FilterableSet[EdgeT]

    Incoming edges of this node.

    Incoming edges of this node.

    returns

    set of all edges incoming to of this including undirected edges.

    Definition Classes
    InnerNode
  18. abstract def incomingFrom(from: NodeT): Set[EdgeT] with FilterableSet[EdgeT]

    All incoming edges connecting from with this node.

    All incoming edges connecting from with this node.

    from

    The node with zero, one or more edges having this node as a direct successor.

    returns

    All edges at from having this node as a direct successor. If from equals this node all hooks are returned. If from is not an adjacent node an empty set is returned.

    Definition Classes
    InnerNode
  19. abstract def isContaining[N, E[X] <: EdgeLikeIn[X]](g: GraphBase[N, E]): Boolean
    Definition Classes
    InnerNodeParam
  20. abstract def isDirectPredecessorOf(that: NodeT): Boolean

    Whether that is an adjacent (direct successor) to this node.

    Whether that is an adjacent (direct successor) to this node.

    that

    The node to check for adjacency.

    returns

    true if that is adjacent to this node.

    Definition Classes
    InnerNode
  21. abstract def isIndependentOf(that: NodeT): Boolean

    Whether that is independent of this node meaning that there exists no edge connecting this node with that.

    Whether that is independent of this node meaning that there exists no edge connecting this node with that.

    that

    The node to check for independency.

    returns

    true if that node is independent of this node.

    Definition Classes
    InnerNode
  22. abstract def neighbors: Set[NodeT]

    All adjacent nodes (direct successors and predecessors) of this node, also called open neighborhood excluding this node.

    All adjacent nodes (direct successors and predecessors) of this node, also called open neighborhood excluding this node.

    returns

    set of all neighbors.

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

    The outgoing degree of this node after applying some filters to the outgoing edges and successors.

    The outgoing degree of this node after applying some filters to the outgoing edges and successors.

    Definition Classes
    InnerNode
  24. abstract def outDegree: Int

    The outgoing degree of this node.

    The outgoing degree of this node.

    returns

    the number of edges that go out from this node including undirected edges. Loops count once each.

    Definition Classes
    InnerNode
  25. abstract def outgoing: Set[EdgeT] with FilterableSet[EdgeT]

    All edges outgoing from this node.

    All edges outgoing from this node.

    returns

    set of all edges outgoing from this node including undirected edges and hooks.

    Definition Classes
    InnerNode
  26. abstract def outgoingTo(to: NodeT): Set[EdgeT] with FilterableSet[EdgeT]

    All outgoing edges connecting this node with to.

    All outgoing edges connecting this node with to.

    to

    The node which is the end point of zero, one or more edges starting at this node.

    returns

    All edges connecting this node with to. If to equals this node all hooks are returned. If to is not an adjacent an empty set is returned.

    Definition Classes
    InnerNode
  27. abstract def value: N

    The outer node as supplied at instantiation time or while adding nodes this graph.

    The outer node as supplied at instantiation time or while adding nodes this graph.

    returns

    Reference to the user-supplied outer node.

    Definition Classes
    InnerNodeNodeParam

Concrete Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from NodeBase to any2stringadd[NodeBase] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (NodeBase, B)
    Implicit
    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()
  5. final def <~(from: NodeT): Set[EdgeT] with FilterableSet[EdgeT]

    Synonym for incomingFrom.

    Synonym for incomingFrom.

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

    Synonym for incoming.

    Synonym for incoming.

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

    Synonym for findIncomingFrom.

    Synonym for findIncomingFrom.

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

    Synonym for diPredecessors.

    Synonym for diPredecessors.

    Definition Classes
    InnerNode
    Annotations
    @inline()
  9. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  10. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  11. 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
  12. final def asNodeTProjection[N <: N, E[X] <: EdgeLikeIn[X]]: NodeT
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeParam
  13. def canEqual(that: Any): Boolean
    Definition Classes
    InnerNode
  14. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  15. def ensuring(cond: (NodeBase) ⇒ Boolean, msg: ⇒ Any): NodeBase
    Implicit
    This member is added by an implicit conversion from NodeBase to Ensuring[NodeBase] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  16. def ensuring(cond: (NodeBase) ⇒ Boolean): NodeBase
    Implicit
    This member is added by an implicit conversion from NodeBase to Ensuring[NodeBase] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  17. def ensuring(cond: Boolean, msg: ⇒ Any): NodeBase
    Implicit
    This member is added by an implicit conversion from NodeBase to Ensuring[NodeBase] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  18. def ensuring(cond: Boolean): NodeBase
    Implicit
    This member is added by an implicit conversion from NodeBase to Ensuring[NodeBase] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  19. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  20. def equals(other: Any): Boolean
    Definition Classes
    InnerNode → AnyRef → Any
  21. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  22. 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: (NodeT) ⇒ T): T
    Definition Classes
    InnerNodeParam
  23. def formatted(fmtstr: String): String
    Implicit
    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()
  24. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  25. def hashCode(): Int
    Definition Classes
    InnerNode → AnyRef → Any
  26. final def inNeighbors: Set[NodeT]

    Synonym for diPredecessors.

    Synonym for diPredecessors.

    Definition Classes
    InnerNode
    Annotations
    @inline()
  27. def isDefined: Boolean
    Definition Classes
    Param
  28. final def isEdge: Boolean
    Definition Classes
    Param
  29. def isIn: Boolean
    Definition Classes
    OutParamParam
  30. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  31. final def isIsolated: Boolean

    true if this node's degree equals to 0.

    true if this node's degree equals to 0.

    Definition Classes
    InnerNode
    Annotations
    @inline()
  32. final def isLeaf: Boolean

    true if this node's degree equals to 1.

    true if this node's degree equals to 1.

    Definition Classes
    InnerNode
    Annotations
    @inline()
  33. def isNode: Boolean
    Definition Classes
    NodeParam
  34. final def isOut: Boolean
    Definition Classes
    Param
  35. val n1: NodeBase
    Implicit
    This member is added by an implicit conversion from NodeBase to EdgeAssoc[NodeBase] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  36. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  37. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  38. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  39. final def outNeighbors: Set[NodeT]

    Synonym for diSuccessors.

    Synonym for diSuccessors.

    Definition Classes
    InnerNode
    Annotations
    @inline()
  40. def pipe[B](f: (NodeBase) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from NodeBase to ChainingOps[NodeBase] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  41. val self: NodeBase
    Implicit
    This member is added by an implicit conversion from NodeBase to ChainingOps[NodeBase] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  42. def stringPrefix: String
    Definition Classes
    NodeParam
  43. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  44. def tap[U](f: (NodeBase) ⇒ U): NodeBase
    Implicit
    This member is added by an implicit conversion from NodeBase to ChainingOps[NodeBase] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  45. final def toNodeT[N <: N, E[X] <: EdgeLikeIn[X], G <: GraphBase[N, E] with Singleton](g: G)(f: (NodeT) ⇒ GraphPredef.InnerNodeParam.toNodeT.G.NodeT): GraphPredef.InnerNodeParam.toNodeT.G.NodeT
    Definition Classes
    InnerNodeParam
  46. final def toOuter: N

    Synonym for value.

    Synonym for value.

    Definition Classes
    InnerNode
    Annotations
    @inline()
  47. def toParArray: ParArray[T]
    Implicit
    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
  48. def toString(): String
    Definition Classes
    NodeParam → AnyRef → Any
  49. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  50. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  51. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  52. final def ~: ExtSet[EdgeT]

    Synonym for edges.

    Synonym for edges.

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

    Synonym for outgoingTo.

    Synonym for outgoingTo.

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

    Synonym for outgoing.

    Synonym for outgoing.

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

    Synonym for findOutgoingTo.

    Synonym for findOutgoingTo.

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

    Synonym for diSuccessors.

    Synonym for diSuccessors.

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

    Synonym for neighbors.

    Synonym for neighbors.

    Definition Classes
    InnerNode
    Annotations
    @inline()
  58. def [B](y: B): (NodeBase, B)
    Implicit
    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
    Implicit
    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. final def isEdge: Boolean
    Implicit
    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
    Param
  3. def isIn: Boolean
    Implicit
    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
    InParamParam
  4. def isNode: Boolean
    Implicit
    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. final def isOut: Boolean
    Implicit
    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
    Param
  6. def stringPrefix: String
    Implicit
    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
    Implicit
    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
    Implicit
    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
    OuterNodeNodeParam
  9. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    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]
    Implicit
    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 InnerNode

Inherited from InnerElem

Inherited from 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 EdgeAssoc from NodeBase to EdgeAssoc[NodeBase]

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

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

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