Uses of Interface
de.cau.cs.kieler.kiml.grana.IAnalysis

Packages that use IAnalysis
de.cau.cs.kieler.kiml.grana Base classes for implementation of analysis algorithms and classes that provide the analyses as services. 
de.cau.cs.kieler.kiml.grana.analyses Basic graph analysis algorithms provided through the extension point. 
 

Uses of IAnalysis in de.cau.cs.kieler.kiml.grana
 

Classes in de.cau.cs.kieler.kiml.grana that implement IAnalysis
 class AbstractInfoAnalysis
          Analyses that derive from this class are required to provide an id, name and description.
 class AbstractSimpleInfoAnalysis
          Analyses that derive from this class can define dependencies without using the Dependency class.
 

Uses of IAnalysis in de.cau.cs.kieler.kiml.grana.analyses
 

Classes in de.cau.cs.kieler.kiml.grana.analyses that implement IAnalysis
 class AreaAnalysis
          A drawing analysis that computes the size of the area a graph drawing occupies.
 class AspectRatioAnalysis
          A drawing analysis that computes the aspect ratio of the area a graph drawing occupies.
 class BendsAnalysis
          A graph analysis that counts the number of bendpoints.
 class BiconnectedComponentsAnalysis
          A graph analysis that finds the number of biconnected components in a graph.
 class CompoundNodeChildCountAnalysis
          A graph analysis that counts the number of compound nodes.
 class CompoundNodeCountAnalysis
          A graph analysis that counts the number of compound nodes.
 class ConnectedComponentsAnalysis
          A graph analysis that finds the number of connected components in a graph.
 class CoverageAnalysis
          A drawing analysis that computes the percentage of the drawing area that is covered by nodes and insets.
 class EdgeCountAnalysis
          A graph analysis that computes the number of edges in the given graph.
 class EdgeCrossingsAnalysis
          A graph analysis that computes the number of edge crossings.
 class EdgeDirectionAnalysis
          A drawing analysis that counts the number of edges going in each of the four directions.
 class EdgeLengthAnalysis
          A graph analysis that computes the minimum, average and maximum edge length.
 class HyperedgeCrossingsAnalysis
          A special edge crossings analysis for hyperedges.
 class HyperNodeCountAnalysis
          A graph analysis that counts the number of hyper nodes.
 class LayersAnalysis
          An analysis for the number of horizontal and vertical layers.
 class MultiEdgeCountAnalysis
          A graph analysis that counts the number of multi edges.
 class NodeCountAnalysis
          A graph analysis that computes the number of nodes in the given graph.
 class NodeDegreeAnalysis
          A graph analysis that computes the min/avg/max node degree of the given graph.
 class NodeEdgeOverlapsAnalysis
          A graph analysis that computes the number of edge-node overlaps.
 class NodeSizeAnalysis
          A drawing analysis that computes the minimum, maximum and average node size of nodes that are not compound nodes.
 class PortCountAnalysis
          A graph analysis that computes the number of ports in the given graph.
 class PortSideAnalysis
          A graph analysis that computes the number of ports on each of the four sides.
 class SelfLoopAnalysis
          A graph analysis that gives the number of self loops in the graph.