Package de.cau.cs.kieler.klodd.hierarchical.structures.slimgraph

Slim graph representation for undirected graphs, used in many graph algorithms.

See:
          Description

Class Summary
KSlimEdge An edge in the slim graph structure.
KSlimEdge.Bend Definition of an edge bend for orthogonal drawing.
KSlimFace A face in the slim graph structure.
KSlimFace.BorderEntry An entry of a list associated with a face.
KSlimGraph The general-purpose slim graph structure.
KSlimGraphElement An element of a slim graph, which can be a node, an edge or a face.
KSlimNode A node in the slim graph structure.
KSlimNode.IncEntry Single entry of a incidence list.
 

Enum Summary
KSlimEdge.Bend.Type Type of edge bend, from the perspective of the source node.
KSlimNode.IncEntry.Type type of incidence entry: incoming or outgoing edge.
KSlimNode.Side Definition of sides of a node.
 

Package de.cau.cs.kieler.klodd.hierarchical.structures.slimgraph Description

Slim graph representation for undirected graphs, used in many graph algorithms. Although edges do have a direction, the incoming and outgoing edges of a node are stored in the same incidence list. This makes this graph structure very suitable for algorithms for undirected graphs such as planarity related algorithms.

The dual graph, which consists of faces and edges separating those faces, can be generated from a slim graph instance.