/*
* Copyright (c) 2010 Mathew Hall.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or
* without modification, are permitted provided that the following conditions
* are met:
*
* Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials provided
* with the distribution.
* Neither the name of the <ORGANIZATION> nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
* CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,
* EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package bunchBridgeTests;
import bunchbridge.BunchFitnessAdaptor;
import org.junit.After;
import org.junit.AfterClass;
import org.junit.Before;
import org.junit.BeforeClass;
import org.junit.Test;
import static org.junit.Assert.*;
import primitives.cluster.ClusterHead;
/**
*
* @author Mathew Hall
*/
public class BunchFitnessAdaptorTest {
private primitives.graph.Graph g;
private primitives.cluster.ClusterHead ch;
@Before
public void setUp() throws Exception {
g = new primitives.graph.Graph();
primitives.graph.Node[] nodes = { new primitives.graph.Node("a"),
new primitives.graph.Node("b"), new primitives.graph.Node("c"),
new primitives.graph.Node("d") };
for (primitives.graph.Node n : nodes) {
g.addNode(n);
}
g.connect(nodes[0], nodes[1]);
g.connect(nodes[1], nodes[2]);
g.connect(nodes[2], nodes[3]);
g.connect(nodes[0], nodes[3]);
ch = new ClusterHead(g);
}
/**
* Test of evaluate method, of class BunchFitnessAdaptor.
*/
@Test
public void testEvaluate() {
BunchFitnessAdaptor instance = new BunchFitnessAdaptor("bunch.TurboMQ");
instance.setTree(ch);
double result = instance.evaluate(ch);
assertTrue(result > 0);
}
}