NonrecursiveDirectedDFS

java.lang.Object
- edu.princeton.cs.algs4.NonrecursiveDirectedDFS

```
public class NonrecursiveDirectedDFS
extends java.lang.Object
```
The NonrecursiveDirectedDFS class represents a data type for finding the vertices reachable from a source vertex s in the digraph.
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 digraph) proportional to V.
For additional documentation, see Section 4.2 of Algorithms, 4th Edition by Robert Sedgewick and Kevin Wayne.

构造器概要

构造器
构造器说明

NonrecursiveDirectedDFS(Digraph G, int s)
Computes the vertices reachable from the source vertex s in the digraph G.

方法概要

修饰符和类型	方法	说明
`static void`	`main(java.lang.String[] args)`	Unit tests the `NonrecursiveDirectedDFS` data type.
`boolean`	`marked(int v)`	Is vertex `v` reachable from the source vertex `s`?

从类继承的方法 java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- 构造器详细资料
  - NonrecursiveDirectedDFS
```
public NonrecursiveDirectedDFS(Digraph G,
                               int s)
```
    Computes the vertices reachable from the source vertex s in the digraph G.
    
    参数:
    
    G - the digraph
    
    s - the source vertex
    
    抛出:
    
    java.lang.IllegalArgumentException - unless 0 <= s < V
- 方法详细资料
  - marked
```
public boolean marked(int v)
```
    Is vertex v reachable from the source vertex s?
    
    参数:
    
    v - the vertex
    
    返回:
    
    true if vertex v is reachable from the source vertex s, and false otherwise
    
    抛出:
    
    java.lang.IllegalArgumentException - unless 0 <= v < V
  - main
```
public static void main(java.lang.String[] args)
```
    Unit tests the NonrecursiveDirectedDFS data type.
    
    参数:
    
    args - the command-line arguments