Includes declaration of graph class.
Declaration of doubly linked lists and iterators.
Declaration of PlanarityModule.
Declaration of singly linked lists and iterators.
Basic declarations, included by all source files.
Booth-Lueker planarity test.
bool doEmbed(Graph &G, NodeArray< int > &numbering, EdgeArray< edge > &backTableEdges, EdgeArray< edge > &forwardTableEdges)
Performs a planarity test on a biconnected component of G and embedds it planar.
void entireEmbed(Graph &G, NodeArray< SListPure< adjEntry > > &entireEmbedding, NodeArray< SListIterator< adjEntry > > &adjMarker, NodeArray< bool > &mark, node v)
virtual bool isPlanar(const Graph &G) override
Returns true, if G is planar, false otherwise.
void prepareParallelEdges(Graph &G)
virtual bool planarEmbedPlanarGraph(Graph &G) override
Returns true, if G is planar, false otherwise. If true, G contains a planar embedding.
bool doTest(Graph &G, NodeArray< int > &numbering)
Performs a planarity test on a biconnected component of G.
virtual bool isPlanarDestructive(Graph &G) override
Returns true, if G is planar, false otherwise.
virtual bool planarEmbed(Graph &G) override
Returns true, if G is planar, false otherwise. If true, G contains a planar embedding.
bool preparation(Graph &G, bool embed)
Prepares the planarity test and the planar embedding.
EdgeArray< ListPure< edge > > m_parallelEdges
EdgeArray< bool > m_isParallel
Data type for general directed graphs (adjacency list representation).
Class for the representation of nodes.
Module for planarity testing and planar embeddings.
Encapsulates a pointer to an ogdf::SList element.
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.