org.nongnu.multigraph.perturb

Interface perturber<N,E>

All Known Implementing Classes:

RandomRemove, RemoveAddEach

public interface perturber<N,E>

Operations common to graph perturbation implementations. These are used to iteratively apply changes to a graph according to some cohesive policy, provided by a concrete implementation.

Author:

Paul Jakma

Method Summary

Modifier and Type	Method and Description
int	clear_removed_edges() Clear state held for any removed edges.
java.util.List<Edge<N,E>>	perturb() Carry out 1 iteration of the perturbation of the graph, according to the policy of the implementation.
java.util.List<Edge<N,E>>	removed_edges()
int	restore() Restore edges removed previously, up until the last call to clear_removed_edges().

Method Detail

perturb

java.util.List<Edge<N,E>> perturb()

Carry out 1 iteration of the perturbation of the graph, according to the policy of the implementation. Edges may be added or removed.

Returns:

An unmodifiable list of any edges removed in this iteration.

restore

int restore()

Restore edges removed previously, up until the last call to clear_removed_edges(). This also clears the remember, removed edges.

Returns:

The number of restored edges.

removed_edges

java.util.List<Edge<N,E>> removed_edges()

Returns:

An unmodifiable list view of any remembered, removed edges.

clear_removed_edges

int clear_removed_edges()

Clear state held for any removed edges. Future restore() calls will not be able to add back any of the edges held before the call to this method.

Returns:

The number of edges cleared.