TestBarabasiAlbert (JUNG (parent metadata project) 2.1.1 Test API)

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
```
Author:

W. Giordano, Scott White, James Marchant

Field Summary

Fields
Modifier and Type	Field and Description
`protected com.google.common.base.Supplier<Number>`	`edgeFactory`
`protected int`	`edges_to_add_per_timestep`
`protected com.google.common.base.Supplier<Graph<Integer,Number>>`	`graphFactory`
`protected int`	`init_vertices`
`protected int`	`num_tests`
`protected int`	`num_timesteps`
`protected int`	`random_seed`
`protected com.google.common.base.Supplier<Integer>`	`vertexFactory`

Constructor Summary

Constructors
Constructor and Description

TestBarabasiAlbert()

Constructors
Constructor and Description
`TestBarabasiAlbert()`

Method Summary

All Methods Static Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`protected void`	`setUp()`
`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, createResult, fail, fail, failNotEquals, failNotSame, failSame, format, getName, run, run, runBare, runTest, setName, tearDown, toString

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

- Field Detail
  - graphFactory
```
protected com.google.common.base.Supplier<Graph<Integer,Number>> graphFactory
```
  - vertexFactory
```
protected com.google.common.base.Supplier<Integer> vertexFactory
```
  - edgeFactory
```
protected com.google.common.base.Supplier<Number> edgeFactory
```
  - init_vertices
```
protected int init_vertices
```
  - edges_to_add_per_timestep
```
protected int edges_to_add_per_timestep
```
  - random_seed
```
protected int random_seed
```
  - num_timesteps
```
protected int num_timesteps
```
  - num_tests
```
protected int num_tests
```
- Constructor Detail
  - TestBarabasiAlbert
```
public TestBarabasiAlbert()
```
- Method Detail
  - suite
```
public static junit.framework.Test suite()
```
  - setUp
```
protected void setUp()
```
    Overrides:
    
    setUp in class junit.framework.TestCase
  - 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.

Class TestBarabasiAlbert

Field Summary

Constructor Summary

Method Summary

Methods inherited from class junit.framework.TestCase

Methods inherited from class java.lang.Object

Field Detail

graphFactory

vertexFactory

edgeFactory

init_vertices

edges_to_add_per_timestep

random_seed

num_timesteps

num_tests

Constructor Detail

TestBarabasiAlbert

Method Detail

suite

setUp

testMultigraphCreation

testDirectedMultigraphCreation

testUndirectedMultigraphCreation

testGraphCreation

testDirectedGraphCreation

testUndirectedGraphCreation

testNoSelfLoops

testPreconditions

testEveryNodeHasCorrectMinimumNumberOfEdges

testNotEveryEdgeToOneNode