|
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
67 if (G.numberOfNodes() > 1 && G.numberOfEdges() > 1) {
69 doCall(G, adjExternal);
70 }
else if (G.numberOfEdges() == 1) {
71 adjExternal = G.firstEdge()->adjSource();
The namespace for all OGDF objects.
Includes declaration of graph class.
#define OGDF_ASSERT(expr)
Assert condition expr. See doc/build.md for more information.
Declaration of extended graph algorithms.
bool isPlanar(const Graph &G)
Returns true, if G is planar, false otherwise.
void operator()(Graph &G, adjEntry &adjExternal)
Calls the embedder algorithm for graph G.
void call(Graph &G, adjEntry &adjExternal)
Calls the embedder algorithm for graph G.
Declares base class for modules with timeout functionality.
Class for adjacency list elements.
#define OGDF_MALLOC_NEW_DELETE
Makes the class use malloc for memory allocation.
EmbedderModule()
Initializes an embedder module.
Data type for general directed graphs (adjacency list representation).
virtual ~EmbedderModule()
Base class for embedder algorithms.
Basic declarations, included by all source files.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
class for timeout funtionality.
Declares base class for all module types.
Declaration of memory manager for allocating small pieces of memory.