Examples of ptolemy.graph.analysis.SelfLoopAnalysis

ptolemy.graph.analysis.SelfLoopAnalysis
Computation of self-loops in a graph. A self-loop (also called a self-loop edge) in a graph is an edge whose source and sink nodes are identical.
The returned collection cannot be modified when the client uses the default analyzer.
@since Ptolemy II 2.0 @Pt.ProposedRating Red (shahrooz) @Pt.AcceptedRating Red (ssb) @author Shahrooz Shahparnia @version $Id: SelfLoopAnalysis.java,v 1.32 2005/07/08 19:59:02 cxh Exp $

     *  and initialize the change counter of the graph.
     *  @see ptolemy.graph.analysis.Analysis
     */
    protected void _initializeAnalyses() {
        _analysisList = new ArrayList();
        _selfLoopAnalysis = new SelfLoopAnalysis(this);
        _changeCount = 0;
    }

View Full Code Here

TOP

Related Classes of ptolemy.graph.analysis.SelfLoopAnalysis

ptolemy.graph.analysis.strategy.SelfLoopStrategy

ptolemy.graph.Graph

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.