Packages

trait BaseInnerNode extends Node with InnerNode

Linear Supertypes
GraphBase.InnerNode, GraphBase.InnerElem, Node, Serializable, AnyRef, Any
Known Subclasses
BaseNodeBase, GraphInnerNode, NodeBase, TraverserInnerNode, InnerNodeTraversalImpl, AdjacendyListBaseInnerNode, InnerNodeImpl, NodeBase_, InnerNodeImpl, NodeBase_, GraphLikeInnerNode
Type Hierarchy
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. BaseInnerNode
  2. InnerNode
  3. InnerElem
  4. Node
  5. Serializable
  6. AnyRef
  7. Any
Implicitly
  1. by any2stringadd
  2. by StringFormat
  3. by Ensuring
  4. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Abstract Value Members

  1. abstract def addDiPredecessors(edge: EdgeT, add: (NodeT) => Unit): Unit
    Attributes
    protected[collection]
  2. abstract def addDiSuccessors(edge: EdgeT, add: (NodeT) => Unit): Unit
    Attributes
    protected[collection]
  3. abstract def addNeighbors(edge: EdgeT, add: (NodeT) => Unit): Unit
    Attributes
    protected[collection]
  4. abstract def asNodeT: NodeT
    Attributes
    protected[collection]
    Definition Classes
    InnerNode
  5. 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.

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

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

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

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

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

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

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

  13. abstract def hasPredecessors: Boolean

    Whether this node has any predecessors.

  14. abstract def hasSuccessors: Boolean

    Whether this node has any successors.

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

  16. abstract def inDegree(nodeFilter: GraphBase.NodePredicate, edgeFilter: GraphBase.EdgePredicate = anyEdge, includeHooks: Boolean = false, ignoreMultiEdges: Boolean = true): Int

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

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

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

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

  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.

  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.

  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.

  23. abstract def outDegree(nodeFilter: GraphBase.NodePredicate, edgeFilter: GraphBase.EdgePredicate = anyEdge, includeHooks: Boolean = false, ignoreMultiEdges: Boolean = true): Int

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

  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.

  25. abstract def outer: N

    The outer node as supplied by instantiation or addition.

    The outer node as supplied by instantiation or addition.

    Definition Classes
    InnerNode
  26. 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.

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

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 BaseInnerNode toany2stringadd[BaseInnerNode] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. def ->[B](y: B): (BaseInnerNode, B)
    Implicit
    This member is added by an implicit conversion from BaseInnerNode toArrowAssoc[BaseInnerNode] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  5. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  6. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  7. def canEqual(that: Any): Boolean
  8. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
  9. def ensuring(cond: (BaseInnerNode) => Boolean, msg: => Any): BaseInnerNode
    Implicit
    This member is added by an implicit conversion from BaseInnerNode toEnsuring[BaseInnerNode] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  10. def ensuring(cond: (BaseInnerNode) => Boolean): BaseInnerNode
    Implicit
    This member is added by an implicit conversion from BaseInnerNode toEnsuring[BaseInnerNode] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  11. def ensuring(cond: Boolean, msg: => Any): BaseInnerNode
    Implicit
    This member is added by an implicit conversion from BaseInnerNode toEnsuring[BaseInnerNode] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  12. def ensuring(cond: Boolean): BaseInnerNode
    Implicit
    This member is added by an implicit conversion from BaseInnerNode toEnsuring[BaseInnerNode] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  13. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  14. def equals(other: Any): Boolean
    Definition Classes
    BaseInnerNode → AnyRef → Any
  15. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  16. def hashCode(): Int
    Definition Classes
    BaseInnerNode → AnyRef → Any
  17. final def inNeighbors: Set[NodeT]

    Synonym for diPredecessors.

    Synonym for diPredecessors.

    Annotations
    @inline()
  18. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  19. final def isIsolated: Boolean

    true if this node's degree equals to 0.

    true if this node's degree equals to 0.

    Annotations
    @inline()
  20. final def isLeaf: Boolean

    true if this node's degree equals to 1.

    true if this node's degree equals to 1.

    Annotations
    @inline()
  21. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  22. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  23. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  24. final def outNeighbors: Set[NodeT]

    Synonym for diSuccessors.

    Synonym for diSuccessors.

    Annotations
    @inline()
  25. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  26. def toString(): String
    Definition Classes
    BaseInnerNode → AnyRef → Any
  27. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  28. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  29. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated
  2. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from BaseInnerNode toStringFormat[BaseInnerNode] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @deprecated @inline()
    Deprecated

    (Since version 2.12.16) Use formatString.format(value) instead of value.formatted(formatString), or use the f"" string interpolator. In Java 15 and later, formatted resolves to the new method in String which has reversed parameters.

  3. def →[B](y: B): (BaseInnerNode, B)
    Implicit
    This member is added by an implicit conversion from BaseInnerNode toArrowAssoc[BaseInnerNode] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Inherited from GraphBase.InnerNode

Inherited from GraphBase.InnerElem

Inherited from Node

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion any2stringadd fromBaseInnerNode to any2stringadd[BaseInnerNode]

Inherited by implicit conversion StringFormat fromBaseInnerNode to StringFormat[BaseInnerNode]

Inherited by implicit conversion Ensuring fromBaseInnerNode to Ensuring[BaseInnerNode]

Inherited by implicit conversion ArrowAssoc fromBaseInnerNode to ArrowAssoc[BaseInnerNode]

Ungrouped