DiscoveryAndFinishTimeTracker
Related Doc:
package graph
The priority of nodes adding to the queue.
The priority of nodes adding to the queue. BFS adds nodes at the
end and DFS adds nodes at the beginning.
Returns nodes ids that should be added to the queue after visiting node.
Returns nodes ids that should be added to the queue after visiting node.
(Changed in version 2.8.0) collect has changed. The previous behavior can be reproduced with toSeq.
We mark nodes using 3 'colors': Unenqueued, Enqueued, Visited.
We mark nodes using 3 'colors': Unenqueued, Enqueued, Visited.
Initially every node is implicitly marked with Unenqueued.
Node is marked Enqueued, when we add it to the queue. We mark
it Visited just before returning with iterator's next function.
Depth of visit of a given node.
Depth of visit of a given node.
direction in which to traverse
direction in which to traverse
Number of nodes discovered or finished before discovering node with id.
Enqueues nodes added after from node is visited (or None
when equeueing initial nodes).
Enqueues nodes added after from node is visited (or None
when equeueing initial nodes).
Seeks the next node that should be visited.
Seeks the next node that should be visited. We may need to skip some nodes, because it is possible that we add a node to the queue twice.
Takes already visited nodes from the queue. Does not take the next node from the queue (in order to allow hasNext checking).
Number of nodes discovered or finished before finishing node with id.
Traverser only visits node Ids listed in some node's edges, and thus we know that node must exist, safe to assume graph.getNodeById return non-None value
Traverser only visits node Ids listed in some node's edges, and thus we know that node must exist, safe to assume graph.getNodeById return non-None value
the graph to traverse on
the graph to traverse on
the ids of nodes that the walk starts from
the ids of nodes that the walk starts from
If the queue is longer than the number of nodes that can be visited due to
maxSteps bound, cuts the list of nodes that are to be added to the queue
in order not to add too many of them.
If the queue is longer than the number of nodes that can be visited due to
maxSteps bound, cuts the list of nodes that are to be added to the queue
in order not to add too many of them.
Assumes that all nodes in the queue are being visited.
Options to limit traverser walk.
Options to limit traverser walk.
The priority of nodes adding to the queue.
The priority of nodes adding to the queue.
Number of nodes ever enqueued in the queue.
Number of nodes ever enqueued in the queue.
Optional counter of previous nodes to a given node.
Optional counter of previous nodes to a given node.
Performs action needed when visiting a node.
Performs action needed when visiting a node.
Queue that stores nodes to be visited next.
Queue that stores nodes to be visited next.
Set to true to deque a node from the queue before processing.
Set to true to deque a node from the queue before processing.
Checks if the node of a given color should be enqueued.
Checks if the node of a given color should be enqueued.
Action performed when visiting node node (before iteratur retuns node).
Action performed when visiting node node (before iteratur retuns node).
Should be implemented in subclass.
Trait to be mixed in to the BFS/DFS traverser to add discovery and finishing times of a node.
Discovery time of a node is time when the node is added to the queue for the first time.
Finishing time of a node is time just after all
dirneighbors of the node became finished (or when it is visited if it has nodirneighbors that should be processed later).