package breadthfirstpaths;
import edu.princeton.cs.algs4.Graph;
import edu.princeton.cs.algs4.Queue;
import edu.princeton.cs.algs4.Stack;
public class BreadthFirstPaths {
private boolean[] marked; //到达该顶点的最短路径是否已知
private int[] edgeTo; //到达该顶点的已知路径上的最后一个顶点
private final int s; //起点
public BreadthFirstPaths(Graph G