DFS (Depth first search algorithm) 

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
import java.util.ArrayList;
import java.util.Iterator;
import java.util.LinkedList;

public class DFS {
	private int V;

	private LinkedList[] adj = new LinkedList[6];

	DFS(int v) {
		V = v;
		for (int i = 0; i < v; i++) {
			adj[i] = new LinkedList();
		}
	}

	public static void main(String[] args) {
		DFS depth = new DFS(4);
		depth.addEdge(0, 1);
		depth.addEdge(0, 2);
		depth.addEdge(1, 2);
		depth.addEdge(2, 0);
		depth.addEdge(2, 3);
		depth.addEdge(3, 3);

		depth.dfs(2);
	}

	public void addEdge(int v, int w) {
		adj[v].add(w);
	}

	public void dfs(int v) {
		boolean[] visited = new boolean[V];
		dfsUtil(v, visited);
	}

	public void dfsUtil(int v, boolean[] visited) {
		visited[v] = true;
		System.out.println(v + " ");
		Iterator<Integer> it = adj[v].listIterator();
		while (it.hasNext()) {
			int k = it.next();
			if (!visited[k]) {
				dfsUtil(k, visited);
			}
		}
	}
}
Output: 
2
0
1
3

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)