DSA-in-Java/PrintAllPaths.java at main · shajiyakhan1309/DSA-in-Java · 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
import java.util.*;
//For Youtube Lecture
public class PrintAllPaths {
static class Edge {
int src;
int dest;
public Edge(int s, int d) {
this.src = s;
this.dest = d;
}
}
static void createGraph(ArrayList<Edge> graph[]) {
for(int i=0; i<graph.length; i++) {
graph[i] = new ArrayList<>();
}
graph[0].add(new Edge(0, 1));
graph[0].add(new Edge(0, 2));
graph[1].add(new Edge(1, 0));
graph[1].add(new Edge(1, 3));
graph[2].add(new Edge(2, 0));
graph[2].add(new Edge(2, 4));
graph[3].add(new Edge(3, 1));
graph[3].add(new Edge(3, 4));
graph[3].add(new Edge(3, 5));
graph[4].add(new Edge(4, 2));
graph[4].add(new Edge(4, 3));
graph[4].add(new Edge(4, 5));

graph[5].add(new Edge(5, 3));
graph[5].add(new Edge(5, 4));
graph[5].add(new Edge(5, 6));
graph[6].add(new Edge(6, 5));
}
public static void printAllPaths(ArrayList<Edge> graph[], int src, int tar, String
path, boolean vis[]) {
if(src == tar) {
System.out.println(path);
return;
}
for(int i=0; i<graph[src].size(); i++) {
Edge e = graph[src].get(i);
if(!vis[e.dest]) {
vis[e.dest] = true;
printAllPaths(graph, e.dest, tar, path+"->"+e.dest, vis);
vis[e.dest] = false;
}
}
}
public static void main(String args[]) {
int V = 7;
ArrayList<Edge> graph[] = new ArrayList[V];
createGraph(graph);
int src = 0;
int tar = 5;
boolean vis[] = new boolean[V];
vis[src] = true;
printAllPaths(graph, src, tar, ""+src, vis);
}
}