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

Interface WeightCalculator

All Known Implementing Classes:

WeightCalculator.ConstrainedWeightCalculator, WeightCalculator.UnweightedWeightCalculator, WeightCalculator.WeightedWeightCalculator

public interface WeightCalculator

A weight calculator to be used in a HeuristicCycleRemovingAlgorithm or RecursiveCycleRemovingAlgorithm. The weight calculator calculates the weight of edges, as well as the priority to assign to each edge when looking which edge to remove next.

Nested Class Summary

Nested Classes

Modifier and Type	Interface and Description
static class	WeightCalculator.ConstrainedWeightCalculator
static class	WeightCalculator.UnweightedWeightCalculator
static class	WeightCalculator.WeightedWeightCalculator

Method Summary

Modifier and Type	Method and Description
double	getEdgeWeight(Edge edge) Gets the weight of the given edge according to this calculator.
double	getOrderWeight(Edge edge, java.util.List<Cycle> cycles) Gets the weight of the edge for ordering the most promising edges to remove.

Method Detail

getEdgeWeight

double getEdgeWeight(Edge edge)

Gets the weight of the given edge according to this calculator. A high weight corresponds to an edge which should not be removed for the minimal feedback arc set.

Parameters:

edge - The edge.

Returns:

The weight of the edge.

getOrderWeight

double getOrderWeight(Edge edge,
                      java.util.List<Cycle> cycles)

Gets the weight of the edge for ordering the most promising edges to remove. A promising edge will be likelier to be removed early, as its potential for being part of the minimal feedback arc set is high.

Parameters:

edge - The edge to check for.

cycles - The list of cycles which were found in the graph.

Returns:

The weight of the edge for ordering of most promising edges to remove.