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
|
/*
* Copyright 2019 Oath Inc. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
*/
package com.yahoo.container.di.componentgraph.cycle;
import org.junit.Rule;
import org.junit.Test;
import org.junit.rules.ExpectedException;
import static com.yahoo.container.di.componentgraph.cycle.GraphTest.Vertices.A;
import static com.yahoo.container.di.componentgraph.cycle.GraphTest.Vertices.B;
import static com.yahoo.container.di.componentgraph.cycle.GraphTest.Vertices.C;
import static org.hamcrest.CoreMatchers.is;
import static org.hamcrest.Matchers.contains;
import static org.hamcrest.Matchers.containsInAnyOrder;
import static org.hamcrest.Matchers.empty;
import static org.junit.Assert.assertThat;
/**
* @author gjoranv
*/
public class GraphTest {
enum Vertices {A, B, C}
@Rule
public ExpectedException expectedException = ExpectedException.none();
@Test
public void vertices_and_edges_are_added_and_can_be_retrieved() {
var graph = new Graph<Vertices>();
graph.edge(A, B);
graph.edge(B, C);
graph.edge(A, C);
assertThat(graph.getVertices().size(), is(3));
assertThat(graph.getAdjacent(A), containsInAnyOrder(B, C));
assertThat(graph.getAdjacent(B), containsInAnyOrder(C));
assertThat(graph.getAdjacent(C), empty());
}
@Test
public void null_vertices_are_not_allowed() {
var graph = new Graph<Vertices>();
expectedException.expect(IllegalArgumentException.class);
expectedException.expectMessage("Null vertices are not allowed");
graph.edge(A, null);
}
@Test
public void duplicate_edges_are_ignored() {
var graph = new Graph<Vertices>();
graph.edge(A, B);
graph.edge(A, B);
assertThat(graph.getAdjacent(A).size(), is(1));
}
@Test
public void self_edges_are_allowed() {
var graph = new Graph<Vertices>();
graph.edge(A, A);
assertThat(graph.getAdjacent(A), contains(A));
}
}
|
