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
111
|
/*
* $Revision: 3091 $
*
* last checkin:
* $Author: gutwenger $
* $Date: 2012-11-30 11:07:34 +0100 (Fri, 30 Nov 2012) $
***************************************************************/
/** \file
* \brief implementation of initial cut-constraint class for the Branch&Cut algorithm
* for the Maximum C-Planar SubGraph problem.
*
* A feasible ILP solution has to imply a completely connected, planar Sub-Clustergraph.
* For each cluster that is not connected, additional connection edges have to be inserted
* between the chunks of the cluster, to obtain c-connectivity.
* Thus, initial constraints are added that guarantee initial c-connectivity, if the number of chunks
* is at most 3. If some cluster consists of more than 3 chunks, additional constraints
* have to be separated during the optimization.
*
* \author Mathias Jansen
*
*
* \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
***************************************************************/
#ifndef OGDF_CLUSTER_CHUNK_CONNECTION_H
#define OGDF_CLUSTER_CHUNK_CONNECTION_H
#include <ogdf/basic/Array.h>
#include <ogdf/basic/ArrayBuffer.h>
#include <ogdf/cluster/ClusterGraph.h>
#include <ogdf/internal/cluster/Cluster_EdgeVar.h>
#include <ogdf/internal/cluster/basics.h>
#include <ogdf/abacus/constraint.h>
namespace ogdf {
class ChunkConnection : public BaseConstraint {
#ifdef OGDF_DEBUG
//Mainly for debugging output purposes
friend class MaxCPlanarMaster;
friend class MaxCPlanarSub;
friend class CPlanarMaster;
friend class CPlanarSub;
#endif
public:
ChunkConnection(abacus::Master *master, const ArrayBuffer<node>& chunk, const ArrayBuffer<node>& cochunk);
virtual ~ChunkConnection();
// Computes and returns the coefficient for the given variable
virtual double coeff(const abacus::Variable *v) const {
const EdgeVar *ev = (const EdgeVar *)v;
//Safe for both clustered planarity testing and maximum c-planar subgraph
return (ev->theEdgeType() != EdgeVar::CONNECT) ? 0.0 : (double)coeff(ev->sourceNode(), ev->targetNode());
}
inline int coeff(const nodePair& n) const { return coeff(n.v1,n.v2); }
int coeff(node v1, node v2) const;
void printMe(ostream& out) const {
out << "[ChunkCon: (";
int j;
forall_arrayindices(j,m_chunk) {
Logger::slout() << m_chunk[j] << ",";
}
out << "|";
forall_arrayindices(j,m_cochunk) {
Logger::slout() << m_cochunk[j] << ",";
}
out << ")]";
}
private:
// The nodePairs corresponding to the constraint
Array<node> m_chunk;
Array<node> m_cochunk;
};
}
#endif
|
