3.无向图（无向图的深度优先搜索）

/**
 * FileName: DepthFirstSearch
 * Author:   Jerry
 * Date:     2020/2/10 20:09
 * Description: 无向图的深度优先搜索
 */
package graph;

public class DepthFirstSearch {
    //标记数组
    private boolean[] marked;
    //遍历结点个数
    private int count;

    public DepthFirstSearch(UndirGraph graph, int s) {
        //默认初始化为false
        marked = new boolean[graph.V()];
        dfs(graph, s);
    }

    /**
     * 针对一个结点的深度搜索
     */
    private void dfs(UndirGraph graph, int s) {
        marked[s] = true;
        count++;
        for (int v : graph.adj(s)) {
            if (!marked[v]) {
                dfs(graph, v);
            }
        }
    }

    /**
     * 返回是否标记过
     *
     * @param w
     * @return
     */
    public boolean getMarked(int w) {
        return marked[w];
    }

    /**
     * 返回标记次数
     *
     * @return
     */
    public int getCount() {
        return count;
    }


}