trait InnerNode extends (GraphLike.this)#TraverserInnerNode
- Alphabetic
- By Inheritance
- InnerNode
- TraverserInnerNode
- InnerNode
- InnerElem
- Node
- Serializable
- InnerNodeParam
- NodeParam
- OutParam
- Param
- AnyRef
- Any
- by toDefaultTraverser
- by EdgeAssoc
- by anyToNode
- by ChainingOps
- by any2stringadd
- by StringFormat
- by Ensuring
- by ArrowAssoc
- Hide All
- Show All
- Public
- Protected
Abstract Value Members
- abstract def addDiPredecessors(edge: (GraphLike.this)#EdgeT, add: ((GraphLike.this)#NodeT) => Unit): Unit
- Attributes
- protected[collection]
- Definition Classes
- InnerNode
- abstract def addDiSuccessors(edge: (GraphLike.this)#EdgeT, add: ((GraphLike.this)#NodeT) => Unit): Unit
- Attributes
- protected[collection]
- Definition Classes
- InnerNode
- abstract def addNeighbors(edge: (GraphLike.this)#EdgeT, add: ((GraphLike.this)#NodeT) => Unit): Unit
- Attributes
- protected[collection]
- Definition Classes
- InnerNode
- abstract def connectionsWith(other: (GraphLike.this)#NodeT): Set[(GraphLike.this)#EdgeT] with FilterableSet[(GraphLike.this)#EdgeT]
All edges connecting this node with
otherincluding outgoing and incoming edges.All edges connecting this node with
otherincluding 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. Ifotherequals this node all hooks are returned. Ifotheris not connected with this node an empty set is returned.
- Definition Classes
- InnerNode
- 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
- 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
- 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
- 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
- abstract def findIncomingFrom(from: (GraphLike.this)#NodeT): Option[(GraphLike.this)#EdgeT]
An edge at
fromhaving this node as a successor.An edge at
fromhaving this node as a successor.- from
The node being at an edge which has this node as a successor.
- returns
An edges at
fromhaving this node as a successor. Iffromequals this node a hook may be returned. Iffromis not an adjacent nodeNoneis returned.
- Definition Classes
- InnerNode
- 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. Iftoequals this node a hook may be returned. Iftois not an adjacent nodeNoneis returned.
- Definition Classes
- InnerNode
- 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
trueif this node has only hooks or it isolated.
- Definition Classes
- InnerNode
- abstract def hasPredecessors: Boolean
Whether this node has any predecessors.
Whether this node has any predecessors.
- Definition Classes
- InnerNode
- abstract def hasSuccessors: Boolean
Whether this node has any successors.
Whether this node has any successors.
- Definition Classes
- InnerNode
- abstract def hook: Option[(GraphLike.this)#EdgeT]
- returns
A looping edge out of one or more at this node or
Noneif this node has no looping edge.
- Definition Classes
- InnerNode
- 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
- 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
- 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
- abstract def incomingFrom(from: (GraphLike.this)#NodeT): Set[(GraphLike.this)#EdgeT] with FilterableSet[(GraphLike.this)#EdgeT]
All incoming edges connecting
fromwith this node.All incoming edges connecting
fromwith this node.- from
The node with zero, one or more edges having this node as a direct successor.
- returns
All edges at
fromhaving this node as a direct successor. Iffromequals this node all hooks are returned. Iffromis not an adjacent node an empty set is returned.
- Definition Classes
- InnerNode
- abstract def isContaining[N, E[+X] <: EdgeLikeIn[X]](g: GraphBase[N, E]): Boolean
- Definition Classes
- InnerNodeParam
- abstract def isDirectPredecessorOf(that: (GraphLike.this)#NodeT): Boolean
Whether
thatis an adjacent (direct successor) to this node.Whether
thatis an adjacent (direct successor) to this node.- that
The node to check for adjacency.
- returns
trueifthatis adjacent to this node.
- Definition Classes
- InnerNode
- abstract def isIndependentOf(that: (GraphLike.this)#NodeT): Boolean
Whether
thatis independent of this node meaning that there exists no edge connecting this node withthat.Whether
thatis independent of this node meaning that there exists no edge connecting this node withthat.- that
The node to check for independency.
- returns
trueifthatnode is independent of this node.
- Definition Classes
- InnerNode
- 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
- 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
- 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
- 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
- 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. Iftoequals this node all hooks are returned. Iftois not an adjacent an empty set is returned.
- Definition Classes
- InnerNode
- abstract def value: N
The outer node as supplied at instantiation time or while adding nodes this graph.
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- def +(other: String): String
- def ->[B](y: B): ((GraphLike.this)#InnerNode, B)
- 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()
- final def <~: Set[(GraphLike.this)#EdgeT] with FilterableSet[(GraphLike.this)#EdgeT]
Synonym for
incoming.Synonym for
incoming.- Definition Classes
- InnerNode
- Annotations
- @inline()
- final def <~?(from: (GraphLike.this)#NodeT): Option[(GraphLike.this)#EdgeT]
Synonym for
findIncomingFrom.Synonym for
findIncomingFrom.- Definition Classes
- InnerNode
- Annotations
- @inline()
- final def <~|: Set[(GraphLike.this)#NodeT]
Synonym for
diPredecessors.Synonym for
diPredecessors.- Definition Classes
- InnerNode
- Annotations
- @inline()
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- final def asNodeT[N <: N, E[+X] <: EdgeLikeIn[X], G <: GraphBase[N, E]](g: G): GraphPredef.InnerNodeParam.asNodeT.G.NodeT
- Attributes
- protected[collection]
- Definition Classes
- InnerNodeParam
- final def asNodeTProjection[N <: N, E[+X] <: EdgeLikeIn[X]]: GraphBase.NodeT
- Attributes
- protected[collection]
- Definition Classes
- InnerNodeParam
- def canEqual(that: Any): Boolean
- Definition Classes
- InnerNode
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native() @HotSpotIntrinsicCandidate()
- final def containingGraph: (GraphLike.this)#ThisGraph
The
Graphinstance that containsthisinner node. - def ensuring(cond: ((GraphLike.this)#InnerNode) => Boolean, msg: => Any): (GraphLike.this)#InnerNode
- def ensuring(cond: ((GraphLike.this)#InnerNode) => Boolean): (GraphLike.this)#InnerNode
- def ensuring(cond: Boolean, msg: => Any): (GraphLike.this)#InnerNode
- def ensuring(cond: Boolean): (GraphLike.this)#InnerNode
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(other: Any): Boolean
- Definition Classes
- InnerNode → AnyRef → Any
- final def findConnected[U](pred: (GraphLike.this)#NodeFilter)(implicit visitor: ((GraphLike.this)#NodeT) => U = empty): Option[(GraphLike.this)#NodeT]
Finds a node connected with
rootby any number of edges with any direction for which the predicatepredholds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.Finds a node connected with
rootby any number of edges with any direction for which the predicatepredholds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method. For directed or mixed graphs the node to be found is weakly connected with this node.rootitself does not count as a match. This is also true if it has a hook. If several connected nodes exist withpredthe 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
predorNoneif either- there is no node with
predor - there exists no connection to such a node or
- there exists a connection to such a node but due to withSubgraph settings this path was out of scope.
- there is no node with
- 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
- def findCycle[U](implicit visitor: ((GraphLike.this)#NodeT) => U = empty): Option[(GraphLike.this)#Cycle]
Finds a cycle starting the search at
roottaking optional properties like subgraph restriction, ordering or maximum depth into account., if any.Finds a cycle starting the search at
roottaking optional properties like subgraph restriction, ordering or maximum depth into account., if any. The resulting cycle may start at any node connected withthisnode.- visitor
An optional function that is applied for its side-effect to every element visited during graph traversal.
- returns
A cycle or
Noneif either- there exists no cycle in the component depicting by
rootor - there exists a cycle in the component but due to withSubgraph settings this path was out of scope.
- there exists no cycle in the component depicting by
- 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
- final def findPredecessor[U](pred: (GraphLike.this)#NodeFilter)(implicit visitor: ((GraphLike.this)#NodeT) => U = empty): Option[(GraphLike.this)#NodeT]
Finds a predecessor of
rootfor which the predicatepredholds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.Finds a predecessor of
rootfor which the predicatepredholds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.rootitself 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
predorNoneif either- there is no node with
predor - there exists no path from such a node to this node or
- there exists a path from such a node to
rootbut due to withSubgraph settings this path was out of scope.
- there is no node with
- 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
- final def findSuccessor[U](pred: (GraphLike.this)#NodeFilter)(implicit visitor: ((GraphLike.this)#NodeT) => U = empty): Option[(GraphLike.this)#NodeT]
Finds a successor of
rootfor which the predicatepredholds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.Finds a successor of
rootfor which the predicatepredholds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.rootitself does not count as a match. This is also true if it has a hook. If several successors holdingpredexist 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
predorNoneif either- there is no node with
predor - there exists no path to such a node or
- there exists a path to such a node but due to withSubgraph settings this path was out of scope.
- there is no node with
- 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
- final def fold[N <: N, E[+X] <: EdgeLikeIn[X], G <: GraphBase[N, E], T](g: G)(fa: (GraphPredef.InnerNodeParam.fold.G.NodeT) => T, fb: (GraphBase.NodeT) => T): T
- Definition Classes
- InnerNodeParam
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def hasPredecessor[U](potentialPredecessor: (GraphLike.this)#NodeT)(implicit visitor: ((GraphLike.this)#NodeT) => U = empty): Boolean
Checks whether
potentialPredecessoris a predecessor ofrootconsidering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.Checks whether
potentialPredecessoris a predecessor ofrootconsidering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method. Same asisSuccessorOf.- 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
trueif a path exists frompotentialPredecessortorootand it had not to be excluded due tosubgraphproperties.
- 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()
- final def hasSuccessor[U](potentialSuccessor: (GraphLike.this)#NodeT)(implicit visitor: ((GraphLike.this)#NodeT) => U = empty): Boolean
Checks whether
potentialSuccessoris a successor of this node considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.Checks whether
potentialSuccessoris a successor of this node considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method. Same asisPredecessorOf.- 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
trueif a path exists from this node topotentialSuccessorand it had not to be excluded due to asubgraph*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()
- def hashCode(): Int
- Definition Classes
- InnerNode → AnyRef → Any
- final def inNeighbors: Set[(GraphLike.this)#NodeT]
Synonym for
diPredecessors.Synonym for
diPredecessors.- Definition Classes
- InnerNode
- Annotations
- @inline()
- final def innerEdgeTraverser(implicit parameters: Parameters = Parameters()): (GraphLike.this)#InnerEdgeTraverser
Instantiates an InnerEdgeTraverser which extends
scala.collection.Iterablewith elements of typeEdgeTand sets itsrootto this node.Instantiates an InnerEdgeTraverser which extends
scala.collection.Iterablewith elements of typeEdgeTand sets itsrootto this node. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.- parameters
The properties controlling subsequent traversals.
- Definition Classes
- TraverserInnerNode
- Annotations
- @inline()
- final def innerElemTraverser(implicit parameters: Parameters = Parameters()): (GraphLike.this)#InnerElemTraverser
Instantiates an InnerElemTraverser which extends
scala.collection.Iterablewith elements of typeInnerElemand sets itsrootto this node.Instantiates an InnerElemTraverser which extends
scala.collection.Iterablewith elements of typeInnerElemand sets itsrootto this node. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.- parameters
The properties controlling subsequent traversals.
- Definition Classes
- TraverserInnerNode
- Annotations
- @inline()
- final def innerNodeDownUpTraverser(implicit parameters: Parameters = Parameters()): (GraphLike.this)#InnerNodeDownUpTraverser
Instantiates an InnerNodeDownUpTraverser which extends
scala.collection.Iterablewith elements of type(Boolean, NodeT)and sets itsrootto this node.Instantiates an InnerNodeDownUpTraverser which extends
scala.collection.Iterablewith elements of type(Boolean, NodeT)and sets itsrootto this node. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.- parameters
The properties controlling subsequent traversals.
- Definition Classes
- TraverserInnerNode
- Annotations
- @inline()
- final def innerNodeTraverser(implicit parameters: Parameters = Parameters()): (GraphLike.this)#InnerNodeTraverser
Instantiates an InnerNodeTraverser which extends
scala.collection.Iterablewith elements of typeNodeTand sets itsrootto this node.Instantiates an InnerNodeTraverser which extends
scala.collection.Iterablewith elements of typeNodeTand sets itsrootto this node. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.- parameters
The properties controlling subsequent traversals.
- Definition Classes
- TraverserInnerNode
- Annotations
- @inline()
- final def isConnectedWith[U](potentialConnected: (GraphLike.this)#NodeT)(implicit visitor: ((GraphLike.this)#NodeT) => U = empty): Boolean
Checks whether
potentialConnectedis a node (not necessarily directly) connected withrootby 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 anywith*method.Checks whether
potentialConnectedis a node (not necessarily directly) connected withrootby 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 anywith*method. For directed or mixed graphs it is satisfactory thatpotentialConnectedis weakly connected withroot.- 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
trueif a path exists from this node topotentialConnectedand it had not to be excluded due tosubgraphproperties.
- 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()
- def isDefined: Boolean
- Definition Classes
- Param
- final def isEdge: Boolean
- Definition Classes
- Param
- def isIn: Boolean
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- final def isIsolated: Boolean
trueif this node's degree equals to 0.trueif this node's degree equals to 0.- Definition Classes
- InnerNode
- Annotations
- @inline()
- final def isLeaf: Boolean
trueif this node's degree equals to 1.trueif this node's degree equals to 1.- Definition Classes
- InnerNode
- Annotations
- @inline()
- def isNode: Boolean
- Definition Classes
- NodeParam
- final def isOut: Boolean
- Definition Classes
- Param
- 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()
- 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()
- val n1: (GraphLike.this)#InnerNode
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#InnerNode toEdgeAssoc[(GraphLike.this)#InnerNode] performed by method EdgeAssoc in scalax.collection.GraphPredef.
- Definition Classes
- EdgeAssoc
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
- final def outNeighbors: Set[(GraphLike.this)#NodeT]
Synonym for
diSuccessors.Synonym for
diSuccessors.- Definition Classes
- InnerNode
- Annotations
- @inline()
- final def outerEdgeTraverser(implicit parameters: Parameters = Parameters()): (GraphLike.this)#OuterEdgeTraverser
Instantiates an OuterEdgeTraverser which extends
scala.collection.Iterablewith elements of typeE[N]and sets itsrootto this node.Instantiates an OuterEdgeTraverser which extends
scala.collection.Iterablewith elements of typeE[N]and sets itsrootto this node. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.- parameters
The properties controlling subsequent traversals.
- Definition Classes
- TraverserInnerNode
- Annotations
- @inline()
- final def outerElemTraverser(implicit parameters: Parameters = Parameters()): (GraphLike.this)#OuterElemTraverser
Instantiates an OuterElemTraverser which extends
scala.collection.Iterablewith elements of typeOuterElemand sets itsrootto this node.Instantiates an OuterElemTraverser which extends
scala.collection.Iterablewith elements of typeOuterElemand sets itsrootto this node. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.- parameters
The properties controlling subsequent traversals.
- Definition Classes
- TraverserInnerNode
- Annotations
- @inline()
- final def outerNodeDownUpTraverser(implicit parameters: Parameters = Parameters()): (GraphLike.this)#OuterNodeDownUpTraverser
Instantiates an OuterNodeDownUpTraverser which extends
scala.collection.Iterablewith elements of type(Boolean, N)and sets itsrootto this node.Instantiates an OuterNodeDownUpTraverser which extends
scala.collection.Iterablewith elements of type(Boolean, N)and sets itsrootto this node. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.- parameters
The properties controlling subsequent traversals.
- Definition Classes
- TraverserInnerNode
- Annotations
- @inline()
- final def outerNodeTraverser(implicit parameters: Parameters = Parameters()): (GraphLike.this)#OuterNodeTraverser
Instantiates an OuterNodeTraverser which extends
scala.collection.Iterablewith elements of typeNand sets itsrootto this node.Instantiates an OuterNodeTraverser which extends
scala.collection.Iterablewith elements of typeNand sets itsrootto this node. To start a traversal call one of the graph traversal methods or any appropriate method inherited from scala.collection.Iterable on this instance.- parameters
The properties controlling subsequent traversals.
- Definition Classes
- TraverserInnerNode
- Annotations
- @inline()
- def partOfCycle[U](implicit visitor: ((GraphLike.this)#NodeT) => U = empty): Option[(GraphLike.this)#Cycle]
Finds a cycle that contains
roottaking optional properties like subgraph restriction, ordering or maximum depth into account..Finds a cycle that contains
roottaking optional properties like subgraph restriction, ordering or maximum depth into account.. Irrespective of the current setting forkind,DepthFirstis used internally.- visitor
An optional function that is applied for its side-effect to every element visited during graph traversal.
- returns
A cycle containing
rootorNoneif either- there exists no cycle containing
rootor - there exists such a cycle but due to withSubgraph settings this path was out of scope.
- there exists no cycle containing
- 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
- final def pathTo[U](potentialSuccessor: (GraphLike.this)#NodeT)(implicit visitor: ((GraphLike.this)#NodeT) => U = empty): Option[(GraphLike.this)#Path]
Finds a path from
roottopotentialSuccessorconsidering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.Finds a path from
roottopotentialSuccessorconsidering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*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
potentialSuccessororNoneif either- there is no node with
predor - there exists no path to such a node
- there is no node with
- 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
- def pathUntil[U](pred: (GraphLike.this)#NodeFilter)(implicit visitor: ((GraphLike.this)#NodeT) => U = empty): Option[(GraphLike.this)#Path]
Finds a path from
rootto a successor ofrootfor whichpredholds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.Finds a path from
rootto a successor ofrootfor whichpredholds considering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.rootitself 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
predorNoneif either- there is no node with
predor - there exists no path to such a node or
- there exists a path to such a node but due to withSubgraph settings this path was out of scope.
- there is no node with
- 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
- def pipe[B](f: ((GraphLike.this)#InnerNode) => B): B
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#InnerNode toChainingOps[(GraphLike.this)#InnerNode] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- def productElementNames: Iterator[String]
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#InnerNode toOuterNode[(GraphLike.this)#InnerNode] performed by method anyToNode in scalax.collection.GraphPredef.
- Definition Classes
- Product
- 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
- val self: (GraphLike.this)#InnerNode
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#InnerNode toChainingOps[(GraphLike.this)#InnerNode] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- 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
roottopotentialSuccessorconsidering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.Finds the shortest path from
roottopotentialSuccessorconsidering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method. The calculation is based on the weight of the edges on the path. Edges have a default weight of1Lthat can be overridden by custom edges. A weight function yielding any numeric type may also be passed toshortestPathTo.- 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
potentialSuccessororNoneif either- there exists no path to
potentialSuccessoror - there exists a path to
potentialSuccessorbut due to withSubgraph settings this path was out of scope.
- there exists no path to
- 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()
- final def shortestPathTo[U](potentialSuccessor: (GraphLike.this)#NodeT)(implicit visitor: ((GraphLike.this)#NodeT) => U = empty): Option[(GraphLike.this)#Path]
Finds the shortest path from
roottopotentialSuccessorconsidering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.Finds the shortest path from
roottopotentialSuccessorconsidering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method. The calculation is based on the weight of the edges on the path. Edges have a default weight of1Lthat can be overridden by custom edges. A weight function yielding any numeric type may also be passed toshortestPathTo.- 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
potentialSuccessororNoneif either- there exists no path to
potentialSuccessoror - there exists a path to
potentialSuccessorbut due to withSubgraph settings this path was out of scope.
- there exists no path to
- 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()
- 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
roottopotentialSuccessorconsidering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method.Finds the shortest path from
roottopotentialSuccessorconsidering all traversal properties passed to the traverser factory method like scalax.collection.GraphTraversal#innerNodeTraverser or altered by anywith*method. The calculation is based on the weight of the edges on the path. Edges have a default weight of1Lthat can be overridden by custom edges. A weight function yielding any numeric type may also be passed toshortestPathTo.- 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
potentialSuccessororNoneif either- there exists no path to
potentialSuccessoror - there exists a path to
potentialSuccessorbut due to withSubgraph settings this path was out of scope.
- there exists no path to
- 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
- def stringPrefix: String
- Definition Classes
- NodeParam
- 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
componentTraverserfor more control by means ofFluentProperties.- 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
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def tap[U](f: ((GraphLike.this)#InnerNode) => U): (GraphLike.this)#InnerNode
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#InnerNode toChainingOps[(GraphLike.this)#InnerNode] performed by method ChainingOps in scalax.collection.
- Definition Classes
- ChainingOps
- 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
- final def toNodeT[N <: N, E[+X] <: EdgeLikeIn[X], G <: GraphBase[N, E]](g: G)(f: (GraphBase.NodeT) => GraphPredef.InnerNodeParam.toNodeT.G.NodeT): GraphPredef.InnerNodeParam.toNodeT.G.NodeT
- Definition Classes
- InnerNodeParam
- final def toOuter: N
Synonym for
value.Synonym for
value.- Definition Classes
- InnerNode
- Annotations
- @inline()
- def toString(): String
- Definition Classes
- NodeParam → AnyRef → Any
- def topologicalSort[U](ignorePredecessors: Boolean = false)(implicit visitor: ((GraphLike.this)#InnerElem) => U = empty): (GraphLike.this)#TopologicalSort
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
componentTraverserfor more control by means ofFluentProperties.- ignorePredecessors
If
true, the topological sort will be partial in that it will only include successors ofroot.withSubgraphrestricts 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
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- 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
componentTraverserfor more control by means ofFluentProperties.- 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
- final def withDirection(direction: Direction): (GraphLike.this)#InnerNodeTraverser
Creates a new FluentProperties based on
thisexcept for an updateddirection.Creates a new FluentProperties based on
thisexcept for an updateddirection. Note that methods returning a Cycle or Path accept onlySuccessors.- 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
- final def withKind(kind: Kind): (GraphLike.this)#InnerNodeTraverser
Creates a new FluentProperties based on
thisexcept for an updatedkind.Creates a new FluentProperties based on
thisexcept for an updatedkind.- 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
- final def withMaxDepth(maxDepth: Int): (GraphLike.this)#InnerNodeTraverser
Creates a new FluentProperties based on
thisexcept for an updatedmaxDepth.Creates a new FluentProperties based on
thisexcept for an updatedmaxDepth.- 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
- final def withMaxWeight(max: Long): (GraphLike.this)#InnerNodeTraverser
Creates a new FluentProperties based on
thisexcept for an updatedmaxWeighthaving the givenmaxand the default weight function returningedge.weight.Creates a new FluentProperties based on
thisexcept for an updatedmaxWeighthaving the givenmaxand the default weight function returningedge.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
- final def withMaxWeight[W](max: W, edgeWeight: ((GraphLike.this)#EdgeT) => W)(implicit arg0: Numeric[W]): (GraphLike.this)#InnerNodeTraverser
Creates a new FluentProperties based on
thisexcept for an updatedmaxWeighthaving the givenmaxvalue and the given weight function.Creates a new FluentProperties based on
thisexcept for an updatedmaxWeighthaving the givenmaxvalue 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
- def withMaxWeight(maxWeight: Option[(GraphLike.this)#Weight]): (GraphLike.this)#InnerNodeTraverser
Creates a new FluentProperties based on
thisexcept for an updatedmaxWeight.Creates a new FluentProperties based on
thisexcept for an updatedmaxWeight.- 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
- final def withOrdering(ordering: (GraphLike.this)#ElemOrdering): (GraphLike.this)#InnerNodeTraverser
Creates a new FluentProperties based on
thisexcept for an updatedordering.Creates a new FluentProperties based on
thisexcept for an updatedordering.- 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
- final def withParameters(parameters: Parameters): (GraphLike.this)#InnerNodeTraverser
Creates a new FluentProperties based on
thisexcept for an updatedparameters.Creates a new FluentProperties based on
thisexcept for an updatedparameters.- 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
- final def withRoot(root: (GraphLike.this)#NodeT): (GraphLike.this)#InnerNodeTraverser
Creates a new FluentProperties based on
thisexcept for an updatedroot.Creates a new FluentProperties based on
thisexcept for an updatedroot.- 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
- final def withSubgraph(nodes: (GraphLike.this)#NodeFilter = anyNode, edges: (GraphLike.this)#EdgeFilter = anyEdge): (GraphLike.this)#InnerNodeTraverser
Creates a new FluentProperties based on
thisexcept for an updatedsubgraphNodesand/orsubgraphEdges.Creates a new FluentProperties based on
thisexcept for an updatedsubgraphNodesand/orsubgraphEdges.- 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
- final def ~: ExtSet[(GraphLike.this)#EdgeT]
Synonym for
edges.Synonym for
edges.- Definition Classes
- InnerNode
- Annotations
- @inline()
- 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()
- final def ~>: Set[(GraphLike.this)#EdgeT] with FilterableSet[(GraphLike.this)#EdgeT]
Synonym for
outgoing.Synonym for
outgoing.- Definition Classes
- InnerNode
- Annotations
- @inline()
- final def ~>?(to: (GraphLike.this)#NodeT): Option[(GraphLike.this)#EdgeT]
Synonym for
findOutgoingTo.Synonym for
findOutgoingTo.- Definition Classes
- InnerNode
- Annotations
- @inline()
- final def ~>|: Set[(GraphLike.this)#NodeT]
Synonym for
diSuccessors.Synonym for
diSuccessors.- Definition Classes
- InnerNode
- Annotations
- @inline()
- final def ~|: Set[(GraphLike.this)#NodeT]
Synonym for
neighbors.Synonym for
neighbors.- Definition Classes
- InnerNode
- Annotations
- @inline()
Shadowed Implicit Value Members
- def isDefined: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#InnerNode toOuterNode[(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
- final def isEdge: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#InnerNode toOuterNode[(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
- def isIn: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#InnerNode toOuterNode[(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
- InParam → Param
- def isNode: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#InnerNode toOuterNode[(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
- final def isOut: Boolean
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#InnerNode toOuterNode[(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
- def stringPrefix: String
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#InnerNode toOuterNode[(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
- def toString(): String
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#InnerNode toOuterNode[(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
- val value: (GraphLike.this)#InnerNode
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#InnerNode toOuterNode[(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
- OuterNode → NodeParam
- def ~[N >: N1](n2: N): UnDiEdge[N]
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#InnerNode toEdgeAssoc[(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()
- def ~>[N >: N1](n2: N): DiEdge[N]
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#InnerNode toEdgeAssoc[(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()
Deprecated Value Members
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable]) @Deprecated
- Deprecated
- def formatted(fmtstr: String): String
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#InnerNode toStringFormat[(GraphLike.this)#InnerNode] performed by method StringFormat in scala.Predef.
- Definition Classes
- StringFormat
- Annotations
- @deprecated @inline()
- Deprecated
(Since version 2.12.16) Use
formatString.format(value)instead ofvalue.formatted(formatString), or use thef""string interpolator. In Java 15 and later,formattedresolves to the new method in String which has reversed parameters.
- def →[B](y: B): ((GraphLike.this)#InnerNode, B)
- Implicit
- This member is added by an implicit conversion from (GraphLike.this)#InnerNode toArrowAssoc[(GraphLike.this)#InnerNode] performed by method ArrowAssoc in scala.Predef.
- Definition Classes
- ArrowAssoc
- Annotations
- @deprecated
- Deprecated
(Since version 2.13.0) Use
->instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.
Welcome to the Graph for Scala API reference. Some suggested navigation entry points:
Graphmutable.Graphand its inner nodes.GraphEdgeobjectedgepackageGraphPredefobject andImplicitsobject.GraphTraversalandTraverserInnerNode.RandomGraph.GraphGen.