public class NonrecursiveDFS extends Object
NonrecursiveDFSclass represents a data type for finding the vertices connected to a source vertex s in the undirected graph.
This implementation uses a nonrecursive version of depth-first search
with an explicit stack.
DepthFirstSearch for the classic recursive version.
The constructor takes Θ(V + E) time in the worst
case, where V is the number of vertices and E is the
number of edges.
marked(int) instance method takes Θ(1) time.
It uses Θ(V) extra space (not including the graph).
For additional documentation, see Section 4.1 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.
|Constructor and Description|
Computes the vertices connected to the source vertex
|Modifier and Type||Method and Description|
Unit tests the
public boolean marked(int v)
vconnected to the source vertex
v- the vertex
vis connected to the source vertex
0 <= v < V
public static void main(String args)
args- the command-line arguments