edu.uci.ics.jung.algorithms.generators.random

Class TestBarabasiAlbert

java.lang.Object

junit.framework.Assert

junit.framework.TestCase

edu.uci.ics.jung.algorithms.generators.random.TestBarabasiAlbert

All Implemented Interfaces:

junit.framework.Test

public class TestBarabasiAlbert
extends junit.framework.TestCase

Constructor Summary

Constructors

Constructor and Description
TestBarabasiAlbert()

Method Summary

Modifier and Type	Method and Description
static junit.framework.Test	suite()
void	testDirectedGraphCreation()
void	testDirectedMultigraphCreation()
void	testEveryNodeHasCorrectMinimumNumberOfEdges() Every node should have an out-degree AT LEAST equal to the number of edges added per timestep (dependent on if it is directed or undirected).
void	testGraphCreation()
void	testMultigraphCreation()
void	testNoSelfLoops() Due to the way the Barabasi-Albert algorithm works there should be no opportunities for the generation of self-loops within the graph.
void	testNotEveryEdgeToOneNode() Check that not every edge goes to one node; the in-degree of any node should be strictly less than the number of edges.
void	testPreconditions()
void	testUndirectedGraphCreation()
void	testUndirectedMultigraphCreation()

Methods inherited from class junit.framework.TestCase

assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertEquals, assertFalse, assertFalse, assertNotNull, assertNotNull, assertNotSame, assertNotSame, assertNull, assertNull, assertSame, assertSame, assertTrue, assertTrue, countTestCases, fail, fail, failNotEquals, failNotSame, failSame, format, getName, run, run, runBare, setName, toString

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

TestBarabasiAlbert

public TestBarabasiAlbert()

Method Detail

suite

public static junit.framework.Test suite()

testMultigraphCreation

public void testMultigraphCreation()

testDirectedMultigraphCreation

public void testDirectedMultigraphCreation()

testUndirectedMultigraphCreation

public void testUndirectedMultigraphCreation()

testGraphCreation

public void testGraphCreation()

testDirectedGraphCreation

public void testDirectedGraphCreation()

testUndirectedGraphCreation

public void testUndirectedGraphCreation()

testNoSelfLoops

public void testNoSelfLoops()

Due to the way the Barabasi-Albert algorithm works there should be no opportunities for the generation of self-loops within the graph.

testPreconditions

public void testPreconditions()

testEveryNodeHasCorrectMinimumNumberOfEdges

public void testEveryNodeHasCorrectMinimumNumberOfEdges()

Every node should have an out-degree AT LEAST equal to the number of edges added per timestep (dependent on if it is directed or undirected).

testNotEveryEdgeToOneNode

public void testNotEveryEdgeToOneNode()

Check that not every edge goes to one node; the in-degree of any node should be strictly less than the number of edges.