1 /*
2 * Grapht, an open source dependency injector.
3 * Copyright 2014-2015 various contributors (see CONTRIBUTORS.txt)
4 * Copyright 2010-2014 Regents of the University of Minnesota
5 *
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU Lesser General Public License as
8 * published by the Free Software Foundation; either version 2.1 of the
9 * License, or (at your option) any later version.
10 *
11 * This program is distributed in the hope that it will be useful, but WITHOUT
12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
13 * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more
14 * details.
15 *
16 * You should have received a copy of the GNU General Public License along with
17 * this program; if not, write to the Free Software Foundation, Inc., 51
18 * Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
19 */
20 package org.grouplens.grapht.graph;
21
22 import org.apache.commons.lang3.tuple.Pair;
23 import org.junit.Test;
24
25 import static org.hamcrest.Matchers.equalTo;
26 import static org.hamcrest.Matchers.hasSize;
27 import static org.hamcrest.Matchers.nullValue;
28 import static org.hamcrest.Matchers.contains;
29 import static org.junit.Assert.assertThat;
30
31 /**
32 * @author <a href="http://www.grouplens.org">GroupLens Research</a>
33 */
34 public class DAGNodeBuilderTest {
35 @Test
36 public void testGetLabel() {
37 DAGNodeBuilder<String,String> bld = DAGNode.newBuilder();
38 assertThat(bld.getLabel(), nullValue());
39 bld.setLabel("foo");
40 assertThat(bld.getLabel(), equalTo("foo"));
41 }
42
43 @Test
44 public void testGetEdges() {
45 DAGNodeBuilder<String,String> bld = DAGNode.newBuilder("foo");
46 assertThat(bld.getEdges(), hasSize(0));
47 DAGNode<String,String> nbr = DAGNode.singleton("bar");
48 bld.addEdge(nbr, "piper");
49 assertThat(bld.getEdges(),
50 contains(Pair.of(nbr, "piper")));
51 DAGNode<String,String> node = bld.build();
52 assertThat(node.getLabel(), equalTo("foo"));
53 assertThat(node.getAdjacentNodes(), contains(nbr));
54 }
55 }