|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
44 class StaticPlanarSPQRTree;
54 static bool testAndFindEmbedding(
const Graph& G,
bool embed,
71 class ConstraintRooting;
78 static bool testBiconnectedComponent(
ExpansionGraph& exp,
node sG,
int parentBlock,
bool embed,
92 static void computeDegreesInPertinent(
const SPQRTree& T,
node s,
99 static bool initFaceSinkGraph(
const Graph& M, SkeletonInfo& skInfo);
102 node vT,
bool extFaceIsLeft);
121 static bool virtualEdgesDirectedEqually(
const SPQRTree& T);
The namespace for all OGDF objects.
Includes declaration of graph class.
Singly linked lists (maintaining the length of the list).
Linear-time implementation of static SPQR-trees.
Performs upward planarity testing and embedding for single-source digraphs.
RegisteredArray for nodes, edges and adjEntries of a graph.
Data type for general directed graphs (adjacency list representation).
SPQR-trees of planar graphs.
Basic declarations, included by all source files.
Declaration of CombinatorialEmbedding and face.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Class for the representation of edges.
Represents expansion graph of each biconnected component of a given digraph, i.e.,...
Class for the representation of nodes.
Faces in a combinatorial embedding.