edu.princeton.cs.algs4

Class NonrecursiveDFS

java.lang.Object

edu.princeton.cs.algs4.NonrecursiveDFS

public class NonrecursiveDFS
extends java.lang.Object

The NonrecursiveDFS class 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. The constructor takes time proportional to V + E, where V is the number of vertices and E is the number of edges. It uses extra space (not including the graph) proportional to V.

For additional documentation, see Section 4.1 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.

Constructor Summary

Constructors

Constructor and Description
NonrecursiveDFS(Graph G, int s) Computes the vertices connected to the source vertex s in the graph G.

Method Summary

Modifier and Type	Method and Description
static void	main(java.lang.String[] args) Unit tests the NonrecursiveDFS data type.
boolean	marked(int v) Is vertex v connected to the source vertex s?

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

NonrecursiveDFS

public NonrecursiveDFS(Graph G,
                       int s)

Computes the vertices connected to the source vertex s in the graph G.

Parameters:

G - the graph

s - the source vertex

Throws:

java.lang.IllegalArgumentException - unless 0 <= s < V

Method Detail

marked

public boolean marked(int v)

Is vertex v connected to the source vertex s?

Parameters:

v - the vertex

Returns:

true if vertex v is connected to the source vertex s, and false otherwise

Throws:

java.lang.IllegalArgumentException - unless 0 <= v < V

main

public static void main(java.lang.String[] args)

Unit tests the NonrecursiveDFS data type.

Parameters:

args - the command-line arguments