-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathBinaryWeightGraph.java
More file actions
76 lines (59 loc) · 2.1 KB
/
BinaryWeightGraph.java
File metadata and controls
76 lines (59 loc) · 2.1 KB
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
69
70
71
72
73
74
75
76
import java.util.*;
public class BinaryWeightGraph {
static void shortestPath(int src, Map<Integer, List<Integer> > map, int n) {
int[] dist = new int[n];
int[] prev = new int[n];
dist[src] = 0;
prev[src] = src;
Deque<Integer> dq = new ArrayDeque<> ();
Set<Integer> visited = new HashSet<> ();
dq.addLast(src);
while(!dq.isEmpty()) {
int size = dq.size();
visited.addAll(dq);
while(size > 0) {
size -= 1;
int x = dq.pollFirst();
if(!map.containsKey(x)) continue;
for(int nx: map.get(x)) {
if(visited.contains(nx)) continue;
prev[nx] = x;
dist[nx] = dist[x] + 1;
dq.addLast(nx);
//visited.add(nx);
}
}
}
int target = 4;
System.out.println("shortest distance is: " + dist[target]);
int v = target;
System.out.print("shortest path is: ");
printPath(v, prev, src);
System.out.println();
}
static void printPath(int v, int[] prev, int src) {
if(v == src) {
System.out.print(v + " => ");
return;
}
printPath(prev[v], prev, src);
System.out.print(v + " => ");
}
public static void main(String[] args) {
int n = 9;
Map<Integer, List<Integer> > map = new HashMap<> ();
map.put(0, new ArrayList<>(Arrays.asList(7)));
map.put(1, new ArrayList<>(Arrays.asList(2, 7)));
map.put(2, new ArrayList<>(Arrays.asList(1, 8)));
map.put(3, new ArrayList<>(Arrays.asList(4, 5)));
map.put(4, new ArrayList<>(Arrays.asList(3, 5)));
map.put(5, new ArrayList<>(Arrays.asList(3, 4, 6)));
map.put(6, new ArrayList<>(Arrays.asList(5, 7)));
map.put(7, new ArrayList<>(Arrays.asList(0, 1, 6, 8)));
map.put(8, new ArrayList<>(Arrays.asList(2, 7)));
shortestPath(0, map, n);
// 0 - 7 - 1
// | |
// 6 2
}
}