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