类 DepthFirstSearch
- java.lang.Object
-
- edu.princeton.cs.algs4.DepthFirstSearch
-
public class DepthFirstSearch extends java.lang.ObjectTheDepthFirstSearchclass represents a data type for determining the vertices connected to a given source vertex s in an undirected graph. For versions that find the paths, seeDepthFirstPathsandBreadthFirstPaths.This implementation uses depth-first search. See
NonrecursiveDFSfor a non-recursive version. The constructor takes time proportional to V + E (in the worst case), 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.
-
-
构造器概要
构造器 构造器 说明 DepthFirstSearch(Graph G, int s)Computes the vertices in graphGthat are connected to the source vertexs.
-
-
-
构造器详细资料
-
DepthFirstSearch
public DepthFirstSearch(Graph G, int s)
Computes the vertices in graphGthat are connected to the source vertexs.- 参数:
G- the graphs- the source vertex- 抛出:
java.lang.IllegalArgumentException- unless0 <= s < V
-
-
方法详细资料
-
marked
public boolean marked(int v)
Is there a path between the source vertexsand vertexv?- 参数:
v- the vertex- 返回:
trueif there is a path,falseotherwise- 抛出:
java.lang.IllegalArgumentException- unless0 <= v < V
-
count
public int count()
Returns the number of vertices connected to the source vertexs.- 返回:
- the number of vertices connected to the source vertex
s
-
main
public static void main(java.lang.String[] args)
Unit tests theDepthFirstSearchdata type.- 参数:
args- the command-line arguments
-
-