Examples of FloydWarshallCycleExistenceStrategy

ptolemy.graph.analysis.strategy.FloydWarshallCycleExistenceStrategy
Computation of cycle existence in directed graphs using an all pair shortest path algorithm based on the Floyd-Warshall algorithm. The complexity of this algorithm is O(N^3), where N is the number of nodes.
@see ptolemy.graph.analysis.CycleExistenceAnalysis @since Ptolemy II 4.0 @Pt.ProposedRating Red (shahrooz) @Pt.AcceptedRating Red (ssb) @author Shahrooz Shahparnia @version $Id: FloydWarshallCycleExistenceStrategy.java,v 1.15 2005/07/08 19:59:04 cxh Exp $

Examples of ptolemy.graph.analysis.strategy.FloydWarshallCycleExistenceStrategy

     *  default analyzer that runs in O(N^3) in which N is the number of nodes.
     *
     *  @param graph The given directed graph.
     */
    public CycleExistenceAnalysis(Graph graph) {
        super(new FloydWarshallCycleExistenceStrategy(graph));
    }

View Full Code Here

TOP

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.