1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
|
/*
* $Revision: 2584 $
*
* last checkin:
* $Author: gutwenger $
* $Date: 2012-07-12 02:38:07 +0200 (Thu, 12 Jul 2012) $
***************************************************************/
/** \file
* \brief Declaration of an interface for c-planar subgraph algorithms.
*
* \author Karsten Klein
*
* \par License:
* This file is part of the Open Graph Drawing Framework (OGDF).
*
* \par
* Copyright (C)<br>
* See README.txt in the root directory of the OGDF installation for details.
*
* \par
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* Version 2 or 3 as published by the Free Software Foundation;
* see the file LICENSE.txt included in the packaging of this file
* for details.
*
* \par
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* \par
* You should have received a copy of the GNU General Public
* License along with this program; if not, write to the Free
* Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*
* \see http://www.gnu.org/copyleft/gpl.html
***************************************************************/
#ifdef _MSC_VER
#pragma once
#endif
#ifndef OGDF_CPLANAR_SUBGRAPH_MODULE_H
#define OGDF_CPLANAR_SUBGRAPH_MODULE_H
#include <ogdf/basic/Module.h>
#include <ogdf/basic/Timeouter.h>
#include <ogdf/cluster/ClusterGraph.h>
//#include <ogdf/internal/cluster/MaxCPlanar_Master.h>
namespace ogdf {
//--------------------------------------------------------------------------
//CPlanarSubgraphModule
//base class of algorithms for the computation of c-planar subgraphs
//--------------------------------------------------------------------------
/**
*
* \brief Interface of algorithms for the computation of c-planar subgraphs.
*/
class CPlanarSubgraphModule : public Module, public Timeouter
{
public:
//! Constructs a cplanar subgraph module
CPlanarSubgraphModule() {}
//! Destruction
virtual ~CPlanarSubgraphModule() {}
/**
* \brief Computes set of edges delEdges, which have to be deleted
* in order to get a c-planar subgraph.
*
* Must be implemented by derived classes.
* @param G is the clustergraph.
* @param delEdges holds the edges not in the subgraph on return.
*
*/
ReturnType call(const ClusterGraph &G, List<edge> &delEdges) {
return doCall(G, delEdges);
}
protected:
/**
* \brief Computes a maximum c-planar subgraph.
*
* If delEdges is empty on return, the clustered graph G is c-planar-
* The actual algorithm call that must be implemented by derived classes!
*
* @param CG is the given cluster graph.
* @param delEdges holds the set of edges that have to be deleted.
*/
virtual ReturnType doCall(const ClusterGraph &CG,
List<edge> &delEdges) = 0;
OGDF_MALLOC_NEW_DELETE
};
} //end namespace ogdf
#endif // OGDF_CPLANAR_SUBGRAPH_MODULE_H
|
