Examples of ptolemy.graph.analysis.SinkNodeAnalysis

ptolemy.graph.analysis.SinkNodeAnalysis
Computation of sink nodes in a graph. A sink node in a graph is a node without output edges.
The returned collection cannot be modified when the client uses the default strategy.
@since Ptolemy II 2.0 @Pt.ProposedRating Red (shahrooz) @Pt.AcceptedRating Red (ssb) @author Shahrooz Shahparnia @version $Id: SinkNodeAnalysis.java,v 1.22 2005/07/08 19:59:02 cxh Exp $

     */
    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.SinkNodeAnalysis

ptolemy.graph.analysis.strategy.SinkNodeStrategy

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.