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

Class WeightCalculator.ConstrainedWeightCalculator

java.lang.Object

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

All Implemented Interfaces:

WeightCalculator

Enclosing interface:

WeightCalculator

public static class WeightCalculator.ConstrainedWeightCalculator
extends java.lang.Object
implements WeightCalculator

Nested Class Summary

Nested classes/interfaces inherited from interface org.eth.cyril.graphdrawing.graph.algorithms.cycles.WeightCalculator

WeightCalculator.ConstrainedWeightCalculator, WeightCalculator.UnweightedWeightCalculator, WeightCalculator.WeightedWeightCalculator

Constructor Summary

Constructors

Constructor and Description
ConstrainedWeightCalculator(java.util.List<EdgeWeightConstraint> constraints)

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.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

ConstrainedWeightCalculator

public ConstrainedWeightCalculator(java.util.List<EdgeWeightConstraint> constraints)

Method Detail

getEdgeWeight

public double getEdgeWeight(Edge edge)

Description copied from interface: WeightCalculator

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.

Specified by:

getEdgeWeight in interface WeightCalculator

Parameters:

edge - The edge.

Returns:

The weight of the edge.

getOrderWeight

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

Description copied from interface: WeightCalculator

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.

Specified by:

getOrderWeight in interface WeightCalculator

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.