Examples of KarpCycleMeanStrategy

ptolemy.graph.analysis.strategy.KarpCycleMeanStrategy

An analyzer for computing the maximum/minimum cycle mean of a graph. This implementation uses the Karp's algorithm described in:

A.Dasdan, R.K. Gupta, "Faster Maximum and Minimum Mean Cycle Algorithms for System Performance".

Note that the mathematical definition of maximum cycle mean and maximum profit to cost are different, though some time the name "maximum cycle mean" is used to refer to the maximum profit to cost ratio.

@see ptolemy.graph.analysis.CycleMeanAnalysis @since Ptolemy II 4.0 @Pt.ProposedRating Red (shahrooz) @Pt.AcceptedRating Red (ssb) @author Shahrooz Shahparnia @version $Id: KarpCycleMeanStrategy.java,v 1.24 2007/12/06 21:56:59 cxh Exp $

     *
     *  @param graph The given graph.
     *  @param edgeLengths  The lengths associated with the edges of the graph.
     */
    public CycleMeanAnalysis(Graph graph, ToDoubleMapping edgeLengths) {
        super(new KarpCycleMeanStrategy(graph, edgeLengths));
    }

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.

Examples of KarpCycleMeanStrategy

Examples of ptolemy.graph.analysis.strategy.KarpCycleMeanStrategy