blob: 1c8fb54427262fe7ff1055e28fad957b409d9c01 (
plain)
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
70
|
/*
* Copyright (c) 2017 Cisco and/or its affiliates.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
package io.fd.honeycomb.translate.util;
import static org.junit.Assert.assertEquals;
import static org.junit.Assert.assertFalse;
import static org.junit.Assert.assertTrue;
import java.util.Iterator;
import org.jgrapht.experimental.dag.DirectedAcyclicGraph;
import org.junit.Before;
import org.junit.Test;
import org.opendaylight.yangtools.yang.binding.InstanceIdentifier;
public class YangDAGTest {
private static final InstanceIdentifier<DataObjects.DataObject1> VERTEX_A = DataObjects.DataObject1.IID;
private static final InstanceIdentifier<DataObjects.DataObject2> VERTEX_B = DataObjects.DataObject2.IID;
private YangDAG dag;
@Before
public void setUp() {
dag = new YangDAG();
}
@Test
public void testAddVertex() {
dag.addVertex(VERTEX_A);
final Iterator<InstanceIdentifier<?>> it = dag.iterator();
assertEquals(VERTEX_A, it.next());
assertFalse(it.hasNext());
}
@Test
public void testAddEdge() {
dag.addVertex(VERTEX_A);
dag.addVertex(VERTEX_B);
dag.addEdge(VERTEX_A, VERTEX_B);
final Iterator<InstanceIdentifier<?>> it = dag.iterator();
assertEquals(VERTEX_A, it.next());
assertEquals(VERTEX_B, it.next());
assertFalse(it.hasNext());
}
@Test
public void testAddCycleFails() {
dag.addVertex(VERTEX_A);
dag.addVertex(VERTEX_B);
dag.addEdge(VERTEX_A, VERTEX_B);
try {
dag.addEdge(VERTEX_B, VERTEX_A);
} catch (IllegalArgumentException e) {
assertTrue(e.getCause() instanceof DirectedAcyclicGraph.CycleFoundException);
}
}
}
|