-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathWeight_Adj_List.java
54 lines (42 loc) · 1.21 KB
/
Weight_Adj_List.java
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
import java.util.ArrayList;
public class Weight_Adj_List {
//Edge class
static class Edge {
int src;
int dest;
int wt;
public Edge(int s, int d, int w){
this.src = s;
this.dest = d;
this.wt = w;
}
}
public static void createGraph(ArrayList<Edge> graph[]){
for (int i = 0; i < graph.length; i++) {
graph[i] = new ArrayList<Edge>();
}
graph[0].add(new Edge(0,2,2));
graph[1].add(new Edge(1,2,10));
graph[1].add(new Edge(1,3,10));
graph[2].add(new Edge(2,0,2));
graph[2].add(new Edge(2,1,10));
graph[2].add(new Edge(2,3,-1));
graph[3].add(new Edge(3,1,0));
graph[3].add(new Edge(3,2,-1));
}
public static void main(String[] args) {
int V = 4;
ArrayList<Edge> graph[] = new ArrayList[V];
createGraph(graph);
for (int i = 0; i < graph[2].size(); i++) {
Edge e = graph[2].get(i);
System.out.println(+e.dest+ " "+e.wt);
}
}
}
/*
2's neibers
0 2
1 10
3 -1
*/