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
|
/*
* $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 for Simultaneous Drawing.
*
* \author Michael Schulz
*
* \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_SIMDRAW_H
#define OGDF_TWO_LAYER_CROSS_MIN_SIMDRAW_H
#include <ogdf/module/LayerByLayerSweep.h>
namespace ogdf {
class OGDF_EXPORT TwoLayerCrossMinSimDraw : public LayerByLayerSweep
{
public:
//! Initializes a two-layer crossing minimization module.
TwoLayerCrossMinSimDraw() : LayerByLayerSweep() { }
//! Returns a new instance of the two-layer crossing minimization module with the same option settings.
virtual TwoLayerCrossMinSimDraw *clone() const = 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.
* @param esg points to an edge array which specifies to which subgraphs
* an edge belongs; there are up to 32 possible subgraphs each of which
* is represented by a bit of an <code>__uint32</code>.
*/
virtual void call(Level &L, const EdgeArray<__uint32> *esg) = 0;
void call(Level &L) = 0;
};
} // end namespace ogdf
#endif
|
