Examples of ptolemy.graph.analysis.strategy.AllEdgeSingleSourceLongestPathStrategy

ptolemy.graph.analysis.strategy.AllEdgeSingleSourceLongestPathStrategy
An analyzer used to find the longest path from a single source.
This algorithm runs in O(E), in which E is the number of edges.
@see ptolemy.graph.analysis.SingleSourceLongestPathAnalysis @since Ptolemy II 4.0 @Pt.ProposedRating Red (shahrooz) @Pt.AcceptedRating Red (ssb) @author Shahrooz Shahparnia @version $Id: AllEdgeSingleSourceLongestPathStrategy.java,v 1.17 2005/07/08 19:59:04 cxh Exp $

     *  @param edgeLengths The lengths of the edges of the given graph, which
     *  are going to be used to calculated the longest path.
     */
    public SingleSourceLongestPathAnalysis(Graph graph, Node startNode,
            ToDoubleMapping edgeLengths) {
        super(new AllEdgeSingleSourceLongestPathStrategy(graph, startNode,
                edgeLengths));
    }

View Full Code Here

TOP

Related Classes of ptolemy.graph.analysis.strategy.AllEdgeSingleSourceLongestPathStrategy

ptolemy.graph.analysis.analyzer.CycleExistenceAnalyzer

ptolemy.graph.analysis.SingleSourceLongestPathAnalysis

ptolemy.graph.DirectedGraph

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.