类 DepthFirstPaths
- java.lang.Object
-
- edu.princeton.cs.algs4.DepthFirstPaths
-
public class DepthFirstPaths extends java.lang.ObjectTheDepthFirstPathsclass represents a data type for finding paths from a source vertex s to every other vertex in an undirected graph.This implementation uses depth-first search. The constructor takes time proportional to V + E, where V is the number of vertices and E is the number of edges. Each call to
hasPathTo(int)takes constant time; each call topathTo(int)takes time proportional to the length of the path. 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.
-
-
构造器概要
构造器 构造器 说明 DepthFirstPaths(Graph G, int s)Computes a path betweensand every other vertex in graphG.
-
方法概要
修饰符和类型 方法 说明 booleanhasPathTo(int v)Is there a path between the source vertexsand vertexv?static voidmain(java.lang.String[] args)Unit tests theDepthFirstPathsdata type.java.lang.Iterable<java.lang.Integer>pathTo(int v)Returns a path between the source vertexsand vertexv, ornullif no such path.
-
-
-
构造器详细资料
-
DepthFirstPaths
public DepthFirstPaths(Graph G, int s)
Computes a path betweensand every other vertex in graphG.- 参数:
G- the graphs- the source vertex- 抛出:
java.lang.IllegalArgumentException- unless0 <= s < V
-
-
方法详细资料
-
hasPathTo
public boolean hasPathTo(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
-
pathTo
public java.lang.Iterable<java.lang.Integer> pathTo(int v)
Returns a path between the source vertexsand vertexv, ornullif no such path.- 参数:
v- the vertex- 返回:
- the sequence of vertices on a path between the source vertex
sand vertexv, as an Iterable - 抛出:
java.lang.IllegalArgumentException- unless0 <= v < V
-
main
public static void main(java.lang.String[] args)
Unit tests theDepthFirstPathsdata type.- 参数:
args- the command-line arguments
-
-