Graph-API/DirectedGraph.java at master · MicBrain/Graph-API · 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
packagegraph;

importjava.util.ArrayList;

/* See restrictions in Graph.java. */

/** Represents a general unlabeled directed graph whose vertices are denoted by
 * positive integers. Graphs may have self edges.
 *
 * @author Rafayel Mkrtchyan
 */
publicclassDirectedGraphextendsGraphObj {

@Override
publicbooleanisDirected() {
returntrue;
 }

@Override
publicintinDegree(intv) {
intcount = 0;
for (intkey : getSuccessorData().keySet()) {
if (getSuccessorData().get(key).contains(v)) {
count++;
 }
 }
returncount;
 }

@Override
publicintpredecessor(intv, intk) {
if (!contains(v)) {
return0;
 }
if (k >= getPredecessorData().get(v).size() || k < 0) {
return0;
 }
returngetPredecessorData().get(v).get(k);
 }

@Override
publicIteration<Integer> predecessors(intv) {
if (!contains(v)) {
returnIteration.iteration(newArrayList<Integer>());
 } else {
returnIteration.iteration(getPredecessorData().get(v));
 }
 }
}
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
packagegraph;

importjava.util.ArrayList;

/* See restrictions in Graph.java. */

/** Represents a general unlabeled directed graph whose vertices are denoted by
 * positive integers. Graphs may have self edges.
 *
 * @author Rafayel Mkrtchyan
 */
publicclassDirectedGraphextendsGraphObj {

@Override
publicbooleanisDirected() {
returntrue;
 }

@Override
publicintinDegree(intv) {
intcount = 0;
for (intkey : getSuccessorData().keySet()) {
if (getSuccessorData().get(key).contains(v)) {
count++;
 }
 }
returncount;
 }

@Override
publicintpredecessor(intv, intk) {
if (!contains(v)) {
return0;
 }
if (k >= getPredecessorData().get(v).size() || k < 0) {
return0;
 }
returngetPredecessorData().get(v).get(k);
 }

@Override
publicIteration<Integer> predecessors(intv) {
if (!contains(v)) {
returnIteration.iteration(newArrayList<Integer>());
 } else {
returnIteration.iteration(getPredecessorData().get(v));
 }
 }
}
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
packagegraph;

importjava.util.ArrayList;

/* See restrictions in Graph.java. */

/** Represents a general unlabeled directed graph whose vertices are denoted by
 * positive integers. Graphs may have self edges.
 *
 * @author Rafayel Mkrtchyan
 */
publicclassDirectedGraphextendsGraphObj {

@Override
publicbooleanisDirected() {
returntrue;
 }

@Override
publicintinDegree(intv) {
intcount = 0;
for (intkey : getSuccessorData().keySet()) {
if (getSuccessorData().get(key).contains(v)) {
count++;
 }
 }
returncount;
 }

@Override
publicintpredecessor(intv, intk) {
if (!contains(v)) {
return0;
 }
if (k >= getPredecessorData().get(v).size() || k < 0) {
return0;
 }
returngetPredecessorData().get(v).get(k);
 }

@Override
publicIteration<Integer> predecessors(intv) {
if (!contains(v)) {
returnIteration.iteration(newArrayList<Integer>());
 } else {
returnIteration.iteration(getPredecessorData().get(v));
 }
 }
}
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
packagegraph;

importjava.util.ArrayList;

/* See restrictions in Graph.java. */

/** Represents a general unlabeled directed graph whose vertices are denoted by
 * positive integers. Graphs may have self edges.
 *
 * @author Rafayel Mkrtchyan
 */
publicclassDirectedGraphextendsGraphObj {

@Override
publicbooleanisDirected() {
returntrue;
 }

@Override
publicintinDegree(intv) {
intcount = 0;
for (intkey : getSuccessorData().keySet()) {
if (getSuccessorData().get(key).contains(v)) {
count++;
 }
 }
returncount;
 }

@Override
publicintpredecessor(intv, intk) {
if (!contains(v)) {
return0;
 }
if (k >= getPredecessorData().get(v).size() || k < 0) {
return0;
 }
returngetPredecessorData().get(v).get(k);
 }

@Override
publicIteration<Integer> predecessors(intv) {
if (!contains(v)) {
returnIteration.iteration(newArrayList<Integer>());
 } else {
returnIteration.iteration(getPredecessorData().get(v));
 }
 }
}
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
packagegraph;

importjava.util.ArrayList;

/* See restrictions in Graph.java. */

/** Represents a general unlabeled directed graph whose vertices are denoted by
 * positive integers. Graphs may have self edges.
 *
 * @author Rafayel Mkrtchyan
 */
publicclassDirectedGraphextendsGraphObj {

@Override
publicbooleanisDirected() {
returntrue;
 }

@Override
publicintinDegree(intv) {
intcount = 0;
for (intkey : getSuccessorData().keySet()) {
if (getSuccessorData().get(key).contains(v)) {
count++;
 }
 }
returncount;
 }

@Override
publicintpredecessor(intv, intk) {
if (!contains(v)) {
return0;
 }
if (k >= getPredecessorData().get(v).size() || k < 0) {
return0;
 }
returngetPredecessorData().get(v).get(k);
 }

@Override
publicIteration<Integer> predecessors(intv) {
if (!contains(v)) {
returnIteration.iteration(newArrayList<Integer>());
 } else {
returnIteration.iteration(getPredecessorData().get(v));
 }
 }
}
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
packagegraph;

importjava.util.ArrayList;

/* See restrictions in Graph.java. */

/** Represents a general unlabeled directed graph whose vertices are denoted by
 * positive integers. Graphs may have self edges.
 *
 * @author Rafayel Mkrtchyan
 */
publicclassDirectedGraphextendsGraphObj {

@Override
publicbooleanisDirected() {
returntrue;
 }

@Override
publicintinDegree(intv) {
intcount = 0;
for (intkey : getSuccessorData().keySet()) {
if (getSuccessorData().get(key).contains(v)) {
count++;
 }
 }
returncount;
 }

@Override
publicintpredecessor(intv, intk) {
if (!contains(v)) {
return0;
 }
if (k >= getPredecessorData().get(v).size() || k < 0) {
return0;
 }
returngetPredecessorData().get(v).get(k);
 }

@Override
publicIteration<Integer> predecessors(intv) {
if (!contains(v)) {
returnIteration.iteration(newArrayList<Integer>());
 } else {
returnIteration.iteration(getPredecessorData().get(v));
 }
 }
}
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
packagegraph;

importjava.util.ArrayList;

/* See restrictions in Graph.java. */

/** Represents a general unlabeled directed graph whose vertices are denoted by
 * positive integers. Graphs may have self edges.
 *
 * @author Rafayel Mkrtchyan
 */
publicclassDirectedGraphextendsGraphObj {

@Override
publicbooleanisDirected() {
returntrue;
 }

@Override
publicintinDegree(intv) {
intcount = 0;
for (intkey : getSuccessorData().keySet()) {
if (getSuccessorData().get(key).contains(v)) {
count++;
 }
 }
returncount;
 }

@Override
publicintpredecessor(intv, intk) {
if (!contains(v)) {
return0;
 }
if (k >= getPredecessorData().get(v).size() || k < 0) {
return0;
 }
returngetPredecessorData().get(v).get(k);
 }

@Override
publicIteration<Integer> predecessors(intv) {
if (!contains(v)) {
returnIteration.iteration(newArrayList<Integer>());
 } else {
returnIteration.iteration(getPredecessorData().get(v));
 }
 }
}
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
packagegraph;

importjava.util.ArrayList;

/* See restrictions in Graph.java. */

/** Represents a general unlabeled directed graph whose vertices are denoted by
 * positive integers. Graphs may have self edges.
 *
 * @author Rafayel Mkrtchyan
 */
publicclassDirectedGraphextendsGraphObj {

@Override
publicbooleanisDirected() {
returntrue;
 }

@Override
publicintinDegree(intv) {
intcount = 0;
for (intkey : getSuccessorData().keySet()) {
if (getSuccessorData().get(key).contains(v)) {
count++;
 }
 }
returncount;
 }

@Override
publicintpredecessor(intv, intk) {
if (!contains(v)) {
return0;
 }
if (k >= getPredecessorData().get(v).size() || k < 0) {
return0;
 }
returngetPredecessorData().get(v).get(k);
 }

@Override
publicIteration<Integer> predecessors(intv) {
if (!contains(v)) {
returnIteration.iteration(newArrayList<Integer>());
 } else {
returnIteration.iteration(getPredecessorData().get(v));
 }
 }
}