Declaration and implementation of ArrayBuffer class.
Includes declaration of graph class.
Declaration of classes GenericPoint, GenericPolyline, GenericLine, GenericSegment,...
Basic declarations, included by all source files.
An array that keeps track of the number of inserted elements; also usable as an efficient stack.
Stores additional attributes of a graph (like layout information).
Data type for general directed graphs (adjacency list representation).
Computes statistical information about a layout.
static ArrayBuffer< int > numberOfCrossings(const GraphAttributes &ga)
Computes the number of edge crossings for each edge in the layout ga.
static ArrayBuffer< int > numberOfBends(const GraphAttributes &ga, bool considerSelfLoops=false)
Computes the number of bends (i.e. bend-points) for each edge in the layout ga.
static ArrayBuffer< int > numberOfNodeOverlaps(const GraphAttributes &ga)
Computes the number of node overlaps for each node in the layout ga.
static void intersectionGraph(const GraphAttributes &ga, Graph &H, NodeArray< DPoint > &points, NodeArray< node > &origNode, EdgeArray< edge > &origEdge)
Computes the intersection graph H of the line segments in the layout given by ga.
static ArrayBuffer< int > numberOfNodeCrossings(const GraphAttributes &ga)
Computes the number of crossings through a non-incident node for each edge in the layout ga.
static ArrayBuffer< double > edgeLengths(const GraphAttributes &ga, bool considerSelfLoops=false)
Computes the edge length for each edge in the layout ga.
static ArrayBuffer< double > angles(const GraphAttributes &ga, bool considerBends=true)
Computes the angle for each pair of adjacent edge segments of the layout ga.
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
RegisteredArray for nodes, edges and adjEntries of a graph.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
The namespace for all OGDF objects.