/* Computation of sink nodes in a graph.
Copyright (c) 2003-2005 The University of Maryland. All rights reserved.
Permission is hereby granted, without written agreement and without
license or royalty fees, to use, copy, modify, and distribute this
software and its documentation for any purpose, provided that the above
copyright notice and the following two paragraphs appear in all copies
of this software.
IN NO EVENT SHALL THE UNIVERSITY OF MARYLAND BE LIABLE TO ANY PARTY
FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES
ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF
THE UNIVERSITY OF MARYLAND HAS BEEN ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE.
THE UNIVERSITY OF MARYLAND SPECIFICALLY DISCLAIMS ANY WARRANTIES,
INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE
PROVIDED HEREUNDER IS ON AN "AS IS" BASIS, AND THE UNIVERSITY OF
MARYLAND HAS NO OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES,
ENHANCEMENTS, OR MODIFICATIONS.
*/
package ptolemy.graph.analysis.strategy;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Iterator;
import java.util.List;
import ptolemy.graph.DirectedGraph;
import ptolemy.graph.Graph;
import ptolemy.graph.Node;
import ptolemy.graph.analysis.analyzer.SinkNodeAnalyzer;
//////////////////////////////////////////////////////////////////////////
//// SinkNodeStrategy
/**
Computation of sink nodes in a graph.
The collection returned cannot be modified.
<p>
This analysis requires <em>O</em>(<em>N</em>) time, where <em>N</em> is the
number of nodes in the graph.
<p>
@see ptolemy.graph.analysis.SinkNodeAnalysis
@since Ptolemy II 4.0
@Pt.ProposedRating Red (ssb)
@Pt.AcceptedRating Red (ssb)
@author Ming Yung Ko, Shahrooz Shahparnia
@version $Id: SinkNodeStrategy.java,v 1.13 2005/07/08 19:59:05 cxh Exp $
*/
public class SinkNodeStrategy extends CachedStrategy implements
SinkNodeAnalyzer {
/** Construct a sink node analysis for a given graph.
* @param graph The given graph.
*/
public SinkNodeStrategy(Graph graph) {
super(graph);
}
///////////////////////////////////////////////////////////////////
//// public methods ////
/** Compute the sink nodes in the graph in the form of
* a collection. Each element of the collection is a {@link Node}.
* @return The sink nodes.
*/
public List nodes() {
return (List) _result();
}
/** Return a description of sink nodes.
*
* @return A description of the sink nodes.
*/
public String toString() {
String result = "Sink node analysis for the following graph.\n"
+ graph().toString();
result += ("The sink nodes are:\n" + _result());
return result;
}
/** Check compatibility of the class of graph. The given graph
* must be an instance of DirectedGraph.
*
* @param graph The given graph.
* @return True if the given graph is of class DirectedGraph.
*/
public boolean valid() {
return (graph() instanceof DirectedGraph);
}
///////////////////////////////////////////////////////////////////
//// protected methods ////
/** Compute the sink nodes in the graph in the form of
* a collection. Each element of the collection is a {@link Node}.
* @return The sink nodes.
*/
protected Object _compute() {
ArrayList sinkNodes = new ArrayList();
Iterator nodes = graph().nodes().iterator();
while (nodes.hasNext()) {
Node node = (Node) nodes.next();
if (((DirectedGraph) graph()).outputEdgeCount(node) == 0) {
sinkNodes.add(node);
}
}
return sinkNodes;
}
/** Return the result of this analysis (collection of sink nodes)
* in a form that cannot be modified.
* @return The analysis result in unmodifiable form.
*/
protected Object _convertResult() {
return Collections.unmodifiableList((List) _result());
}
}