2 * ============LICENSE_START=======================================================
4 * ================================================================================
5 * Copyright (C) 2019 Nokia. All rights reserved.
6 * ================================================================================
7 * Licensed under the Apache License, Version 2.0 (the "License");
8 * you may not use this file except in compliance with the License.
9 * You may obtain a copy of the License at
11 * http://www.apache.org/licenses/LICENSE-2.0
13 * Unless required by applicable law or agreed to in writing, software
14 * distributed under the License is distributed on an "AS IS" BASIS,
15 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
16 * See the License for the specific language governing permissions and
17 * limitations under the License.
18 * ============LICENSE_END=========================================================
20 package org.openecomp.sdc.be.dao.neo4j;
22 import static com.google.code.beanmatchers.BeanMatchers.hasValidGettersAndSetters;
23 import static org.junit.Assert.assertEquals;
24 import static org.junit.Assert.assertThat;
26 import org.junit.Test;
27 import org.openecomp.sdc.be.resources.data.ArtifactData;
29 public class GraphNeighbourTableTest {
31 public void shouldHaveValidGettersAndSetters() {
32 assertThat(GraphNeighbourTable.class, hasValidGettersAndSetters());
36 public void shouldAddEdge() {
37 GraphNeighbourTable graphNeighbourTable = new GraphNeighbourTable();
38 NodeRelation directedEdge = new NodeRelation(1, 1, null);
39 graphNeighbourTable.addEdge(directedEdge);
40 assertEquals(directedEdge, graphNeighbourTable.getDirectedEdges().get(0));
44 public void shouldAddNode() {
45 GraphNeighbourTable graphNeighbourTable = new GraphNeighbourTable();
46 ArtifactData node = new ArtifactData();
47 int index = graphNeighbourTable.addNode(node);
48 assertEquals(node, graphNeighbourTable.getNodes().get(0));
49 assertEquals(index, 0);