Package edu.uci.ics.jung.algorithms.generators

Interface EvolvingGraphGenerator<V,​E>

  • All Superinterfaces:
    GraphGenerator<V,​E>, com.google.common.base.Supplier<Graph<V,​E>>, java.util.function.Supplier<Graph<V,​E>>
    All Known Implementing Classes:
    BarabasiAlbertGenerator
    public interface EvolvingGraphGenerator<V,​E>
extends GraphGenerator<V,​E>
    An interface for algorithms that generate graphs that evolve iteratively.
    Author:
    Scott White

    • Method Summary

      All Methods Instance Methods Abstract Methods 
      Modifier and Type Method Description
      void evolveGraph​(int numSteps)
      Instructs the algorithm to evolve the graph N steps.
      int numIterations()
      Retrieves the total number of steps elapsed.

      • Methods inherited from interface com.google.common.base.Supplier

        get

    • Method Detail

      • evolveGraph

        void evolveGraph​(int numSteps)
        Instructs the algorithm to evolve the graph N steps.
        Parameters:
        numSteps - number of steps to iterate from the current state

      • numIterations

        int numIterations()
        Retrieves the total number of steps elapsed.
        Returns:
        number of elapsed steps