de.cau.cs.kieler.kiml.grana.analyses
Class SelfLoopAnalysis

java.lang.Object
  extended by de.cau.cs.kieler.kiml.grana.analyses.SelfLoopAnalysis
All Implemented Interfaces:
IAnalysis

public class SelfLoopAnalysis
extends Object
implements IAnalysis

A graph analysis that gives the number of self loops in the graph. Returns a single-component result (int selfLoops). This analysis does not yet take into account indirect self loops, e.g. paths from a node to itself that only contain hyper nodes. It is not clear if these kinds of self loops should be included or not.

Rating red

Constructor Summary
SelfLoopAnalysis()
           
 
Method Summary
 Object doAnalysis(KNode parentNode, Map<String,Object> results, IKielerProgressMonitor progressMonitor)
          Performs the actual analysis process and returns the results.
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

SelfLoopAnalysis

public SelfLoopAnalysis()
Method Detail

doAnalysis

public Object doAnalysis(KNode parentNode,
                         Map<String,Object> results,
                         IKielerProgressMonitor progressMonitor)
Performs the actual analysis process and returns the results. If more than one component have been specified for the analysis in the extension the method is expected to return an array.

Specified by:
doAnalysis in interface IAnalysis
Parameters:
parentNode - the parent node which the analysis is performed on
results - the result of analyses that were performed before this one (it should include the results of all dependency analyses)
progressMonitor - progress monitor used to keep track of progress
Returns:
the analysis results