org.eth.cyril.graphdrawing.graph.algorithms.cycles

Interface CycleRemovingAlgorithm

All Known Implementing Classes:

HeuristicCycleRemovingAlgorithm, RecursiveCycleRemovingAlgorithm

public interface CycleRemovingAlgorithm

A cycle removing algorithm can remove cycles from a graph.

Method Summary

Modifier and Type	Method and Description
java.util.List<Edge>	getRemovedEdges() Get the list of edges which had to be removed from the graph.
boolean	isHeuristic() Returns whether this algorithm is a heuristic algorithm, or otherwise an exact algorithm.
void	removeCycles(Graph graph) Remove all cycles from the given graph.

Method Detail

removeCycles

void removeCycles(Graph graph)

Remove all cycles from the given graph.

getRemovedEdges

java.util.List<Edge> getRemovedEdges()

Get the list of edges which had to be removed from the graph.

isHeuristic

boolean isHeuristic()

Returns whether this algorithm is a heuristic algorithm, or otherwise an exact algorithm.