de.cau.cs.kieler.kiml.grana.analyses
Class NodeEdgeOverlapsAnalysis
java.lang.Object
de.cau.cs.kieler.kiml.grana.analyses.NodeEdgeOverlapsAnalysis
- All Implemented Interfaces:
- IAnalysis
public class NodeEdgeOverlapsAnalysis
- extends Object
- implements IAnalysis
A graph analysis that computes the number of edge-node overlaps. It assumes
that the edge bend points describe polylines (splines are not supported).
The algorithm used is based on the Cohen-Sutherland algorithm.
- Rating

Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
NodeEdgeOverlapsAnalysis
public NodeEdgeOverlapsAnalysis()
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 onresults
- 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