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
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
|
/*
* $Revision: 2523 $
*
* last checkin:
* $Author: gutwenger $
* $Date: 2012-07-02 20:59:27 +0200 (Mon, 02 Jul 2012) $
***************************************************************/
/** \file
* \brief Declaration of interface for minor-monotone edge
* insertion algorithms.
*
* \author Carsten Gutwenger
*
* \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_MM_EDGE_INSERTION_MODULE_H
#define OGDF_MM_EDGE_INSERTION_MODULE_H
#include <ogdf/planarity/PlanRepExpansion.h>
#include <ogdf/basic/Module.h>
namespace ogdf {
/**
* \brief Interface for minor-monotone edge insertion algorithms.
*
* \see MMSubgraphPlanarizer
*/
class OGDF_EXPORT MMEdgeInsertionModule : public Module {
public:
//! The postprocessing methods.
enum RemoveReinsertType {
rrNone, //!< No postprocessing.
rrInserted, //!< Postprocessing only with the edges that have to be inserted.
rrMostCrossed, //!< Postprocessing with the edges involved in the most crossings.
rrAll, //!< Postproceesing with all edges and all node splits.
rrIncremental //!< Full postprocessing after each edge insertion.
};
//! Initializes a minor-monotone edge insertion module.
MMEdgeInsertionModule() { }
// destruction
virtual ~MMEdgeInsertionModule() { }
/**
* \brief Inserts all edges in \a origEdges into \a PG.
*
* @param PG is the input planarized expansion and will also receive the result.
* @param origEdges is the list of original edges (edges in the original graph
* of \a PG) that have to be inserted.
* \return the status of the result.
*/
ReturnType call(PlanRepExpansion &PG, const List<edge> &origEdges) {
return doCall(PG, origEdges, 0);
}
/**
* \brief Inserts all edges in \a origEdges into \a PG and forbids crossing \a forbiddenEdges.
*
* @param PG is the input planarized expansion and will also receive the result.
* @param origEdges is the list of original edges (edges in the original graph
* of \a PG) that have to be inserted.
* @param forbiddenEdgeOrig is an edge array indicating if an original edge is
* forbidden to be crossed.
* \return the status of the result.
*/
ReturnType call(PlanRepExpansion &PG,
const List<edge> &origEdges,
const EdgeArray<bool> &forbiddenEdgeOrig)
{
return doCall(PG, origEdges, &forbiddenEdgeOrig);
}
protected:
/**
* \brief Actual algorithm call that has to be implemented by derived classes.
*
* @param PG is the input planarized expansion and will also receive the result.
* @param origEdges is the list of original edges (edges in the original graph
* of \a PG) that have to be inserted.
* @param forbiddenEdgeOrig points to an edge array indicating if an original edge is
* forbidden to be crossed.
*/
virtual ReturnType doCall(PlanRepExpansion &PG,
const List<edge> &origEdges, const EdgeArray<bool> *forbiddenEdgeOrig) = 0;
OGDF_MALLOC_NEW_DELETE
};
} // end namespace ogdf
#endif
|
