Examples of ptolemy.graph.analysis.strategy.SelfLoopStrategy

ptolemy.graph.analysis.strategy.SelfLoopStrategy
Computation of self-loops in a graph. The returned collection cannot be modified.
This analysis requires O(E) time, where E is the number of edges in the graph.
@see ptolemy.graph.analysis.SelfLoopAnalysis @since Ptolemy II 4.0 @Pt.ProposedRating Red (ssb) @Pt.AcceptedRating Red (ssb) @author Shuvra S. Bhattacharyya, Shahrooz Shahparnia @version $Id: SelfLoopStrategy.java,v 1.13 2005/07/08 19:59:05 cxh Exp $

    /** Construct an instance of this class for a given graph.
     *
     *  @param graph The given graph.
     */
    public SelfLoopAnalysis(Graph graph) {
        super(new SelfLoopStrategy(graph));
        ;
    }

View Full Code Here

TOP

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

ptolemy.graph.analysis.SelfLoopAnalysis

ptolemy.graph.Edge

java.util.ArrayList

java.util.Iterator

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.