DFS of EdgeWeightedGraph

DFS.java

static class DFS{
    boolean[] marked;
    
    public DFS(EdgeWeightedGraph G, int source){
        marked = new boolean[G.noOfVertices];
        dfs(G,source);
    }
    
    public void dfs(EdgeWeightedGraph G, int v){
        marked[v] = true;
        for(int w : G.getAdjVertices(v)){
            if(!marked[w]){
                dfs(G,w);
            }
        }
    }
    
    public boolean hasPathTo(int v){
       return marked[v];
    }
}