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
|
/*
* $Revision: 2523 $
*
* last checkin:
* $Author: gutwenger $
* $Date: 2012-07-02 20:59:27 +0200 (Mon, 02 Jul 2012) $
***************************************************************/
/** \file
* \brief Declaration of interface for acyclic subgraph 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_ACYCLIC_SUBGRAPH_MODULE_H
#define OGDF_ACYCLIC_SUBGRAPH_MODULE_H
#include <ogdf/basic/Graph.h>
namespace ogdf {
/**
* \brief Base class of algorithms for computing a maximal acyclic subgraph.
*
* \see SugiyamaLayout
*/
class OGDF_EXPORT AcyclicSubgraphModule {
public:
//! Initializes an acyclic subgraph module.
AcyclicSubgraphModule() { }
// destruction
virtual ~AcyclicSubgraphModule() { }
/**
* \brief Computes the set of edges \a arcSet which have to be removed
* for obtaining an acyclic subgraph of \a G.
*
* This is the actual algorithm call and must be implemented by derived classes.
* @param G is the input graph.
* @param arcSet is assigned the list of edges that have to be removed in \a G.
*/
virtual void call(const Graph &G, List<edge> &arcSet) = 0;
/**
* \brief Computes the set of edges \a arcSet which have to be removed
* for obtaining an acyclic subgraph of \a G.
* @param G is the input graph.
* @param arcSet is assigned the list of edges that have to be removed in \a G.
*/
void operator()(const Graph &G, List<edge> &arcSet) {
call(G,arcSet);
}
/**
* \brief Makes \a G acyclic by reversing edges.
*
* This method will ignore self-loops in the input graph \a G; thus self-loops
* are neither reversed or removed nor added to \a reversed.
* @param G is the input graph.
* @param reversed is assigned the list of edges that have been reversed in \a G.
*/
void callAndReverse(Graph &G, List<edge> &reversed);
// makes G acyclic (except for self-loops!) by reversing edges
/**
* \brief Makes \a G acyclic by reversing edges.
*
* This method will ignore self-loops in the input graph \a G; thus self-loops
* are neither reversed nor removed. This is the simplified version of callAndDelete()
* that does not return the list of reversed edges.
* @param G is the input graph.
*/
void callAndReverse(Graph &G);
// makes G acyclic by deleting edges
/**
* \brief Makes \a G acyclic by removing edges.
*
* This method will also remove self-loops in the input graph \a G.
* @param G is the input graph.
*/
void callAndDelete(Graph &G);
OGDF_MALLOC_NEW_DELETE
};
} // end namespace ogdf
#endif
|
