Skip to content

Commit 1470ce6

Browse files
committed
resource: update example source
1 parent 825be13 commit 1470ce6

File tree

1 file changed

+15
-14
lines changed

1 file changed

+15
-14
lines changed

src/main/resources/example.java

Lines changed: 15 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -1,51 +1,52 @@
11
package
22
Graph;
33

4-
import java.util.LinkedList;
4+
import java. util .LinkedList;
55

66

77
public class Graph {
88

99
private final int V;private int E ;
1010
private LinkedList<Integer>[] adj;
1111

12-
public Graph(int V)
12+
public Graph(int V)
1313
{
1414
this.V=V;
1515
this.E=0;
1616
adj = (LinkedList <Integer>[ ]) new LinkedList[ V];
1717
for (int v =0; v< V; v ++)
18-
adj[v] = new LinkedList<>();
18+
adj[v ] = new LinkedList< >();
1919
}
2020

21-
public int V( )
22-
{
21+
public int V( )
22+
{
2323

2424

2525

26-
return V;
27-
}
26+
return V;
27+
}
2828

2929
public
3030
int E() {
31-
return E;
31+
return E;
3232
}
3333

3434
public void addEdge(int v, int w) {
35-
adj[v].add( w);
35+
adj[v].add( w);
3636
adj[w ].add(v );
3737
E ++ ;
3838
}
3939

4040
public LinkedList< Integer> adj(int v) {
41-
return adj[v];
41+
return adj[v]
42+
;
4243
}
4344

4445
public int degree( int v,Graph g) {
45-
int count = 0;
46-
for(int s : adj(v) )
47-
count++;
48-
return count;
46+
int count = 0;
47+
for(int s : adj(v) )
48+
count++ ;
49+
return count;
4950
}
5051

5152
}

0 commit comments

Comments
 (0)