IGraphGenerator (datastructure 1.0.0 API)

Type Parameters:

N - Node type

A - Arc type
```
public interface IGraphGenerator<N,A>
```
A graph can be implicitly represented by a (set of) source node(s), called the root(s), and a function that generates the successor nodes for any given node. A graph generator provides these two functions.

- Method Summary
  
  All Methods Instance Methods Abstract Methods
  Modifier and Type Method Description
  
  IRootGenerator<N> getRootGenerator()
  
  ISuccessorGenerator<N,A> getSuccessorGenerator()

- Method Detail
  - getRootGenerator
```
IRootGenerator<N> getRootGenerator()
```
    Returns:
    
    The generator for the root(s) of the graph.
  - getSuccessorGenerator
```
ISuccessorGenerator<N,A> getSuccessorGenerator()
```
    Returns:
    
    The successor node generator for the graph.