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
|
class Graph {
// inner class
// to keep track of edges
class Edge {
int src, dest;
}
// number of vertices and edges
int vertices, edges;
// array to store all edges
Edge[] edge;
Graph(int vertices, int edges) {
this.vertices = vertices;
this.edges = edges;
// initialize the edge array
edge = new Edge[edges];
for(int i = 0; i < edges; i++) {
// each element of the edge array
// is an object of Edge type
edge[i] = new Edge();
}
}
public static void main(String[] args) {
// create an object of Graph class
int noVertices = 5;
int noEdges = 8;
Graph g = new Graph(noVertices, noEdges);
// create graph
g.edge[0].src = 1; // edge 1---2
g.edge[0].dest = 2;
g.edge[1].src = 1; // edge 1---3
g.edge[1].dest = 3;
g.edge[2].src = 1; // edge 1---4
g.edge[2].dest = 4;
g.edge[3].src = 2; // edge 2---4
g.edge[3].dest = 4;
g.edge[4].src = 2; // edge 2---5
g.edge[4].dest = 5;
g.edge[5].src = 3; // edge 3---4
g.edge[5].dest = 4;
g.edge[6].src = 3; // edge 3---5
g.edge[6].dest = 5;
g.edge[7].src = 4; // edge 4---5
g.edge[7].dest = 5;
// print graph
for(int i = 0; i < noEdges; i++) {
System.out.println(g.edge[i].src + " - " + g.edge[i].dest);
}
}
}
|
