@see ptolemy.graph.analysis.CycleMeanAnalysis @since Ptolemy II 4.0 @Pt.ProposedRating Red (shahrooz) @Pt.AcceptedRating Red (ssb) @author Shahrooz Shahparnia @version $Id: CycleMeanAnalyzer.java,v 1.10 2005/07/08 19:59:03 cxh Exp $
313314315316317318319320321322323
* further transformation on the delay graph or the edgeLength, such as * making the edge costs negative in order to compute the minimum cycle * mean. */ private double _computeMCM(DirectedGraph graph, ToDoubleMapping edgeLength) { CycleMeanAnalyzer cycleMean = new KarpCycleMeanStrategy(graph, edgeLength); double result = cycleMean.maximumCycleMean(); _delayCycle = cycleMean.cycle(); return result; }