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
129
130
131
132
133
|
/*
* $Revision: 3833 $
*
* last checkin:
* $Author: gutwenger $
* $Date: 2013-11-13 11:23:15 +0100 (Wed, 13 Nov 2013) $
***************************************************************/
/** \file
* \brief Declaration of interface for two-layer crossing
* minimization 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_TWO_LAYER_CROSS_MIN_H
#define OGDF_TWO_LAYER_CROSS_MIN_H
#include <ogdf/layered/Hierarchy.h>
#include <ogdf/layered/HierarchyLevels.h>
#include <ogdf/module/LayeredCrossMinModule.h>
namespace ogdf {
class SugiyamaLayout;
/**
* \brief Interface of two-layer crossing minimization algorithms.
*
* The interface of a two-layer crossing minimization algorithm consists of
* four methods:
* -# init(const Hierarchy & H) must be called first. This initializes the module
* for operating on hierarchy \a H.
* -# call(Level &L) (or operator()(Level &L)) performs two-layer crossing minimization,
* where \a L is the permutable level and the neighbor level of \a L (fixed
* level) is determined by the hierarchy (see documentation of class Hierarchy).
* Any number of call's may be performed once init() has been executed.
* -# cleanup() has to be called last and performs some final clean-up work.
*/
class OGDF_EXPORT LayerByLayerSweep : public LayeredCrossMinModule {
public:
virtual const HierarchyLevels *reduceCrossings(const SugiyamaLayout &sugi, const Hierarchy &H);
//! Template method implementation of reduceCrossings from LayeredCrossMinModule.
virtual const HierarchyLevels *reduceCrossings(const SugiyamaLayout &sugi, Hierarchy &H)
{
const Hierarchy &constH = H;
return reduceCrossings(sugi,constH);
}
//! Initializes a two-layer crossing minimization module.
LayerByLayerSweep() { }
virtual ~LayerByLayerSweep() { }
//! Returns a new instance of the two-layer crossing minimization module with the same option settings.
virtual LayerByLayerSweep *clone() const = 0;
/**
* \brief Initializes the crossing minimization module for hierarchy levels \a levels.
*
* @param levels is the hierarchy on which the module shall operate.
*/
virtual void init(const HierarchyLevels &levels) { }
/**
* \brief Performs crossing minimization for level \a L.
*
* @param L is the level in the hierarchy on which nodes are permuted; the
* neighbor level (fixed level) is determined by the hierarchy.
*/
virtual void call(Level &L) = 0;
/**
* \brief Performs crossing minimization for level \a L.
*
* @param L is the level in the hierarchy on which nodes are permuted; the
* neighbor level (fixed level) is determined by the hierarchy.
*/
void operator()(Level &L) {
call(L);
}
//! Performs clean-up.
virtual void cleanup() { }
class CrossMinMaster;
class CrossMinWorker;
OGDF_MALLOC_NEW_DELETE
};
} // end namespace ogdf
#endif
|
