Examples of ptolemy.graph.analysis.strategy.FloydWarshallTransitiveClosureStrategy

ptolemy.graph.analysis.strategy.FloydWarshallTransitiveClosureStrategy

Computation of transitive closure of a directed graph using the Floyd-Warshall algorithm described in: Thomas H. Cormen, Charles E. Leiserson and Ronald L. Rivest: Introduction to Algorithms. Cambridge: MIT Press, 1990.

The complexity of this algorithm is O(N^3), where N is the number of nodes.

@see ptolemy.graph.Graph#nodeLabel @see ptolemy.graph.analysis.TransitiveClosureAnalysis @since Ptolemy II 4.0 @Pt.ProposedRating Red (shahrooz) @Pt.AcceptedRating Red (ssb) @author Shahrooz Shahparnia based on an initial implementation by Ming Yung Ko. @version $Id: FloydWarshallTransitiveClosureStrategy.java,v 1.16 2005/07/08 19:59:04 cxh Exp $

     *  number of nodes.
     *
     *  @param graph The given graph.
     */
    public TransitiveClosureAnalysis(Graph graph) {
        super(new FloydWarshallTransitiveClosureStrategy(graph));
    }

Examples of ptolemy.graph.analysis.strategy.FloydWarshallTransitiveClosureStrategy

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