Package de.cau.cs.kieler.kiml.grana.analyses

Basic graph analysis algorithms provided through the extension point.

See:
          Description

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

Package de.cau.cs.kieler.kiml.grana.analyses Description

Basic graph analysis algorithms provided through the extension point.