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.
set of all direct successors of this node.
All edges at this node - commonly denoted as E(v).
The outer node as supplied by the user at instantiation time or by adding nodes this graph.
Synonym for incomingFrom
.
Synonym for incomingFrom
.
Synonym for incoming
.
Synonym for incoming
.
Synonym for findIncomingFrom
.
Synonym for findIncomingFrom
.
Synonym for diPredecessors
.
Synonym for diPredecessors
.
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.
A node which is possibly connected with this node.
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.
The Graph
instance this
node is contained in.
The Graph
instance this
node is contained in.
The degree of 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.
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 weekly 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.
The predicate which must hold true for the resulting node.
An optional function that is applied for its side-effect to every element visited during graph traversal.
A node with the predicate pred
or None
if either
pred
orFinds 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.
An optional function that is applied for its side-effect to every element visited during graph traversal.
A cycle or None
if either
root
orAn edge at from
having this node as a successor.
An edge at from
having this node as a successor.
The node being at an edge which has this node as a successor.
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.
An outgoing edge connecting this node with to
.
An outgoing edge connecting this node with to
.
The node which is the end point of an edge starting at this node.
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.
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.
The predicate which must hold true for the resulting node.
An optional function that is applied for its side-effect to every element visited during graph traversal.
A node with the predicate pred
or None
if either
pred
orroot
but due to withSubgraph settings this path was out of scope.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.
The predicate which must hold for the resulting node.
An optional function that is applied for its side-effect to every element visited during graph traversal.
A node with the predicate pred
or None
if either
pred
orChecks whether this node has only hooks or no edges at all.
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
.
The node which is potentially a predecessor of root
.
An optional function that is applied for its side-effect to every element visited during graph traversal.
true
if a path exists from potentialPredecessor
to root
and
it had not to be excluded due to subgraph
properties.
Whether this node has any predecessors.
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
.
The node which is potentially a successor of this node.
An optional function that is applied for its side-effect to every element visited during graph traversal.
true
if a path exists from this node to potentialSuccessor
and
it had not to be excluded due to a subgraph*
restriction.
Whether this node has any successors.
The incoming degree of this node after applying some filters to the incoming edges and predecessors.
The incoming degree of this node.
Synonym for diPredecessors
.
Synonym for diPredecessors
.
Incoming edges of this node.
All incoming edges connecting from
with this node.
All incoming edges connecting from
with this node.
The node with zero, one or more edges having this node as a direct successor.
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.
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.
The properties controlling subsequent traversals.
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.
The properties controlling subsequent traversals.
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.
The properties controlling subsequent traversals.
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.
The properties controlling subsequent traversals.
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
weekly connected with root
.
The node which is potentially connected with root
.
An optional function that is applied for its side-effect to every element visited during graph traversal.
true
if a path exists from this node to potentialConnected
and
it had not to be excluded due to subgraph
properties.
Whether that
is an adjacent (direct successor) to this node.
Whether that
is independent of this node meaning that
there exists no edge connecting this node with that
.
true
if this node's degree equals to 0.
true
if this node's degree equals to 0.
true
if this node's degree equals to 1.
true
if this node's degree equals to 1.
Same as hasSuccessor
.
Same as hasSuccessor
.
Same as hasPredecessor
.
Same as hasPredecessor
.
All adjacent nodes (direct successors and predecessors) of this node, also called open neighborhood excluding this node.
The outgoing degree of this node after applying some filters to the outgoing edges and successors.
The outgoing degree of this node.
Synonym for diSuccessors
.
Synonym for diSuccessors
.
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.
The properties controlling subsequent traversals.
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.
The properties controlling subsequent traversals.
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.
The properties controlling subsequent traversals.
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.
The properties controlling subsequent traversals.
All edges outgoing from this node.
All outgoing edges connecting this node with to
.
All outgoing edges connecting this node with to
.
The node which is the end point of zero, one or more edges starting at this node.
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.
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.
The node a path is to be found to.
An optional function that is applied for its side-effect to every element visited during graph traversal.
A path to potentialSuccessor
or None
if either
pred
orFinds 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.
The predicate which must hold true for the successor.
An optional function that is applied for its side-effect to every element visited during graph traversal.
A path to a node with the predicate pred
or None
if either
pred
orFinds 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
.
The node the shortest path is to be found to.
Function to determine the weight of edges. If supplied, this function takes precedence over edge weights.
The shortest path to potentialSuccessor
or None
if either
potentialSuccessor
orpotentialSuccessor
but due to withSubgraph settings this path was out of scope.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
.
The node the shortest path is to be found to.
An optional function that is applied for its side-effect to every element visited during graph traversal.
The shortest path to potentialSuccessor
or None
if either
potentialSuccessor
orpotentialSuccessor
but due to withSubgraph settings this path was out of scope.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
.
The node the shortest path is to be found to.
Function to determine the weight of edges. If supplied, this function takes precedence over edge weights.
An optional function that is applied for its side-effect to every element visited during graph traversal.
The shortest path to potentialSuccessor
or None
if either
potentialSuccessor
orpotentialSuccessor
but due to withSubgraph settings this path was out of scope.Sorts the component designated by the given node topologically.
Sorts the component designated by the given 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
.
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.
Function to be called for each inner node or inner edge visited during the sort.
Creates a new FluentProperties based on this
except for an updated direction
.
Creates a new FluentProperties based on this
except for an updated direction
.
Creates a new FluentProperties based on this
except for an updated kind
.
Creates a new FluentProperties based on this
except for an updated kind
.
Creates a new FluentProperties based on this
except for an updated maxDepth
.
Creates a new FluentProperties based on this
except for an updated maxDepth
.
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
.
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.
Creates a new FluentProperties based on this
except for an updated maxWeight
.
Creates a new FluentProperties based on this
except for an updated maxWeight
.
Creates a new FluentProperties based on this
except for an updated ordering
.
Creates a new FluentProperties based on this
except for an updated ordering
.
Creates a new FluentProperties based on this
except for an updated parameters
.
Creates a new FluentProperties based on this
except for an updated parameters
.
Creates a new FluentProperties based on this
except for an updated root
.
Creates a new FluentProperties based on this
except for an updated root
.
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
.
Synonym for edges
.
Synonym for edges
.
Synonym for outgoingTo
.
Synonym for outgoingTo
.
Synonym for outgoing
.
Synonym for outgoing
.
Synonym for findOutgoingTo
.
Synonym for findOutgoingTo
.
Synonym for diSuccessors
.
Synonym for diSuccessors
.
Synonym for neighbors
.
Synonym for neighbors
.
(innerNode: OuterNode[(AdjacencyListBase.this)#InnerNode]).isDefined
(innerNode: OuterNode[(AdjacencyListBase.this)#InnerNode]).isEdge
(innerNode: OuterNode[(AdjacencyListBase.this)#InnerNode]).isIn
(innerNode: OuterNode[(AdjacencyListBase.this)#InnerNode]).isNode
(innerNode: OuterNode[(AdjacencyListBase.this)#InnerNode]).isOut
(innerNode: OuterNode[(AdjacencyListBase.this)#InnerNode]).stringPrefix
(innerNode: OuterNode[(AdjacencyListBase.this)#InnerNode]).toString()
(innerNode: OuterNode[(AdjacencyListBase.this)#InnerNode]).value
(innerNode: EdgeAssoc[(AdjacencyListBase.this)#InnerNode]).~(n2)
(innerNode: EdgeAssoc[(AdjacencyListBase.this)#InnerNode]).~>(n2)