edu.uci.ics.jung.random.generators
Interface EvolvingGraphGenerator

All Superinterfaces:

GraphGenerator

All Known Implementing Classes:

BarabasiAlbertGenerator

public interface EvolvingGraphGenerator

extends GraphGenerator

An interface for algorithms that generate graphs that evolve over time

Author:

Scott White

Method Summary

void	evolveGraph(int numTimeSteps) Instructs the algorithm to evolve the graph N time steps and return the most current evolved state of the graph
ArchetypeGraph	generateGraph() Returns a copy of the evolved graph in its current state
int	getNumElapsedTimeSteps() Retrieves the total number of time steps elapsed
void	reset() Resets the random graph to have zero vertices and zero edges and resets the elapsed time to 0.

Method Detail

evolveGraph

public void evolveGraph(int numTimeSteps)

Instructs the algorithm to evolve the graph N time steps and return the most current evolved state of the graph

Parameters:

numTimeSteps - number of time steps to simulate from its current state

getNumElapsedTimeSteps

public int getNumElapsedTimeSteps()

Retrieves the total number of time steps elapsed

Returns:

number of elapsed time steps

generateGraph

public ArchetypeGraph generateGraph()

Returns a copy of the evolved graph in its current state

Specified by:

generateGraph in interface GraphGenerator

Returns:

new instance of the evolved graph

reset

public void reset()

Resets the random graph to have zero vertices and zero edges and resets the elapsed time to 0.