algorithms/Java/DepthFirstSearch.java at master · AASF-IIITM/algorithms · GitHub

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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
importjava.io.*;
importjava.util.*;
classGraph
{
privateintV; // No. of vertices


privateLinkedList<Integer> adj[];

@SuppressWarnings("unchecked")
Graph(intv)
	{
V = v;
adj = newLinkedList[v];
for (inti=0; i<v; ++i)
adj[i] = newLinkedList();
	}


voidaddEdge(intv, intw)
	{
adj[v].add(w);
	}


voidDFSUtil(intv,booleanvisited[])
	{

visited[v] = true;
System.out.print(v+" ");


Iterator<Integer> i = adj[v].listIterator();
while (i.hasNext())
 {
intn = i.next();
if (!visited[n])
DFSUtil(n, visited);
 }
	}


voidDFS(intv)
	{

booleanvisited[] = newboolean[V];


DFSUtil(v, visited);
	}

publicstaticvoidmain(Stringargs[])
	{
Graphg = newGraph(4);

g.addEdge(0, 1);
g.addEdge(0, 2);
g.addEdge(1, 2);
g.addEdge(2, 0);
g.addEdge(2, 3);
g.addEdge(3, 3);

System.out.println("Following is Depth First Traversal "+
"(starting from vertex 2)");

g.DFS(2);
	}
}
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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
importjava.io.*;
importjava.util.*;
classGraph
{
privateintV; // No. of vertices


privateLinkedList<Integer> adj[];

@SuppressWarnings("unchecked")
Graph(intv)
	{
V = v;
adj = newLinkedList[v];
for (inti=0; i<v; ++i)
adj[i] = newLinkedList();
	}


voidaddEdge(intv, intw)
	{
adj[v].add(w);
	}


voidDFSUtil(intv,booleanvisited[])
	{

visited[v] = true;
System.out.print(v+" ");


Iterator<Integer> i = adj[v].listIterator();
while (i.hasNext())
 {
intn = i.next();
if (!visited[n])
DFSUtil(n, visited);
 }
	}


voidDFS(intv)
	{

booleanvisited[] = newboolean[V];


DFSUtil(v, visited);
	}

publicstaticvoidmain(Stringargs[])
	{
Graphg = newGraph(4);

g.addEdge(0, 1);
g.addEdge(0, 2);
g.addEdge(1, 2);
g.addEdge(2, 0);
g.addEdge(2, 3);
g.addEdge(3, 3);

System.out.println("Following is Depth First Traversal "+
"(starting from vertex 2)");

g.DFS(2);
	}
}
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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
importjava.io.*;
importjava.util.*;
classGraph
{
privateintV; // No. of vertices


privateLinkedList<Integer> adj[];

@SuppressWarnings("unchecked")
Graph(intv)
	{
V = v;
adj = newLinkedList[v];
for (inti=0; i<v; ++i)
adj[i] = newLinkedList();
	}


voidaddEdge(intv, intw)
	{
adj[v].add(w);
	}


voidDFSUtil(intv,booleanvisited[])
	{

visited[v] = true;
System.out.print(v+" ");


Iterator<Integer> i = adj[v].listIterator();
while (i.hasNext())
 {
intn = i.next();
if (!visited[n])
DFSUtil(n, visited);
 }
	}


voidDFS(intv)
	{

booleanvisited[] = newboolean[V];


DFSUtil(v, visited);
	}

publicstaticvoidmain(Stringargs[])
	{
Graphg = newGraph(4);

g.addEdge(0, 1);
g.addEdge(0, 2);
g.addEdge(1, 2);
g.addEdge(2, 0);
g.addEdge(2, 3);
g.addEdge(3, 3);

System.out.println("Following is Depth First Traversal "+
"(starting from vertex 2)");

g.DFS(2);
	}
}
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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
importjava.io.*;
importjava.util.*;
classGraph
{
privateintV; // No. of vertices


privateLinkedList<Integer> adj[];

@SuppressWarnings("unchecked")
Graph(intv)
	{
V = v;
adj = newLinkedList[v];
for (inti=0; i<v; ++i)
adj[i] = newLinkedList();
	}


voidaddEdge(intv, intw)
	{
adj[v].add(w);
	}


voidDFSUtil(intv,booleanvisited[])
	{

visited[v] = true;
System.out.print(v+" ");


Iterator<Integer> i = adj[v].listIterator();
while (i.hasNext())
 {
intn = i.next();
if (!visited[n])
DFSUtil(n, visited);
 }
	}


voidDFS(intv)
	{

booleanvisited[] = newboolean[V];


DFSUtil(v, visited);
	}

publicstaticvoidmain(Stringargs[])
	{
Graphg = newGraph(4);

g.addEdge(0, 1);
g.addEdge(0, 2);
g.addEdge(1, 2);
g.addEdge(2, 0);
g.addEdge(2, 3);
g.addEdge(3, 3);

System.out.println("Following is Depth First Traversal "+
"(starting from vertex 2)");

g.DFS(2);
	}
}
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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
importjava.io.*;
importjava.util.*;
classGraph
{
privateintV; // No. of vertices


privateLinkedList<Integer> adj[];

@SuppressWarnings("unchecked")
Graph(intv)
	{
V = v;
adj = newLinkedList[v];
for (inti=0; i<v; ++i)
adj[i] = newLinkedList();
	}


voidaddEdge(intv, intw)
	{
adj[v].add(w);
	}


voidDFSUtil(intv,booleanvisited[])
	{

visited[v] = true;
System.out.print(v+" ");


Iterator<Integer> i = adj[v].listIterator();
while (i.hasNext())
 {
intn = i.next();
if (!visited[n])
DFSUtil(n, visited);
 }
	}


voidDFS(intv)
	{

booleanvisited[] = newboolean[V];


DFSUtil(v, visited);
	}

publicstaticvoidmain(Stringargs[])
	{
Graphg = newGraph(4);

g.addEdge(0, 1);
g.addEdge(0, 2);
g.addEdge(1, 2);
g.addEdge(2, 0);
g.addEdge(2, 3);
g.addEdge(3, 3);

System.out.println("Following is Depth First Traversal "+
"(starting from vertex 2)");

g.DFS(2);
	}
}
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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
importjava.io.*;
importjava.util.*;
classGraph
{
privateintV; // No. of vertices


privateLinkedList<Integer> adj[];

@SuppressWarnings("unchecked")
Graph(intv)
	{
V = v;
adj = newLinkedList[v];
for (inti=0; i<v; ++i)
adj[i] = newLinkedList();
	}


voidaddEdge(intv, intw)
	{
adj[v].add(w);
	}


voidDFSUtil(intv,booleanvisited[])
	{

visited[v] = true;
System.out.print(v+" ");


Iterator<Integer> i = adj[v].listIterator();
while (i.hasNext())
 {
intn = i.next();
if (!visited[n])
DFSUtil(n, visited);
 }
	}


voidDFS(intv)
	{

booleanvisited[] = newboolean[V];


DFSUtil(v, visited);
	}

publicstaticvoidmain(Stringargs[])
	{
Graphg = newGraph(4);

g.addEdge(0, 1);
g.addEdge(0, 2);
g.addEdge(1, 2);
g.addEdge(2, 0);
g.addEdge(2, 3);
g.addEdge(3, 3);

System.out.println("Following is Depth First Traversal "+
"(starting from vertex 2)");

g.DFS(2);
	}
}
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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
importjava.io.*;
importjava.util.*;
classGraph
{
privateintV; // No. of vertices


privateLinkedList<Integer> adj[];

@SuppressWarnings("unchecked")
Graph(intv)
	{
V = v;
adj = newLinkedList[v];
for (inti=0; i<v; ++i)
adj[i] = newLinkedList();
	}


voidaddEdge(intv, intw)
	{
adj[v].add(w);
	}


voidDFSUtil(intv,booleanvisited[])
	{

visited[v] = true;
System.out.print(v+" ");


Iterator<Integer> i = adj[v].listIterator();
while (i.hasNext())
 {
intn = i.next();
if (!visited[n])
DFSUtil(n, visited);
 }
	}


voidDFS(intv)
	{

booleanvisited[] = newboolean[V];


DFSUtil(v, visited);
	}

publicstaticvoidmain(Stringargs[])
	{
Graphg = newGraph(4);

g.addEdge(0, 1);
g.addEdge(0, 2);
g.addEdge(1, 2);
g.addEdge(2, 0);
g.addEdge(2, 3);
g.addEdge(3, 3);

System.out.println("Following is Depth First Traversal "+
"(starting from vertex 2)");

g.DFS(2);
	}
}
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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
importjava.io.*;
importjava.util.*;
classGraph
{
privateintV; // No. of vertices


privateLinkedList<Integer> adj[];

@SuppressWarnings("unchecked")
Graph(intv)
	{
V = v;
adj = newLinkedList[v];
for (inti=0; i<v; ++i)
adj[i] = newLinkedList();
	}


voidaddEdge(intv, intw)
	{
adj[v].add(w);
	}


voidDFSUtil(intv,booleanvisited[])
	{

visited[v] = true;
System.out.print(v+" ");


Iterator<Integer> i = adj[v].listIterator();
while (i.hasNext())
 {
intn = i.next();
if (!visited[n])
DFSUtil(n, visited);
 }
	}


voidDFS(intv)
	{

booleanvisited[] = newboolean[V];


DFSUtil(v, visited);
	}

publicstaticvoidmain(Stringargs[])
	{
Graphg = newGraph(4);

g.addEdge(0, 1);
g.addEdge(0, 2);
g.addEdge(1, 2);
g.addEdge(2, 0);
g.addEdge(2, 3);
g.addEdge(3, 3);

System.out.println("Following is Depth First Traversal "+
"(starting from vertex 2)");

g.DFS(2);
	}
}