CliqueFinderModule.h

Go to the documentation of this file.

 
#pragma once
 
#include <ogdf/basic/Graph.h>
#include <ogdf/basic/basic.h>
#include <ogdf/basic/memory.h>
 
#include <algorithm>
 
namespace ogdf {
class GraphAttributes;
class GraphCopy;
template<class E>
class List;
 
 
class OGDF_EXPORT CliqueFinderModule {
public:
    explicit CliqueFinderModule() : m_pGraph(nullptr), m_pCopy(nullptr), m_minDegree(2) { }
 
    virtual ~CliqueFinderModule() { }
 
 
    void call(const Graph& G, NodeArray<int>& cliqueNumber);
 
 
    void call(const Graph& G, List<List<node>*>& cliqueLists);
 
 
    void setMinSize(int i) { m_minDegree = max(0, i - 1); }
 
 
    static void cliqueListToNumber(const Graph& G, const List<List<node>*>& cliqueLists,
            NodeArray<int>& cliqueNumber);
 
    static void cliqueNumberToList(const Graph& G, const NodeArray<int>& cliqueNumber,
            List<List<node>*>& cliqueLists);
 
    static void cliqueGraphAttributes(const Graph& G, const NodeArray<int>& cliqueNumber,
            GraphAttributes& GA);
 
    static bool cliqueOK(const Graph& G, List<node>* clique, double density = 1.0);
 
 
private:
 
    void beginCall(const Graph& G);
 
    void setResults(NodeArray<int>& cliqueNumber);
 
    void setResults(List<List<node>*>& cliqueLists);
 
    void endCall();
 
    bool handleTrivialCases();
 
    const Graph* m_pGraph; 
 
protected:
    GraphCopy* m_pCopy; 
 
    NodeArray<int> m_copyCliqueNumber; 
 
    int m_minDegree; 
 
    virtual void doCall() = 0;
 
    OGDF_MALLOC_NEW_DELETE
};
 
}