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
|
/*
* $Revision: 3838 $
*
* last checkin:
* $Author: gutwenger $
* $Date: 2013-11-13 15:30:17 +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_LAYERED_CROSS_MIN_MODULE_H
#define OGDF_LAYERED_CROSS_MIN_MODULE_H
#include <ogdf/layered/Hierarchy.h>
#include <ogdf/layered/CrossingMinInterfaces.h>
namespace ogdf {
class SugiyamaLayout;
/**
* \brief Interface of crossing minimization algorithms for layered graphs.
*
* The interface of a two-layer crossing minimization algorithm consists of
* two methods:
* -# virtual const HierarchyLevelsBase *reduceCrossings(const SugiyamaLayout sugi,
* Hierarchy &H) performs crossing minimization on layered graph H as a part
* of Sugiyama algorithm instance sugi.
* -# cleanup() has to be called last and performs some final clean-up work.
*/
class OGDF_EXPORT LayeredCrossMinModule {
public:
//! Creates empty module.
LayeredCrossMinModule() { }
//! Destruct.
virtual ~LayeredCrossMinModule() { }
//! Calls the actual crossing minimization algorithm.
virtual const HierarchyLevelsBase *reduceCrossings(const SugiyamaLayout &sugi, Hierarchy &H) = 0;
//! Performs clean-up.
virtual void cleanup() { }
OGDF_MALLOC_NEW_DELETE
};
} // end namespace ogdf
#endif
|
