Packages

trait InnerNode extends (GraphLike.this)#InnerNode with (GraphLike.this)#InnerNodeOps

Self Type
(GraphLike.this)#NodeT
Linear Supertypes
(GraphLike.this)#InnerNodeOps, (GraphLike.this)#InnerNode, (GraphLike.this)#TraverserInnerNode, (GraphLike.this)#InnerNode, (GraphLike.this)#InnerElem, (GraphLike.this)#Node, Serializable, Serializable, InnerNodeParam[N], NodeParam[N], OutParam[N, Nothing], Param[N, Nothing], AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. InnerNode
  2. InnerNodeOps
  3. InnerNode
  4. TraverserInnerNode
  5. InnerNode
  6. InnerElem
  7. Node
  8. Serializable
  9. Serializable
  10. InnerNodeParam
  11. NodeParam
  12. OutParam
  13. Param
  14. AnyRef
  15. Any
Implicitly
  1. by anyToNode
  2. by toDefaultTraverser
  3. by EdgeAssoc
  4. by ChainingOps
  5. by CollectionsHaveToParArray
  6. by any2stringadd
  7. by StringFormat
  8. by Ensuring
  9. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def addDiPredecessors(edge: (GraphLike.this)#EdgeT, add: ((GraphLike.this)#NodeT) ⇒ Unit): Unit
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNode
  2. abstract def addDiSuccessors(edge: (GraphLike.this)#EdgeT, add: ((GraphLike.this)#NodeT) ⇒ Unit): Unit
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNode
  3. abstract def addNeighbors(edge: (GraphLike.this)#EdgeT, add: ((GraphLike.this)#NodeT) ⇒ Unit): Unit
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNode
  4. abstract def connectionsWith(other: (GraphLike.this)#NodeT): Set[(GraphLike.this)#EdgeT] with FilterableSet[(GraphLike.this)#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[(GraphLike.this)#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[(GraphLike.this)#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[(GraphLike.this)#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: (GraphLike.this)#NodeT): Option[(GraphLike.this)#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: (GraphLike.this)#NodeT): Option[(GraphLike.this)#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[(GraphLike.this)#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: (GraphLike.this)#NodeFilter, edgeFilter: (GraphLike.this)#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[(GraphLike.this)#EdgeT] with FilterableSet[(GraphLike.this)#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: (GraphLike.this)#NodeT): Set[(GraphLike.this)#EdgeT] with FilterableSet[(GraphLike.this)#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: (GraphLike.this)#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: (GraphLike.this)#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[(GraphLike.this)#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: (GraphLike.this)#NodeFilter, edgeFilter: (GraphLike.this)#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[(GraphLike.this)#EdgeT] with FilterableSet[(GraphLike.this)#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: (GraphLike.this)#NodeT): Set[(GraphLike.this)#EdgeT] with FilterableSet[(GraphLike.this)#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 (GraphLike.this)#InnerNode to any2stringadd[(GraphLike.this)#InnerNode] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  4. final def +~(that: N, those: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind = Bag): (GraphLike.this)#EdgeT

    Synonym to connectWith

    Synonym to connectWith

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()
  5. final def +~(that: N)(implicit edgeFactory: EdgeCompanion[E]): (GraphLike.this)#EdgeT

    Synonym to connectWith

    Synonym to connectWith

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()
  6. final def +~%[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](that: N, those: N*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): (GraphLike.this)#EdgeT

    Synonym to connectWithW(that, those)(weight).

    Synonym to connectWithW(that, those)(weight).

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()
  7. final def +~%[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](that: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): (GraphLike.this)#EdgeT

    Synonym to connectWithW(that)(weight).

    Synonym to connectWithW(that)(weight).

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()
  8. final def +~%+[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](that: N, those: N*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): (GraphLike.this)#EdgeT

    Synonym to connectWithWL(that, those)(weight, label).

    Synonym to connectWithWL(that, those)(weight, label).

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()
  9. final def +~%+[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](that: N)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): (GraphLike.this)#EdgeT

    Synonym to connectWithWL(that)(weight, label).

    Synonym to connectWithWL(that)(weight, label).

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()
  10. final def +~+[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](that: N, those: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): (GraphLike.this)#EdgeT

    Synonym to connectWithL(that, those)(label).

    Synonym to connectWithL(that, those)(label).

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()
  11. final def +~+[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](that: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): (GraphLike.this)#EdgeT

    Synonym to connectWithL(that)(label).

    Synonym to connectWithL(that)(label).

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()
  12. def ->[B](y: B): ((GraphLike.this)#InnerNode, B)
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to ArrowAssoc[(GraphLike.this)#InnerNode] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  13. final def <~(from: (GraphLike.this)#NodeT): Set[(GraphLike.this)#EdgeT] with FilterableSet[(GraphLike.this)#EdgeT]

    Synonym for incomingFrom.

    Synonym for incomingFrom.

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

    Synonym for incoming.

    Synonym for incoming.

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

    Synonym for findIncomingFrom.

    Synonym for findIncomingFrom.

    Definition Classes
    InnerNode
    Annotations
    @inline()
  16. final def <~|: Set[(GraphLike.this)#NodeT]

    Synonym for diPredecessors.

    Synonym for diPredecessors.

    Definition Classes
    InnerNode
    Annotations
    @inline()
  17. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  18. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  19. 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
  20. final def asNodeTProjection[N <: N, E[X] <: EdgeLikeIn[X]]: GraphBase.NodeT
    Attributes
    protected[scalax.collection]
    Definition Classes
    InnerNodeParam
  21. def canEqual(that: Any): Boolean
    Definition Classes
    InnerNode
  22. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  23. final def connectWith(that: N, those: N*)(implicit edgeFactory: HyperEdgeCompanion[E], endpointsKind: CollectionKind = Bag): (GraphLike.this)#EdgeT

    Creates a new inner hyperedge between this node and that plus those using edgeFactory and adds it to the edge set of this graph.

    Creates a new inner hyperedge between this node and that plus those using edgeFactory and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. Same as calling addAndGetEdge(this, that, those) on a Graph instance.

    that

    The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.

    those

    The third and possibly more inner or outer nodes to be incident with the hyperedge to be created. In case of a directed edge, these become targets.

    edgeFactory

    An edge companion who's from is to serve as the edge factory.

    returns

    true if a new hyperedge has been created. false if no new hyperedge could be created because there exists a corresponding equaling hyperedge.

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()
  24. final def connectWith(that: N)(implicit edgeFactory: EdgeCompanion[E]): (GraphLike.this)#EdgeT

    Creates a new inner edge between this node and that using edgeFactory and adds it to the edge set of this graph.

    Creates a new inner edge between this node and that using edgeFactory and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. Same as calling addAndGetEdge(this, that).

    that

    The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.

    edgeFactory

    An edge companion who's from is to serve as the edge factory.

    returns

    true if a new edge has been created. false if no new edge could be created because there exists a corresponding equaling edge.

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()
  25. final def connectWithL[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](that: N, those: N*)(label: L)(implicit edgeFactory: LHyperEdgeCompanion[EE]): (GraphLike.this)#EdgeT

    Creates a new labeled inner hyperedge between this node and that plus those using edgeFactory and adds it to the edge set of this graph.

    Creates a new labeled inner hyperedge between this node and that plus those using edgeFactory and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. Same as addAndGetLEdge(this, that, those)(label) on a Graph instance.

    that

    The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.

    those

    The third and possibly more inner or outer nodes to be incident with the hyperedge to be created. In case of a directed edge, these become targets.

    label

    The value the labeled edge to be created should have as its label.

    edgeFactory

    An edge companion who's from is to serve as the edge factory.

    returns

    true if a new hyperedge has been created. false if no new hyperedge could be created because there exists a corresponding equaling hyperedge.

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()
  26. final def connectWithL[EE[X] <: E[X] with EdgeLikeIn[X] with LEdgeBound[_, EE], L](that: N)(label: L)(implicit edgeFactory: LEdgeCompanion[EE]): (GraphLike.this)#EdgeT

    Creates a new labeled inner edge between this node and that using edgeFactory and adds it to the edge set of this graph.

    Creates a new labeled inner edge between this node and that using edgeFactory and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. Same as addAndGetLEdge(this, that)(label) on a Graph instance.

    that

    The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.

    label

    The value the labeled edge to be created should have as its label.

    edgeFactory

    An edge companion who's from is to serve as the edge factory.

    returns

    true if a new edge has been created. false if no new edge could be created because there exists a corresponding equaling edge.

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()
  27. final def connectWithW[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](that: N, those: N*)(weight: Double)(implicit edgeFactory: WHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): (GraphLike.this)#EdgeT

    Creates a new weighted inner hyperedge between this node and that plus those using edgeFactory and adds it to the edge set of this graph.

    Creates a new weighted inner hyperedge between this node and that plus those using edgeFactory and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. Same as addAndGetWEdge(this, that, those)(weight) on a Graph instance.

    that

    The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.

    those

    The third and possibly more inner or outer nodes to be incident with the hyperedge to be created. In case of a directed edge, these become targets.

    weight

    The number the weighted edge to be created should have as its weight.

    edgeFactory

    An edge companion who's from is to serve as the edge factory.

    returns

    true if a new hyperedge has been created. false if no new hyperedge could be created because there exists a corresponding equaling hyperedge.

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()
  28. final def connectWithW[EE[X] <: E[X] with EdgeLikeIn[X] with WEdgeBound[_, EE]](that: N)(weight: Double)(implicit edgeFactory: WEdgeCompanion[EE]): (GraphLike.this)#EdgeT

    Creates a new weighted inner edge between this node and that using edgeFactory and adds it to the edge set of this graph.

    Creates a new weighted inner edge between this node and that using edgeFactory and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. Same as addAndGetWEdge(this, that)(weight) on a Graph instance.

    that

    The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.

    weight

    The number the weighted edge to be created should have as its weight.

    edgeFactory

    An edge companion who's from is to serve as the edge factory.

    returns

    true if a new edge has been created. false if no new edge could be created because there exists a corresponding equaling edge.

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()
  29. final def connectWithWL[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](that: N, those: N*)(weight: Double, label: L)(implicit edgeFactory: WLHyperEdgeCompanion[EE], endpointsKind: CollectionKind = Bag): (GraphLike.this)#EdgeT

    Creates a new weighted and labeled inner hyperedge between this node and that plus those using edgeFactory and adds it to the edge set of this graph.

    Creates a new weighted and labeled inner hyperedge between this node and that plus those using edgeFactory and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. Same as addAndGetWLEdge(this, that, those)(weight, label) on a Graph instance.

    that

    The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.

    those

    The third and possibly more inner or outer nodes to be incident with the hyperedge to be created. In case of a directed edge, these become targets.

    weight

    The number the weighted edge to be created should have as its weight.

    label

    The value the labeled edge to be created should have as its label.

    edgeFactory

    An edge companion who's from is to serve as the edge factory.

    returns

    true if a new hyperedge has been created. false if no new hyperedge could be created because there exists a corresponding equaling hyperedge.

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()
  30. final def connectWithWL[EE[X] <: E[X] with EdgeLikeIn[X] with WLEdgeBound[_, EE], L](that: N)(weight: Double, label: L)(implicit edgeFactory: WLEdgeCompanion[EE]): (GraphLike.this)#EdgeT

    Creates a new weighted and labeled inner edge between this node and that using edgeFactory and adds it to the edge set of this graph.

    Creates a new weighted and labeled inner edge between this node and that using edgeFactory and adds it to the edge set of this graph. Node arguments not yet contained in this graph will be added to the node set. Same as addAndGetWLEdge(this, that)(weight, label) on a Graph instance.

    that

    The second outer node to be incident with the edge to be created. In case of a directed edge, this becomes the target.

    weight

    The number the weighted edge to be created should have as its weight.

    label

    The value the labeled edge to be created should have as its label.

    edgeFactory

    An edge companion who's from is to serve as the edge factory.

    returns

    true if a new edge has been created. false if no new edge could be created because there exists a corresponding equaling edge.

    Definition Classes
    InnerNodeOps
    Annotations
    @inline()
  31. final def containingGraph: (GraphLike.this)#ThisGraph

    The Graph instance that contains this inner edge.

    The Graph instance that contains this inner edge.

    Definition Classes
    InnerNode
  32. def ensuring(cond: ((GraphLike.this)#InnerNode) ⇒ Boolean, msg: ⇒ Any): (GraphLike.this)#InnerNode
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to Ensuring[(GraphLike.this)#InnerNode] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  33. def ensuring(cond: ((GraphLike.this)#InnerNode) ⇒ Boolean): (GraphLike.this)#InnerNode
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to Ensuring[(GraphLike.this)#InnerNode] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  34. def ensuring(cond: Boolean, msg: ⇒ Any): (GraphLike.this)#InnerNode
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to Ensuring[(GraphLike.this)#InnerNode] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  35. def ensuring(cond: Boolean): (GraphLike.this)#InnerNode
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to Ensuring[(GraphLike.this)#InnerNode] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  36. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  37. def equals(other: Any): Boolean
    Definition Classes
    InnerNode → AnyRef → Any
  38. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  39. final def findConnected[U](pred: (GraphLike.this)#NodeFilter)(implicit visitor: ((GraphLike.this)#NodeT) ⇒ U = empty): Option[(GraphLike.this)#NodeT]

    Finds a node connected with root by any number of edges with any direction for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Finds a node connected with root by any number of edges with any direction for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. For directed or mixed graphs the node to be found is weakly connected with this node. root itself does not count as a match. This is also true if it has a hook. If several connected nodes exist with pred the algorithm selects any one of these.

    pred

    The predicate which must hold true for the resulting node.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    returns

    A node with the predicate pred or None if either

    1. there is no node with pred or
    2. there exists no connection to such a node or
    3. there exists a connection to such a node but due to withSubgraph settings this path was out of scope.
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  40. def findCycle[U](implicit visitor: ((GraphLike.this)#NodeT) ⇒ U = empty): Option[(GraphLike.this)#Cycle]

    Finds a cycle starting the search at root taking optional properties like subgraph restriction, ordering or maximum depth into account., if any.

    Finds a cycle starting the search at root taking optional properties like subgraph restriction, ordering or maximum depth into account., if any. The resulting cycle may start at any node connected with this node.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    returns

    A cycle or None if either

    1. there exists no cycle in the component depicting by root or
    2. there exists a cycle in the component but due to withSubgraph settings this path was out of scope.
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  41. final def findPredecessor[U](pred: (GraphLike.this)#NodeFilter)(implicit visitor: ((GraphLike.this)#NodeT) ⇒ U = empty): Option[(GraphLike.this)#NodeT]

    Finds a predecessor of root for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Finds a predecessor of root for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. root itself does not count as a match. This is also true if it has a hook. If several predecessors exist the algorithm selects the first of them found.

    pred

    The predicate which must hold true for the resulting node.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    returns

    A node with the predicate pred or None if either

    1. there is no node with pred or
    2. there exists no path from such a node to this node or
    3. there exists a path from such a node to root but due to withSubgraph settings this path was out of scope.
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  42. final def findSuccessor[U](pred: (GraphLike.this)#NodeFilter)(implicit visitor: ((GraphLike.this)#NodeT) ⇒ U = empty): Option[(GraphLike.this)#NodeT]

    Finds a successor of root for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Finds a successor of root for which the predicate pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. root itself does not count as a match. This is also true if it has a hook. If several successors holding pred exist any one of them may be returned.

    pred

    The predicate which must hold for the resulting node.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    returns

    A node with the predicate pred or None if either

    1. there is no node with pred or
    2. there exists no path to such a node or
    3. there exists a path to such a node but due to withSubgraph settings this path was out of scope.
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  43. 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
  44. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to StringFormat[(GraphLike.this)#InnerNode] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  45. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  46. final def hasPredecessor[U](potentialPredecessor: (GraphLike.this)#NodeT)(implicit visitor: ((GraphLike.this)#NodeT) ⇒ U = empty): Boolean

    Checks whether potentialPredecessor is a predecessor of root considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Checks whether potentialPredecessor is a predecessor of root considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. Same as isSuccessorOf.

    potentialPredecessor

    The node which is potentially a predecessor of root.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    returns

    true if a path exists from potentialPredecessor to root and it had not to be excluded due to subgraph properties.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  47. final def hasSuccessor[U](potentialSuccessor: (GraphLike.this)#NodeT)(implicit visitor: ((GraphLike.this)#NodeT) ⇒ U = empty): Boolean

    Checks whether potentialSuccessor is a successor of this node considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Checks whether potentialSuccessor is a successor of this node considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. Same as isPredecessorOf.

    potentialSuccessor

    The node which is potentially a successor of this node.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    returns

    true if a path exists from this node to potentialSuccessor and it had not to be excluded due to a subgraph* restriction.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  48. def hashCode(): Int
    Definition Classes
    InnerNode → AnyRef → Any
  49. final def inNeighbors: Set[(GraphLike.this)#NodeT]

    Synonym for diPredecessors.

    Synonym for diPredecessors.

    Definition Classes
    InnerNode
    Annotations
    @inline()
  50. final def innerEdgeTraverser(implicit parameters: Parameters = Parameters()): (GraphLike.this)#InnerEdgeTraverser

    Instantiates an InnerEdgeTraverser which extends scala.collection.Traversable with elements of type EdgeT and sets its root to this node.

    Instantiates an InnerEdgeTraverser which extends scala.collection.Traversable with elements of type EdgeT and sets its root to this node. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Traversable on this instance.

    parameters

    The properties controlling subsequent traversals.

    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()
  51. final def innerElemTraverser(implicit parameters: Parameters = Parameters()): (GraphLike.this)#InnerElemTraverser

    Instantiates an InnerElemTraverser which extends scala.collection.Traversable with elements of type InnerElem and sets its root to this node.

    Instantiates an InnerElemTraverser which extends scala.collection.Traversable with elements of type InnerElem and sets its root to this node. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Traversable on this instance.

    parameters

    The properties controlling subsequent traversals.

    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()
  52. final def innerNodeDownUpTraverser(implicit parameters: Parameters = Parameters()): (GraphLike.this)#InnerNodeDownUpTraverser

    Instantiates an InnerNodeDownUpTraverser which extends scala.collection.Traversable with elements of type (Boolean, NodeT) and sets its root to this node.

    Instantiates an InnerNodeDownUpTraverser which extends scala.collection.Traversable with elements of type (Boolean, NodeT) and sets its root to this node. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Traversable on this instance.

    parameters

    The properties controlling subsequent traversals.

    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()
  53. final def innerNodeTraverser(implicit parameters: Parameters = Parameters()): (GraphLike.this)#InnerNodeTraverser

    Instantiates an InnerNodeTraverser which extends scala.collection.Traversable with elements of type NodeT and sets its root to this node.

    Instantiates an InnerNodeTraverser which extends scala.collection.Traversable with elements of type NodeT and sets its root to this node. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Traversable on this instance.

    parameters

    The properties controlling subsequent traversals.

    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()
  54. final def isConnectedWith[U](potentialConnected: (GraphLike.this)#NodeT)(implicit visitor: ((GraphLike.this)#NodeT) ⇒ U = empty): Boolean

    Checks whether potentialConnected is a node (not necessarily directly) connected with root by any number of edges with any direction considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Checks whether potentialConnected is a node (not necessarily directly) connected with root by any number of edges with any direction considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. For directed or mixed graphs it is satisfactory that potentialConnected is weakly connected with root.

    potentialConnected

    The node which is potentially connected with root.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    returns

    true if a path exists from this node to potentialConnected and it had not to be excluded due to subgraph properties.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  55. def isDefined: Boolean
    Definition Classes
    Param
  56. final def isEdge: Boolean
    Definition Classes
    Param
  57. def isIn: Boolean
    Definition Classes
    OutParamParam
  58. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  59. 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()
  60. 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()
  61. def isNode: Boolean
    Definition Classes
    NodeParam
  62. final def isOut: Boolean
    Definition Classes
    Param
  63. final def isPredecessorOf[U](potentialSuccessor: (GraphLike.this)#NodeT)(implicit visitor: ((GraphLike.this)#NodeT) ⇒ U = empty): Boolean

    Same as hasSuccessor.

    Same as hasSuccessor.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  64. final def isSuccessorOf[U](potentialPredecessor: (GraphLike.this)#NodeT)(implicit visitor: ((GraphLike.this)#NodeT) ⇒ U = empty): Boolean

    Same as hasPredecessor.

    Same as hasPredecessor.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  65. val n1: (GraphLike.this)#InnerNode
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to EdgeAssoc[(GraphLike.this)#InnerNode] performed by method EdgeAssoc in scalax.collection.GraphPredef.
    Definition Classes
    EdgeAssoc
  66. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  67. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  68. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  69. final def outNeighbors: Set[(GraphLike.this)#NodeT]

    Synonym for diSuccessors.

    Synonym for diSuccessors.

    Definition Classes
    InnerNode
    Annotations
    @inline()
  70. final def outerEdgeTraverser(implicit parameters: Parameters = Parameters()): (GraphLike.this)#OuterEdgeTraverser

    Instantiates an OuterEdgeTraverser which extends scala.collection.Traversable with elements of type E[N] and sets its root to this node.

    Instantiates an OuterEdgeTraverser which extends scala.collection.Traversable with elements of type E[N] and sets its root to this node. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Traversable on this instance.

    parameters

    The properties controlling subsequent traversals.

    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()
  71. final def outerElemTraverser(implicit parameters: Parameters = Parameters()): (GraphLike.this)#OuterElemTraverser

    Instantiates an OuterElemTraverser which extends scala.collection.Traversable with elements of type OuterElem and sets its root to this node.

    Instantiates an OuterElemTraverser which extends scala.collection.Traversable with elements of type OuterElem and sets its root to this node. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Traversable on this instance.

    parameters

    The properties controlling subsequent traversals.

    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()
  72. final def outerNodeDownUpTraverser(implicit parameters: Parameters = Parameters()): (GraphLike.this)#OuterNodeDownUpTraverser

    Instantiates an OuterNodeDownUpTraverser which extends scala.collection.Traversable with elements of type (Boolean, N) and sets its root to this node.

    Instantiates an OuterNodeDownUpTraverser which extends scala.collection.Traversable with elements of type (Boolean, N) and sets its root to this node. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Traversable on this instance.

    parameters

    The properties controlling subsequent traversals.

    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()
  73. final def outerNodeTraverser(implicit parameters: Parameters = Parameters()): (GraphLike.this)#OuterNodeTraverser

    Instantiates an OuterNodeTraverser which extends scala.collection.Traversable with elements of type N and sets its root to this node.

    Instantiates an OuterNodeTraverser which extends scala.collection.Traversable with elements of type N and sets its root to this node. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Traversable on this instance.

    parameters

    The properties controlling subsequent traversals.

    Definition Classes
    TraverserInnerNode
    Annotations
    @inline()
  74. def partOfCycle[U](implicit visitor: ((GraphLike.this)#NodeT) ⇒ U = empty): Option[(GraphLike.this)#Cycle]

    Finds a cycle that contains root taking optional properties like subgraph restriction, ordering or maximum depth into account..

    Finds a cycle that contains root taking optional properties like subgraph restriction, ordering or maximum depth into account.. Irrespective of the current setting for kind, DepthFirst is used internally.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    returns

    A cycle containing root or None if either

    1. there exists no cycle containing root or
    2. there exists such a cycle but due to withSubgraph settings this path was out of scope.
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  75. final def pathTo[U](potentialSuccessor: (GraphLike.this)#NodeT)(implicit visitor: ((GraphLike.this)#NodeT) ⇒ U = empty): Option[(GraphLike.this)#Path]

    Finds a path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Finds a path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    potentialSuccessor

    The node a path is to be found to.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    returns

    A path to potentialSuccessor or None if either

    1. there is no node with pred or
    2. there exists no path to such a node
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  76. def pathUntil[U](pred: (GraphLike.this)#NodeFilter)(implicit visitor: ((GraphLike.this)#NodeT) ⇒ U = empty): Option[(GraphLike.this)#Path]

    Finds a path from root to a successor of root for which pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Finds a path from root to a successor of root for which pred holds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. root itself does not count as a match. This is also true if it has a hook. If several successors exist the algorithm selects any one of these.

    pred

    The predicate which must hold true for the successor.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    returns

    A path to a node with the predicate pred or None if either

    1. there is no node with pred or
    2. there exists no path to such a node or
    3. there exists a path to such a node but due to withSubgraph settings this path was out of scope.
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  77. def pipe[B](f: ((GraphLike.this)#InnerNode) ⇒ B): B
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to ChainingOps[(GraphLike.this)#InnerNode] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  78. def root: (GraphLike.this)#NodeT
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  79. val self: (GraphLike.this)#InnerNode
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to ChainingOps[(GraphLike.this)#InnerNode] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  80. final def shortestPathTo[T](potentialSuccessor: (GraphLike.this)#NodeT, weight: ((GraphLike.this)#EdgeT) ⇒ T)(implicit arg0: Numeric[T]): Option[(GraphLike.this)#Path]

    Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. The calculation is based on the weight of the edges on the path. Edges have a default weight of 1L that can be overridden by custom edges. A weight function yielding any numeric type may also be passed to shortestPathTo.

    potentialSuccessor

    The node the shortest path is to be found to.

    weight

    Function to determine the weight of edges. If supplied, this function takes precedence over edge weights.

    returns

    The shortest path to potentialSuccessor or None if either

    1. there exists no path to potentialSuccessor or
    2. there exists a path to potentialSuccessor but due to withSubgraph settings this path was out of scope.
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  81. final def shortestPathTo[U](potentialSuccessor: (GraphLike.this)#NodeT)(implicit visitor: ((GraphLike.this)#NodeT) ⇒ U = empty): Option[(GraphLike.this)#Path]

    Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. The calculation is based on the weight of the edges on the path. Edges have a default weight of 1L that can be overridden by custom edges. A weight function yielding any numeric type may also be passed to shortestPathTo.

    potentialSuccessor

    The node the shortest path is to be found to.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    returns

    The shortest path to potentialSuccessor or None if either

    1. there exists no path to potentialSuccessor or
    2. there exists a path to potentialSuccessor but due to withSubgraph settings this path was out of scope.
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
    Annotations
    @inline()
  82. def shortestPathTo[T, U](potentialSuccessor: (GraphLike.this)#NodeT, weight: ((GraphLike.this)#EdgeT) ⇒ T, visitor: ((GraphLike.this)#NodeT) ⇒ U)(implicit arg0: Numeric[T]): Option[(GraphLike.this)#Path]

    Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method.

    Finds the shortest path from root to potentialSuccessor considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by any with* method. The calculation is based on the weight of the edges on the path. Edges have a default weight of 1L that can be overridden by custom edges. A weight function yielding any numeric type may also be passed to shortestPathTo.

    potentialSuccessor

    The node the shortest path is to be found to.

    weight

    Function to determine the weight of edges. If supplied, this function takes precedence over edge weights.

    visitor

    An optional function that is applied for its side-effect to every element visited during graph traversal.

    returns

    The shortest path to potentialSuccessor or None if either

    1. there exists no path to potentialSuccessor or
    2. there exists a path to potentialSuccessor but due to withSubgraph settings this path was out of scope.
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  83. def stringPrefix: String
    Definition Classes
    NodeParam
  84. def strongComponents[U](implicit visitor: ((GraphLike.this)#NodeT) ⇒ U = empty): Iterable[(GraphLike.this)#Component]

    Finds all strongly connected components reachable from this node.

    Finds all strongly connected components reachable from this node. See componentTraverser for more control by means of FluentProperties.

    visitor

    Function to be called for each inner node or inner edge visited during the search.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  85. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  86. def tap[U](f: ((GraphLike.this)#InnerNode) ⇒ U): (GraphLike.this)#InnerNode
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to ChainingOps[(GraphLike.this)#InnerNode] performed by method ChainingOps in scalax.collection.
    Definition Classes
    ChainingOps
  87. final def toInnerElemTraverser(root: (GraphLike.this)#NodeT): (GraphLike.this)#InnerElemTraverser
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties
  88. 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
  89. final def toOuter: N

    Synonym for value.

    Synonym for value.

    Definition Classes
    InnerNode
    Annotations
    @inline()
  90. def toParArray: ParArray[T]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to CollectionsHaveToParArray[(GraphLike.this)#InnerNode, T] performed by method CollectionsHaveToParArray in scala.collection.parallel. This conversion will take place only if an implicit value of type ((GraphLike.this)#InnerNode) ⇒ GenTraversableOnce[T] is in scope.
    Definition Classes
    CollectionsHaveToParArray
  91. def toString(): String
    Definition Classes
    NodeParam → AnyRef → Any
  92. def topologicalSort[U](ignorePredecessors: Boolean = false)(implicit visitor: ((GraphLike.this)#InnerElem) ⇒ U = empty): (GraphLike.this)#CycleNodeOrTopologicalOrder

    Sorts the component designated by this node topologically.

    Sorts the component designated by this node topologically. Only nodes connected with this node will be included in the resulting topological order. If the graph is known to be connected choose GraphTraversal#topologicalSort instead. See componentTraverser for more control by means of FluentProperties.

    ignorePredecessors

    If true, the topological sort will be partial in that it will only include successors of root. withSubgraph restricts the successor nodes to be included but not predecessors that will be excluded in total.

    visitor

    Function to be called for each inner node or inner edge visited during the sort.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  93. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  94. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  95. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @throws( ... )
  96. def weakComponent[U](implicit visitor: ((GraphLike.this)#NodeT) ⇒ U = empty): (GraphLike.this)#Component

    Determines the weak component that contains this node.

    Determines the weak component that contains this node. See componentTraverser for more control by means of FluentProperties.

    visitor

    Function to be called for each inner node or inner edge visited during the search.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  97. final def withDirection(direction: Direction): (GraphLike.this)#InnerNodeTraverser

    Creates a new FluentProperties based on this except for an updated direction.

    Creates a new FluentProperties based on this except for an updated direction. Note that methods returning a Cycle or Path accept only Successors.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties
  98. final def withKind(kind: Kind): (GraphLike.this)#InnerNodeTraverser

    Creates a new FluentProperties based on this except for an updated kind.

    Creates a new FluentProperties based on this except for an updated kind.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties
  99. final def withMaxDepth(maxDepth: Int): (GraphLike.this)#InnerNodeTraverser

    Creates a new FluentProperties based on this except for an updated maxDepth.

    Creates a new FluentProperties based on this except for an updated maxDepth.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties
  100. final def withMaxWeight(max: Long): (GraphLike.this)#InnerNodeTraverser

    Creates a new FluentProperties based on this except for an updated maxWeight having the given max and the default weight function returning edge.weight.

    Creates a new FluentProperties based on this except for an updated maxWeight having the given max and the default weight function returning edge.weight.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties
  101. final def withMaxWeight[W](max: W, edgeWeight: ((GraphLike.this)#EdgeT) ⇒ W)(implicit arg0: Numeric[W]): (GraphLike.this)#InnerNodeTraverser

    Creates a new FluentProperties based on this except for an updated maxWeight having the given max value and the given weight function.

    Creates a new FluentProperties based on this except for an updated maxWeight having the given max value and the given weight function.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties
  102. def withMaxWeight(maxWeight: Option[(GraphLike.this)#Weight]): (GraphLike.this)#InnerNodeTraverser

    Creates a new FluentProperties based on this except for an updated maxWeight.

    Creates a new FluentProperties based on this except for an updated maxWeight.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties
  103. final def withOrdering(ordering: (GraphLike.this)#ElemOrdering): (GraphLike.this)#InnerNodeTraverser

    Creates a new FluentProperties based on this except for an updated ordering.

    Creates a new FluentProperties based on this except for an updated ordering.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties
  104. final def withParameters(parameters: Parameters): (GraphLike.this)#InnerNodeTraverser

    Creates a new FluentProperties based on this except for an updated parameters.

    Creates a new FluentProperties based on this except for an updated parameters.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties
  105. final def withRoot(root: (GraphLike.this)#NodeT): (GraphLike.this)#InnerNodeTraverser

    Creates a new FluentProperties based on this except for an updated root.

    Creates a new FluentProperties based on this except for an updated root.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    TraverserMethods
  106. final def withSubgraph(nodes: (GraphLike.this)#NodeFilter = anyNode, edges: (GraphLike.this)#EdgeFilter = anyEdge): (GraphLike.this)#InnerNodeTraverser

    Creates a new FluentProperties based on this except for an updated subgraphNodes and/or subgraphEdges.

    Creates a new FluentProperties based on this except for an updated subgraphNodes and/or subgraphEdges.

    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser] performed by method toDefaultTraverser in scalax.collection.GraphTraversal.TraverserInnerNode.
    Definition Classes
    FluentProperties
  107. final def ~: ExtSet[(GraphLike.this)#EdgeT]

    Synonym for edges.

    Synonym for edges.

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

    Synonym for outgoingTo.

    Synonym for outgoingTo.

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

    Synonym for outgoing.

    Synonym for outgoing.

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

    Synonym for findOutgoingTo.

    Synonym for findOutgoingTo.

    Definition Classes
    InnerNode
    Annotations
    @inline()
  111. final def ~>|: Set[(GraphLike.this)#NodeT]

    Synonym for diSuccessors.

    Synonym for diSuccessors.

    Definition Classes
    InnerNode
    Annotations
    @inline()
  112. final def ~|: Set[(GraphLike.this)#NodeT]

    Synonym for neighbors.

    Synonym for neighbors.

    Definition Classes
    InnerNode
    Annotations
    @inline()
  113. def [B](y: B): ((GraphLike.this)#InnerNode, B)
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to ArrowAssoc[(GraphLike.this)#InnerNode] 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 (GraphLike.this)#InnerNode to OuterNode[(GraphLike.this)#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[(GraphLike.this)#InnerNode]).isDefined
    Definition Classes
    Param
  2. final def isEdge: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to OuterNode[(GraphLike.this)#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[(GraphLike.this)#InnerNode]).isEdge
    Definition Classes
    Param
  3. def isIn: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to OuterNode[(GraphLike.this)#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[(GraphLike.this)#InnerNode]).isIn
    Definition Classes
    InParamParam
  4. def isNode: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to OuterNode[(GraphLike.this)#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[(GraphLike.this)#InnerNode]).isNode
    Definition Classes
    NodeParam
  5. final def isOut: Boolean
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to OuterNode[(GraphLike.this)#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[(GraphLike.this)#InnerNode]).isOut
    Definition Classes
    Param
  6. def stringPrefix: String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to OuterNode[(GraphLike.this)#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[(GraphLike.this)#InnerNode]).stringPrefix
    Definition Classes
    NodeParam
  7. def toString(): String
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to OuterNode[(GraphLike.this)#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[(GraphLike.this)#InnerNode]).toString()
    Definition Classes
    NodeParam → AnyRef → Any
  8. val value: (GraphLike.this)#InnerNode
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to OuterNode[(GraphLike.this)#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[(GraphLike.this)#InnerNode]).value
    Definition Classes
    OuterNodeNodeParam
  9. def ~[N >: N1](n2: N): UnDiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to EdgeAssoc[(GraphLike.this)#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[(GraphLike.this)#InnerNode]).~(n2)
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()
  10. def ~>[N >: N1](n2: N): DiEdge[N]
    Implicit
    This member is added by an implicit conversion from (GraphLike.this)#InnerNode to EdgeAssoc[(GraphLike.this)#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[(GraphLike.this)#InnerNode]).~>(n2)
    Definition Classes
    EdgeAssoc
    Annotations
    @inline()

Inherited from (GraphLike.this)#InnerNodeOps

Inherited from (GraphLike.this)#InnerNode

Inherited from (GraphLike.this)#TraverserInnerNode

Inherited from (GraphLike.this)#InnerNode

Inherited from (GraphLike.this)#InnerElem

Inherited from (GraphLike.this)#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 (GraphLike.this)#InnerNode to OuterNode[(GraphLike.this)#InnerNode]

Inherited by implicit conversion toDefaultTraverser from (GraphLike.this)#InnerNode to (GraphLike.this)#TraverserMethods[(GraphLike.this)#NodeT, (GraphLike.this)#InnerNodeTraverser]

Inherited by implicit conversion EdgeAssoc from (GraphLike.this)#InnerNode to EdgeAssoc[(GraphLike.this)#InnerNode]

Inherited by implicit conversion ChainingOps from (GraphLike.this)#InnerNode to ChainingOps[(GraphLike.this)#InnerNode]

Inherited by implicit conversion CollectionsHaveToParArray from (GraphLike.this)#InnerNode to CollectionsHaveToParArray[(GraphLike.this)#InnerNode, T]

Inherited by implicit conversion any2stringadd from (GraphLike.this)#InnerNode to any2stringadd[(GraphLike.this)#InnerNode]

Inherited by implicit conversion StringFormat from (GraphLike.this)#InnerNode to StringFormat[(GraphLike.this)#InnerNode]

Inherited by implicit conversion Ensuring from (GraphLike.this)#InnerNode to Ensuring[(GraphLike.this)#InnerNode]

Inherited by implicit conversion ArrowAssoc from (GraphLike.this)#InnerNode to ArrowAssoc[(GraphLike.this)#InnerNode]

Ungrouped