Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

Loading...
Searching...
No Matches
MaximumDensitySubgraph.h
Go to the documentation of this file.
1
32#pragma once
33
34#include <ogdf/basic/Graph.h>
35#include <ogdf/basic/basic.h>
36
37#include <cstdint>
38#include <functional>
39
40namespace ogdf {
41class NodeSet;
42
84 Graph& G, NodeSet& subgraphNodes,
85 std::function<node(node)> resultNodeMap = [](node v) { return v; }, int64_t timelimit = -1);
86
87}
Includes declaration of graph class.
Basic declarations, included by all source files.
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:866
Class for the representation of nodes.
Definition Graph_d.h:241
Node sets.
Definition GraphSets.h:54
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
Definition config.h:117
bool maximumDensitySubgraph(Graph &G, NodeSet &subgraphNodes, std::function< node(node)> resultNodeMap=[](node v) { return v;}, int64_t timelimit=-1)
Calculates the maximum density subgraph of G.
NodeElement * node
The type of nodes.
Definition Graph_d.h:71
The namespace for all OGDF objects.