scalax.collection.GraphBase

InnerNode

trait InnerNode extends InnerNodeParam[N] with Node with InnerElem

Linear Supertypes
InnerElem, Node, Serializable, Serializable, InnerNodeParam[N], NodeParam[N], OutParam[N, Nothing], Param[N, Nothing], AnyRef, Any
Known Subclasses
InnerNode, InnerNode, InnerNode, InnerNodeImpl, InnerNodeImpl, InnerNodeTraversalImpl, NodeBase, NodeBase, NodeBase, NodeBase, TraverserInnerNode
Type Hierarchy Learn more about scaladoc diagrams
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. InnerNode
  2. InnerElem
  3. Node
  4. Serializable
  5. Serializable
  6. InnerNodeParam
  7. NodeParam
  8. OutParam
  9. Param
  10. AnyRef
  11. Any
Implicitly
  1. by anyToNode
  2. by EdgeAssoc
  3. by any2stringadd
  4. by any2stringfmt
  5. by any2ArrowAssoc
  6. by any2Ensuring
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def addDiPredecessors(edge: EdgeT, add: (NodeT) ⇒ Unit): Unit

    Attributes
    protected[scalax.collection]

  2. abstract def addDiSuccessors(edge: EdgeT, add: (NodeT) ⇒ Unit): Unit

    Attributes
    protected[scalax.collection]

  3. abstract def addNeighbors(edge: EdgeT, add: (NodeT) ⇒ Unit): Unit

    Attributes
    protected[scalax.collection]

  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.

  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.

  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.

  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.

  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 with at least one end connecting to this node.

  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.

  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.

  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.

  12. abstract def hasPredecessors: Boolean

    Whether this node has any predecessors.

  13. abstract def hasSuccessors: Boolean

    Whether this node has any successors.

  14. abstract def inDegree(nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (EdgeT) ⇒ Boolean = anyEdge, includeHooks: Boolean = false, ignoreMultiEdges: Boolean = true): Int

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

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

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

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

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

    Definition Classes
    InnerNodeParam

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

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

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

  22. abstract def outDegree(nodeFilter: (NodeT) ⇒ Boolean, edgeFilter: (EdgeT) ⇒ Boolean = anyEdge, includeHooks: Boolean = false, ignoreMultiEdges: Boolean = true): Int

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

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

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

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

  26. abstract def value: N

    The outer node as supplied by the user at instantiation time or by adding nodes this graph.

    The outer node as supplied by the user at instantiation time or by adding nodes this graph.

    returns

    Reference to the user-supplied outer node.

    Definition Classes
    InnerNode → NodeParam

Concrete 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 InnerNode to StringAdd performed by method any2stringadd in scala.Predef.
    Definition Classes
    StringAdd

  5. def ->[B](y: B): (InnerNode, B)

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

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

    Synonym for incomingFrom.

    Synonym for incomingFrom.

    Annotations
    @inline()

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

    Synonym for incoming.

    Synonym for incoming.

    Annotations
    @inline()

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

    Synonym for findIncomingFrom.

    Synonym for findIncomingFrom.

    Annotations
    @inline()

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

    Synonym for diPredecessors.

    Synonym for diPredecessors.

    Annotations
    @inline()

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

    Definition Classes
    AnyRef

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

    Definition Classes
    Any

  12. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

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

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

    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeParam

  15. def canEqual(that: Any): Boolean

  16. def clone(): AnyRef

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

  17. def ensuring(cond: (InnerNode) ⇒ Boolean, msg: ⇒ Any): InnerNode

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

  18. def ensuring(cond: (InnerNode) ⇒ Boolean): InnerNode

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

  19. def ensuring(cond: Boolean, msg: ⇒ Any): InnerNode

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

  20. def ensuring(cond: Boolean): InnerNode

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

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

    Definition Classes
    AnyRef

  22. def equals(other: Any): Boolean

    Definition Classes
    InnerNode → AnyRef → Any

  23. def finalize(): Unit

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

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

  25. def formatted(fmtstr: String): String

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

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

    Definition Classes
    AnyRef → Any

  27. def hashCode(): Int

    Definition Classes
    InnerNode → AnyRef → Any

  28. final def inNeighbors: Set[NodeT]

    Synonym for diPredecessors.

    Synonym for diPredecessors.

    Annotations
    @inline()

  29. def isDefined: Boolean

    Definition Classes
    Param

  30. def isEdge: Boolean

    Definition Classes
    NodeParam

  31. def isIn: Boolean

    Definition Classes
    OutParam → Param

  32. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  33. final def isIsolated: Boolean

    true if this node's degree equals to 0.

    true if this node's degree equals to 0.

    Annotations
    @inline()

  34. final def isLeaf: Boolean

    true if this node's degree equals to 1.

    true if this node's degree equals to 1.

    Annotations
    @inline()

  35. def isNode: Boolean

    Definition Classes
    NodeParam

  36. def isOut: Boolean

    Definition Classes
    OutParam → Param

  37. val n1: InnerNode

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

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

    Definition Classes
    AnyRef

  39. final def notify(): Unit

    Definition Classes
    AnyRef

  40. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  41. final def outNeighbors: Set[NodeT]

    Synonym for diSuccessors.

    Synonym for diSuccessors.

    Annotations
    @inline()

  42. def stringPrefix: String

    Definition Classes
    NodeParam

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

    Definition Classes
    AnyRef

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

  45. def toString(): String

    Definition Classes
    NodeParam → AnyRef → Any

  46. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

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

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  49. final def ~: ExtSet[EdgeT]

    Synonym for edges.

    Synonym for edges.

    Annotations
    @inline()

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

    Synonym for outgoingTo.

    Synonym for outgoingTo.

    Annotations
    @inline()

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

    Synonym for outgoing.

    Synonym for outgoing.

    Annotations
    @inline()

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

    Synonym for findOutgoingTo.

    Synonym for findOutgoingTo.

    Annotations
    @inline()

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

    Synonym for diSuccessors.

    Synonym for diSuccessors.

    Annotations
    @inline()

  54. final def ~|: Set[NodeT]

    Synonym for neighbors.

    Synonym for neighbors.

    Annotations
    @inline()

  55. def →[B](y: B): (InnerNode, B)

    Implicit information
    This member is added by an implicit conversion from InnerNode to ArrowAssoc[InnerNode] 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 InnerNode to OuterNode[InnerNode] 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:
    (innerNode: OuterNode[InnerNode]).isDefined
    Definition Classes
    Param

  2. def isEdge: Boolean

    Implicit information
    This member is added by an implicit conversion from InnerNode to OuterNode[InnerNode] 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:
    (innerNode: OuterNode[InnerNode]).isEdge
    Definition Classes
    NodeParam

  3. def isIn: Boolean

    Implicit information
    This member is added by an implicit conversion from InnerNode to OuterNode[InnerNode] 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:
    (innerNode: OuterNode[InnerNode]).isIn
    Definition Classes
    InParam → Param

  4. def isNode: Boolean

    Implicit information
    This member is added by an implicit conversion from InnerNode to OuterNode[InnerNode] 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:
    (innerNode: OuterNode[InnerNode]).isNode
    Definition Classes
    NodeParam

  5. def isOut: Boolean

    Implicit information
    This member is added by an implicit conversion from InnerNode to OuterNode[InnerNode] 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:
    (innerNode: OuterNode[InnerNode]).isOut
    Definition Classes
    InParam → Param

  6. val self: Any

    Implicit information
    This member is added by an implicit conversion from InnerNode 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:
    (innerNode: StringAdd).self
    Definition Classes
    StringAdd

  7. val self: Any

    Implicit information
    This member is added by an implicit conversion from InnerNode 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:
    (innerNode: StringFormat).self
    Definition Classes
    StringFormat

  8. def stringPrefix: String

    Implicit information
    This member is added by an implicit conversion from InnerNode to OuterNode[InnerNode] 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:
    (innerNode: OuterNode[InnerNode]).stringPrefix
    Definition Classes
    NodeParam

  9. def toString(): String

    Implicit information
    This member is added by an implicit conversion from InnerNode to OuterNode[InnerNode] 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:
    (innerNode: OuterNode[InnerNode]).toString()
    Definition Classes
    NodeParam → AnyRef → Any

  10. val value: InnerNode

    Implicit information
    This member is added by an implicit conversion from InnerNode to OuterNode[InnerNode] 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:
    (innerNode: OuterNode[InnerNode]).value
    Definition Classes
    OuterNode → NodeParam

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

    Implicit information
    This member is added by an implicit conversion from InnerNode to EdgeAssoc[InnerNode] 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:
    (innerNode: EdgeAssoc[InnerNode]).~(n2)
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

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

    Implicit information
    This member is added by an implicit conversion from InnerNode to EdgeAssoc[InnerNode] 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:
    (innerNode: EdgeAssoc[InnerNode]).~>(n2)
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

Deprecated Value Members

  1. def x: InnerNode

    Implicit information
    This member is added by an implicit conversion from InnerNode to ArrowAssoc[InnerNode] 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:
    (innerNode: ArrowAssoc[InnerNode]).x
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use leftOfArrow instead

  2. def x: InnerNode

    Implicit information
    This member is added by an implicit conversion from InnerNode to Ensuring[InnerNode] 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:
    (innerNode: Ensuring[InnerNode]).x
    Definition Classes
    Ensuring
    Annotations
    @deprecated
    Deprecated

    (Since version 2.10.0) Use resultOfEnsuring instead

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

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

Inherited by implicit conversion any2stringadd from InnerNode to StringAdd

Inherited by implicit conversion any2stringfmt from InnerNode to StringFormat

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

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

Ungrouped