Examples of ptolemy.graph.analysis.CycleExistenceAnalysis

ptolemy.graph.analysis.CycleExistenceAnalysis
Analyzes a directed graph and detects the existence of cycles. In other words, this analysis checks if a given directed graph has at least one cycle or not. The default analyzer runs in O(N^3) in which N is the number of nodes. @since Ptolemy II 4.0 @Pt.ProposedRating Red (shahrooz) @Pt.AcceptedRating Red (ssb) @author Shahrooz Shahparnia @version $Id: CycleExistenceAnalysis.java,v 1.15 2005/07/08 19:59:01 cxh Exp $

     *  @see ptolemy.graph.analysis.Analysis
     */
    protected void _initializeAnalyses() {
        super._initializeAnalyses();
        _transitiveClosureAnalysis = new TransitiveClosureAnalysis(this);
        _acyclicAnalysis = new CycleExistenceAnalysis(this);
        _sinkNodeAnalysis = new SinkNodeAnalysis(this);
        _sourceNodeAnalysis = new SourceNodeAnalysis(this);
    }

View Full Code Here

TOP

Related Classes of ptolemy.graph.analysis.CycleExistenceAnalysis

ptolemy.graph.analysis.strategy.FloydWarshallCycleExistenceStrategy

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.