|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||
java.lang.Objectptolemy.graph.analysis.Analysis
ptolemy.graph.analysis.SelfLoopAnalysis
public class 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.
| Red (ssb) |
| Red (shahrooz) |
| Constructor Summary | |
|---|---|
SelfLoopAnalysis(Graph graph)
Construct an instance of this class for a given graph. |
|
SelfLoopAnalysis(SelfLoopAnalyzer analyzer)
Construct an instance of this class with a given analyzer. |
|
| Method Summary | |
|---|---|
java.util.List |
edges()
Return the self-loop edges in the graph under analysis. |
java.lang.String |
toString()
Return a description of the analysis and the associated analyzer. |
boolean |
validAnalyzerInterface(Analyzer analyzer)
Check if a given analyzer is compatible with this analysis. |
| Methods inherited from class ptolemy.graph.analysis.Analysis |
|---|
analyzer, changeAnalyzer, graph, valid |
| Methods inherited from class java.lang.Object |
|---|
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait |
| Constructor Detail |
|---|
public SelfLoopAnalysis(Graph graph)
graph - The given graph.public SelfLoopAnalysis(SelfLoopAnalyzer analyzer)
analyzer - The analyzer to use.| Method Detail |
|---|
public java.util.List edges()
Edge.
public java.lang.String toString()
toString in class Analysispublic boolean validAnalyzerInterface(Analyzer analyzer)
validAnalyzerInterface in class Analysisanalyzer - The given analyzer.
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD | ||||||||