1 | 1 |
# Doxyfile 1.5.5 |
2 | 2 |
|
3 | 3 |
#--------------------------------------------------------------------------- |
4 | 4 |
# Project related configuration options |
5 | 5 |
#--------------------------------------------------------------------------- |
6 | 6 |
DOXYFILE_ENCODING = UTF-8 |
7 | 7 |
PROJECT_NAME = @PACKAGE_NAME@ |
8 | 8 |
PROJECT_NUMBER = @PACKAGE_VERSION@ |
9 | 9 |
OUTPUT_DIRECTORY = |
10 | 10 |
CREATE_SUBDIRS = NO |
11 | 11 |
OUTPUT_LANGUAGE = English |
12 | 12 |
BRIEF_MEMBER_DESC = YES |
13 | 13 |
REPEAT_BRIEF = NO |
14 | 14 |
ABBREVIATE_BRIEF = |
15 | 15 |
ALWAYS_DETAILED_SEC = NO |
16 | 16 |
INLINE_INHERITED_MEMB = NO |
17 | 17 |
FULL_PATH_NAMES = YES |
18 | 18 |
STRIP_FROM_PATH = @abs_top_srcdir@ |
19 | 19 |
STRIP_FROM_INC_PATH = @abs_top_srcdir@ |
20 | 20 |
SHORT_NAMES = YES |
21 | 21 |
JAVADOC_AUTOBRIEF = NO |
22 | 22 |
QT_AUTOBRIEF = NO |
23 | 23 |
MULTILINE_CPP_IS_BRIEF = NO |
24 | 24 |
DETAILS_AT_TOP = YES |
25 | 25 |
INHERIT_DOCS = NO |
26 | 26 |
SEPARATE_MEMBER_PAGES = NO |
27 | 27 |
TAB_SIZE = 8 |
28 | 28 |
ALIASES = |
29 | 29 |
OPTIMIZE_OUTPUT_FOR_C = NO |
30 | 30 |
OPTIMIZE_OUTPUT_JAVA = NO |
31 | 31 |
OPTIMIZE_FOR_FORTRAN = NO |
32 | 32 |
OPTIMIZE_OUTPUT_VHDL = NO |
33 | 33 |
BUILTIN_STL_SUPPORT = YES |
34 | 34 |
CPP_CLI_SUPPORT = NO |
35 | 35 |
SIP_SUPPORT = NO |
36 | 36 |
DISTRIBUTE_GROUP_DOC = NO |
37 | 37 |
SUBGROUPING = YES |
38 | 38 |
TYPEDEF_HIDES_STRUCT = NO |
39 | 39 |
#--------------------------------------------------------------------------- |
40 | 40 |
# Build related configuration options |
41 | 41 |
#--------------------------------------------------------------------------- |
42 | 42 |
EXTRACT_ALL = NO |
43 | 43 |
EXTRACT_PRIVATE = YES |
44 | 44 |
EXTRACT_STATIC = YES |
45 | 45 |
EXTRACT_LOCAL_CLASSES = NO |
46 | 46 |
EXTRACT_LOCAL_METHODS = NO |
47 | 47 |
EXTRACT_ANON_NSPACES = NO |
48 | 48 |
HIDE_UNDOC_MEMBERS = YES |
49 | 49 |
HIDE_UNDOC_CLASSES = YES |
50 | 50 |
HIDE_FRIEND_COMPOUNDS = NO |
51 | 51 |
HIDE_IN_BODY_DOCS = NO |
52 | 52 |
INTERNAL_DOCS = NO |
53 | 53 |
CASE_SENSE_NAMES = YES |
54 | 54 |
HIDE_SCOPE_NAMES = YES |
55 | 55 |
SHOW_INCLUDE_FILES = YES |
56 | 56 |
INLINE_INFO = YES |
57 | 57 |
SORT_MEMBER_DOCS = NO |
58 | 58 |
SORT_BRIEF_DOCS = NO |
59 | 59 |
SORT_GROUP_NAMES = NO |
60 | 60 |
SORT_BY_SCOPE_NAME = NO |
61 | 61 |
GENERATE_TODOLIST = YES |
62 | 62 |
GENERATE_TESTLIST = YES |
63 | 63 |
GENERATE_BUGLIST = YES |
64 | 64 |
GENERATE_DEPRECATEDLIST= YES |
65 | 65 |
ENABLED_SECTIONS = |
66 | 66 |
MAX_INITIALIZER_LINES = 5 |
67 | 67 |
SHOW_USED_FILES = YES |
68 | 68 |
SHOW_DIRECTORIES = YES |
69 | 69 |
FILE_VERSION_FILTER = |
70 | 70 |
#--------------------------------------------------------------------------- |
71 | 71 |
# configuration options related to warning and progress messages |
72 | 72 |
#--------------------------------------------------------------------------- |
73 | 73 |
QUIET = NO |
74 | 74 |
WARNINGS = YES |
75 | 75 |
WARN_IF_UNDOCUMENTED = YES |
76 | 76 |
WARN_IF_DOC_ERROR = YES |
77 | 77 |
WARN_NO_PARAMDOC = NO |
78 | 78 |
WARN_FORMAT = "$file:$line: $text " |
79 | 79 |
WARN_LOGFILE = doxygen.log |
80 | 80 |
#--------------------------------------------------------------------------- |
81 | 81 |
# configuration options related to the input files |
82 | 82 |
#--------------------------------------------------------------------------- |
83 | 83 |
INPUT = @abs_top_srcdir@/doc \ |
84 | 84 |
@abs_top_srcdir@/lemon \ |
85 | 85 |
@abs_top_srcdir@/lemon/bits \ |
86 | 86 |
@abs_top_srcdir@/lemon/concepts \ |
87 | 87 |
@abs_top_srcdir@/demo \ |
88 | 88 |
@abs_top_srcdir@/tools \ |
89 | 89 |
@abs_top_srcdir@/test/test_tools.h |
90 | 90 |
INPUT_ENCODING = UTF-8 |
91 | 91 |
FILE_PATTERNS = *.h \ |
92 | 92 |
*.cc \ |
93 | 93 |
*.dox |
94 | 94 |
RECURSIVE = NO |
95 | 95 |
EXCLUDE = |
96 | 96 |
EXCLUDE_SYMLINKS = NO |
97 | 97 |
EXCLUDE_PATTERNS = |
98 | 98 |
EXCLUDE_SYMBOLS = |
99 | 99 |
EXAMPLE_PATH = @abs_top_srcdir@/demo \ |
100 | 100 |
@abs_top_srcdir@/LICENSE \ |
101 | 101 |
@abs_top_srcdir@/doc |
102 | 102 |
EXAMPLE_PATTERNS = |
103 | 103 |
EXAMPLE_RECURSIVE = NO |
104 | 104 |
IMAGE_PATH = @abs_top_srcdir@/doc/images \ |
105 |
|
|
105 |
@abs_top_builddir@/doc/gen-images |
|
106 | 106 |
INPUT_FILTER = |
107 | 107 |
FILTER_PATTERNS = |
108 | 108 |
FILTER_SOURCE_FILES = NO |
109 | 109 |
#--------------------------------------------------------------------------- |
110 | 110 |
# configuration options related to source browsing |
111 | 111 |
#--------------------------------------------------------------------------- |
112 | 112 |
SOURCE_BROWSER = NO |
113 | 113 |
INLINE_SOURCES = NO |
114 | 114 |
STRIP_CODE_COMMENTS = YES |
115 | 115 |
REFERENCED_BY_RELATION = NO |
116 | 116 |
REFERENCES_RELATION = NO |
117 | 117 |
REFERENCES_LINK_SOURCE = YES |
118 | 118 |
USE_HTAGS = NO |
119 | 119 |
VERBATIM_HEADERS = NO |
120 | 120 |
#--------------------------------------------------------------------------- |
121 | 121 |
# configuration options related to the alphabetical class index |
122 | 122 |
#--------------------------------------------------------------------------- |
123 | 123 |
ALPHABETICAL_INDEX = YES |
124 | 124 |
COLS_IN_ALPHA_INDEX = 2 |
125 | 125 |
IGNORE_PREFIX = |
126 | 126 |
#--------------------------------------------------------------------------- |
127 | 127 |
# configuration options related to the HTML output |
128 | 128 |
#--------------------------------------------------------------------------- |
129 | 129 |
GENERATE_HTML = YES |
130 | 130 |
HTML_OUTPUT = html |
131 | 131 |
HTML_FILE_EXTENSION = .html |
132 | 132 |
HTML_HEADER = |
133 | 133 |
HTML_FOOTER = |
134 | 134 |
HTML_STYLESHEET = |
135 | 135 |
HTML_ALIGN_MEMBERS = YES |
136 | 136 |
GENERATE_HTMLHELP = NO |
137 | 137 |
GENERATE_DOCSET = NO |
138 | 138 |
DOCSET_FEEDNAME = "Doxygen generated docs" |
139 | 139 |
DOCSET_BUNDLE_ID = org.doxygen.Project |
140 | 140 |
HTML_DYNAMIC_SECTIONS = NO |
141 | 141 |
CHM_FILE = |
142 | 142 |
HHC_LOCATION = |
143 | 143 |
GENERATE_CHI = NO |
144 | 144 |
BINARY_TOC = NO |
145 | 145 |
TOC_EXPAND = NO |
146 | 146 |
DISABLE_INDEX = NO |
147 | 147 |
ENUM_VALUES_PER_LINE = 4 |
148 | 148 |
GENERATE_TREEVIEW = YES |
149 | 149 |
TREEVIEW_WIDTH = 250 |
150 | 150 |
#--------------------------------------------------------------------------- |
151 | 151 |
# configuration options related to the LaTeX output |
152 | 152 |
#--------------------------------------------------------------------------- |
153 | 153 |
GENERATE_LATEX = NO |
154 | 154 |
LATEX_OUTPUT = latex |
155 | 155 |
LATEX_CMD_NAME = latex |
156 | 156 |
MAKEINDEX_CMD_NAME = makeindex |
157 | 157 |
COMPACT_LATEX = YES |
158 | 158 |
PAPER_TYPE = a4wide |
159 | 159 |
EXTRA_PACKAGES = amsmath \ |
160 | 160 |
amssymb |
161 | 161 |
LATEX_HEADER = |
162 | 162 |
PDF_HYPERLINKS = YES |
163 | 163 |
USE_PDFLATEX = YES |
164 | 164 |
LATEX_BATCHMODE = NO |
165 | 165 |
LATEX_HIDE_INDICES = NO |
166 | 166 |
#--------------------------------------------------------------------------- |
167 | 167 |
# configuration options related to the RTF output |
168 | 168 |
#--------------------------------------------------------------------------- |
169 | 169 |
GENERATE_RTF = NO |
170 | 170 |
RTF_OUTPUT = rtf |
171 | 171 |
COMPACT_RTF = NO |
172 | 172 |
RTF_HYPERLINKS = NO |
173 | 173 |
RTF_STYLESHEET_FILE = |
174 | 174 |
RTF_EXTENSIONS_FILE = |
175 | 175 |
#--------------------------------------------------------------------------- |
176 | 176 |
# configuration options related to the man page output |
177 | 177 |
#--------------------------------------------------------------------------- |
178 | 178 |
GENERATE_MAN = NO |
179 | 179 |
MAN_OUTPUT = man |
180 | 180 |
MAN_EXTENSION = .3 |
181 | 181 |
MAN_LINKS = NO |
182 | 182 |
#--------------------------------------------------------------------------- |
183 | 183 |
# configuration options related to the XML output |
184 | 184 |
#--------------------------------------------------------------------------- |
185 | 185 |
GENERATE_XML = NO |
186 | 186 |
XML_OUTPUT = xml |
187 | 187 |
XML_SCHEMA = |
188 | 188 |
XML_DTD = |
189 | 189 |
XML_PROGRAMLISTING = YES |
190 | 190 |
#--------------------------------------------------------------------------- |
191 | 191 |
# configuration options for the AutoGen Definitions output |
192 | 192 |
#--------------------------------------------------------------------------- |
193 | 193 |
GENERATE_AUTOGEN_DEF = NO |
194 | 194 |
#--------------------------------------------------------------------------- |
195 | 195 |
# configuration options related to the Perl module output |
196 | 196 |
#--------------------------------------------------------------------------- |
197 | 197 |
GENERATE_PERLMOD = NO |
198 | 198 |
PERLMOD_LATEX = NO |
199 | 199 |
PERLMOD_PRETTY = YES |
200 | 200 |
PERLMOD_MAKEVAR_PREFIX = |
201 | 201 |
#--------------------------------------------------------------------------- |
202 | 202 |
# Configuration options related to the preprocessor |
203 | 203 |
#--------------------------------------------------------------------------- |
204 | 204 |
ENABLE_PREPROCESSING = YES |
205 | 205 |
MACRO_EXPANSION = NO |
206 | 206 |
EXPAND_ONLY_PREDEF = NO |
207 | 207 |
SEARCH_INCLUDES = YES |
208 | 208 |
INCLUDE_PATH = |
209 | 209 |
INCLUDE_FILE_PATTERNS = |
210 | 210 |
PREDEFINED = DOXYGEN |
211 | 211 |
EXPAND_AS_DEFINED = |
212 | 212 |
SKIP_FUNCTION_MACROS = YES |
213 | 213 |
#--------------------------------------------------------------------------- |
214 | 214 |
# Configuration::additions related to external references |
215 | 215 |
#--------------------------------------------------------------------------- |
216 | 216 |
TAGFILES = "@abs_top_srcdir@/doc/libstdc++.tag = http://gcc.gnu.org/onlinedocs/libstdc++/latest-doxygen/ " |
217 | 217 |
GENERATE_TAGFILE = html/lemon.tag |
218 | 218 |
ALLEXTERNALS = NO |
219 | 219 |
EXTERNAL_GROUPS = NO |
220 | 220 |
PERL_PATH = /usr/bin/perl |
221 | 221 |
#--------------------------------------------------------------------------- |
222 | 222 |
# Configuration options related to the dot tool |
223 | 223 |
#--------------------------------------------------------------------------- |
224 | 224 |
CLASS_DIAGRAMS = NO |
225 | 225 |
MSCGEN_PATH = |
226 | 226 |
HIDE_UNDOC_RELATIONS = YES |
227 | 227 |
HAVE_DOT = YES |
228 | 228 |
CLASS_GRAPH = YES |
229 | 229 |
COLLABORATION_GRAPH = NO |
230 | 230 |
GROUP_GRAPHS = NO |
231 | 231 |
UML_LOOK = NO |
232 | 232 |
TEMPLATE_RELATIONS = NO |
233 | 233 |
INCLUDE_GRAPH = NO |
234 | 234 |
INCLUDED_BY_GRAPH = NO |
235 | 235 |
CALL_GRAPH = NO |
236 | 236 |
CALLER_GRAPH = NO |
237 | 237 |
GRAPHICAL_HIERARCHY = NO |
238 | 238 |
DIRECTORY_GRAPH = NO |
239 | 239 |
DOT_IMAGE_FORMAT = png |
240 | 240 |
DOT_PATH = |
241 | 241 |
DOTFILE_DIRS = |
242 | 242 |
DOT_GRAPH_MAX_NODES = 50 |
243 | 243 |
MAX_DOT_GRAPH_DEPTH = 0 |
244 | 244 |
DOT_TRANSPARENT = NO |
245 | 245 |
DOT_MULTI_TARGETS = NO |
246 | 246 |
GENERATE_LEGEND = YES |
247 | 247 |
DOT_CLEANUP = YES |
248 | 248 |
#--------------------------------------------------------------------------- |
249 | 249 |
# Configuration::additions related to the search engine |
250 | 250 |
#--------------------------------------------------------------------------- |
251 | 251 |
SEARCHENGINE = NO |
1 | 1 |
/* -*- mode: C++; indent-tabs-mode: nil; -*- |
2 | 2 |
* |
3 | 3 |
* This file is a part of LEMON, a generic C++ optimization library. |
4 | 4 |
* |
5 | 5 |
* Copyright (C) 2003-2008 |
6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
7 | 7 |
* (Egervary Research Group on Combinatorial Optimization, EGRES). |
8 | 8 |
* |
9 | 9 |
* Permission to use, modify and distribute this software is granted |
10 | 10 |
* provided that this copyright notice appears in all copies. For |
11 | 11 |
* precise terms see the accompanying LICENSE file. |
12 | 12 |
* |
13 | 13 |
* This software is provided "AS IS" with no warranty of any kind, |
14 | 14 |
* express or implied, and with no claim as to its suitability for any |
15 | 15 |
* purpose. |
16 | 16 |
* |
17 | 17 |
*/ |
18 | 18 |
|
19 | 19 |
namespace lemon { |
20 | 20 |
/*! |
21 | 21 |
|
22 | 22 |
|
23 | 23 |
|
24 | 24 |
\page lgf-format Lemon Graph Format (LGF) |
25 | 25 |
|
26 | 26 |
The \e LGF is a <em>column oriented</em> |
27 | 27 |
file format for storing graphs and associated data like |
28 | 28 |
node and edge maps. |
29 | 29 |
|
30 | 30 |
Each line with \c '#' first non-whitespace |
31 | 31 |
character is considered as a comment line. |
32 | 32 |
|
33 | 33 |
Otherwise the file consists of sections starting with |
34 | 34 |
a header line. The header lines starts with an \c '@' character followed by the |
35 | 35 |
type of section. The standard section types are \c \@nodes, \c |
36 | 36 |
\@arcs and \c \@edges |
37 | 37 |
and \@attributes. Each header line may also have an optional |
38 | 38 |
\e name, which can be use to distinguish the sections of the same |
39 | 39 |
type. |
40 | 40 |
|
41 | 41 |
The standard sections are column oriented, each line consists of |
42 | 42 |
<em>token</em>s separated by whitespaces. A token can be \e plain or |
43 | 43 |
\e quoted. A plain token is just a sequence of non-whitespace characters, |
44 | 44 |
while a quoted token is a |
45 | 45 |
character sequence surrounded by double quotes, and it can also |
46 | 46 |
contain whitespaces and escape sequences. |
47 | 47 |
|
48 | 48 |
The \c \@nodes section describes a set of nodes and associated |
49 | 49 |
maps. The first is a header line, its columns are the names of the |
50 | 50 |
maps appearing in the following lines. |
51 | 51 |
One of the maps must be called \c |
52 | 52 |
"label", which plays special role in the file. |
53 | 53 |
The following |
54 | 54 |
non-empty lines until the next section describes nodes of the |
55 | 55 |
graph. Each line contains the values of the node maps |
56 | 56 |
associated to the current node. |
57 | 57 |
|
58 | 58 |
\code |
59 | 59 |
@nodes |
60 |
label coordinates size title |
|
61 |
1 (10,20) 10 "First node" |
|
62 |
2 (80,80) 8 "Second node" |
|
63 |
3 (40,10) 10 "Third node" |
|
60 |
label coordinates size title |
|
61 |
1 (10,20) 10 "First node" |
|
62 |
2 (80,80) 8 "Second node" |
|
63 |
3 (40,10) 10 "Third node" |
|
64 | 64 |
\endcode |
65 | 65 |
|
66 | 66 |
The \c \@arcs section is very similar to the \c \@nodes section, |
67 | 67 |
it again starts with a header line describing the names of the maps, |
68 | 68 |
but the \c "label" map is not obligatory here. The following lines |
69 | 69 |
describe the arcs. The first two tokens of each line are |
70 | 70 |
the source and the target node of the arc, respectively, then come the map |
71 | 71 |
values. The source and target tokens must be node labels. |
72 | 72 |
|
73 | 73 |
\code |
74 | 74 |
@arcs |
75 |
|
|
75 |
capacity |
|
76 | 76 |
1 2 16 |
77 | 77 |
1 3 12 |
78 | 78 |
2 3 18 |
79 | 79 |
\endcode |
80 | 80 |
|
81 | 81 |
The \c \@edges is just a synonym of \c \@arcs. The @arcs section can |
82 | 82 |
also store the edge set of an undirected graph. In such case there is |
83 | 83 |
a conventional method for store arc maps in the file, if two columns |
84 | 84 |
has the same caption with \c '+' and \c '-' prefix, then these columns |
85 | 85 |
can be regarded as the values of an arc map. |
86 | 86 |
|
87 | 87 |
The \c \@attributes section contains key-value pairs, each line |
88 | 88 |
consists of two tokens, an attribute name, and then an attribute |
89 | 89 |
value. The value of the attribute could be also a label value of a |
90 | 90 |
node or an edge, or even an edge label prefixed with \c '+' or \c '-', |
91 | 91 |
which regards to the forward or backward directed arc of the |
92 | 92 |
corresponding edge. |
93 | 93 |
|
94 | 94 |
\code |
95 | 95 |
@attributes |
96 | 96 |
source 1 |
97 | 97 |
target 3 |
98 | 98 |
caption "LEMON test digraph" |
99 | 99 |
\endcode |
100 | 100 |
|
101 | 101 |
The \e LGF can contain extra sections, but there is no restriction on |
102 | 102 |
the format of such sections. |
103 | 103 |
|
104 | 104 |
*/ |
105 | 105 |
} |
106 | 106 |
|
107 | 107 |
// LocalWords: whitespace whitespaces |
1 | 1 |
/* -*- mode: C++; indent-tabs-mode: nil; -*- |
2 | 2 |
* |
3 | 3 |
* This file is a part of LEMON, a generic C++ optimization library. |
4 | 4 |
* |
5 | 5 |
* Copyright (C) 2003-2008 |
6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
7 | 7 |
* (Egervary Research Group on Combinatorial Optimization, EGRES). |
8 | 8 |
* |
9 | 9 |
* Permission to use, modify and distribute this software is granted |
10 | 10 |
* provided that this copyright notice appears in all copies. For |
11 | 11 |
* precise terms see the accompanying LICENSE file. |
12 | 12 |
* |
13 | 13 |
* This software is provided "AS IS" with no warranty of any kind, |
14 | 14 |
* express or implied, and with no claim as to its suitability for any |
15 | 15 |
* purpose. |
16 | 16 |
* |
17 | 17 |
*/ |
18 | 18 |
|
19 | 19 |
#ifndef LEMON_ASSERT_H |
20 | 20 |
#define LEMON_ASSERT_H |
21 | 21 |
|
22 | 22 |
/// \ingroup exceptions |
23 | 23 |
/// \file |
24 | 24 |
/// \brief Extended assertion handling |
25 | 25 |
|
26 | 26 |
#include <lemon/error.h> |
27 | 27 |
|
28 | 28 |
namespace lemon { |
29 | 29 |
|
30 | 30 |
inline void assert_fail_log(const char *file, int line, const char *function, |
31 | 31 |
const char *message, const char *assertion) |
32 | 32 |
{ |
33 | 33 |
std::cerr << file << ":" << line << ": "; |
34 | 34 |
if (function) |
35 | 35 |
std::cerr << function << ": "; |
36 | 36 |
std::cerr << message; |
37 | 37 |
if (assertion) |
38 | 38 |
std::cerr << " (assertion '" << assertion << "' failed)"; |
39 | 39 |
std::cerr << std::endl; |
40 | 40 |
} |
41 | 41 |
|
42 | 42 |
inline void assert_fail_abort(const char *file, int line, |
43 | 43 |
const char *function, const char* message, |
44 | 44 |
const char *assertion) |
45 | 45 |
{ |
46 | 46 |
assert_fail_log(file, line, function, message, assertion); |
47 | 47 |
std::abort(); |
48 | 48 |
} |
49 | 49 |
|
50 | 50 |
namespace _assert_bits { |
51 | 51 |
|
52 | 52 |
|
53 | 53 |
inline const char* cstringify(const std::string& str) { |
54 | 54 |
return str.c_str(); |
55 | 55 |
} |
56 | 56 |
|
57 | 57 |
inline const char* cstringify(const char* str) { |
58 | 58 |
return str; |
59 | 59 |
} |
60 | 60 |
} |
61 | 61 |
} |
62 | 62 |
|
63 | 63 |
#endif // LEMON_ASSERT_H |
64 | 64 |
|
65 | 65 |
#undef LEMON_ASSERT |
66 | 66 |
#undef LEMON_FIXME |
67 | 67 |
#undef LEMON_DEBUG |
68 | 68 |
|
69 |
#if (defined(LEMON_ASSERT_LOG) ? 1 : 0) + \ |
|
70 |
(defined(LEMON_ASSERT_ABORT) ? 1 : 0) + \ |
|
69 |
#if (defined(LEMON_ASSERT_LOG) ? 1 : 0) + \ |
|
70 |
(defined(LEMON_ASSERT_ABORT) ? 1 : 0) + \ |
|
71 | 71 |
(defined(LEMON_ASSERT_CUSTOM) ? 1 : 0) > 1 |
72 | 72 |
#error "LEMON assertion system is not set properly" |
73 | 73 |
#endif |
74 | 74 |
|
75 |
#if ((defined(LEMON_ASSERT_LOG) ? 1 : 0) + \ |
|
76 |
(defined(LEMON_ASSERT_ABORT) ? 1 : 0) + \ |
|
77 |
(defined(LEMON_ASSERT_CUSTOM) ? 1 : 0) == 1 || \ |
|
78 |
defined(LEMON_ENABLE_ASSERTS)) && \ |
|
79 |
|
|
75 |
#if ((defined(LEMON_ASSERT_LOG) ? 1 : 0) + \ |
|
76 |
(defined(LEMON_ASSERT_ABORT) ? 1 : 0) + \ |
|
77 |
(defined(LEMON_ASSERT_CUSTOM) ? 1 : 0) == 1 || \ |
|
78 |
defined(LEMON_ENABLE_ASSERTS)) && \ |
|
79 |
(defined(LEMON_DISABLE_ASSERTS) || \ |
|
80 | 80 |
defined(NDEBUG)) |
81 | 81 |
#error "LEMON assertion system is not set properly" |
82 | 82 |
#endif |
83 | 83 |
|
84 | 84 |
|
85 | 85 |
#if defined LEMON_ASSERT_LOG |
86 | 86 |
# undef LEMON_ASSERT_HANDLER |
87 | 87 |
# define LEMON_ASSERT_HANDLER ::lemon::assert_fail_log |
88 | 88 |
#elif defined LEMON_ASSERT_ABORT |
89 | 89 |
# undef LEMON_ASSERT_HANDLER |
90 | 90 |
# define LEMON_ASSERT_HANDLER ::lemon::assert_fail_abort |
91 | 91 |
#elif defined LEMON_ASSERT_CUSTOM |
92 | 92 |
# undef LEMON_ASSERT_HANDLER |
93 | 93 |
# ifndef LEMON_CUSTOM_ASSERT_HANDLER |
94 | 94 |
# error "LEMON_CUSTOM_ASSERT_HANDLER is not set" |
95 | 95 |
# endif |
96 | 96 |
# define LEMON_ASSERT_HANDLER LEMON_CUSTOM_ASSERT_HANDLER |
97 | 97 |
#elif defined LEMON_DISABLE_ASSERTS |
98 | 98 |
# undef LEMON_ASSERT_HANDLER |
99 | 99 |
#elif defined NDEBUG |
100 | 100 |
# undef LEMON_ASSERT_HANDLER |
101 | 101 |
#else |
102 | 102 |
# define LEMON_ASSERT_HANDLER ::lemon::assert_fail_abort |
103 | 103 |
#endif |
104 | 104 |
|
105 | 105 |
#ifndef LEMON_FUNCTION_NAME |
106 | 106 |
# if defined __GNUC__ |
107 | 107 |
# define LEMON_FUNCTION_NAME (__PRETTY_FUNCTION__) |
108 | 108 |
# elif defined _MSC_VER |
109 | 109 |
# define LEMON_FUNCTION_NAME (__FUNCSIG__) |
110 | 110 |
# else |
111 | 111 |
# define LEMON_FUNCTION_NAME (__func__) |
112 | 112 |
# endif |
113 | 113 |
#endif |
114 | 114 |
|
115 | 115 |
#ifdef DOXYGEN |
116 | 116 |
|
117 | 117 |
/// \ingroup exceptions |
118 | 118 |
/// |
119 | 119 |
/// \brief Macro for assertion with customizable message |
120 | 120 |
/// |
121 | 121 |
/// Macro for assertion with customizable message. \param exp An |
122 | 122 |
/// expression that must be convertible to \c bool. If it is \c |
123 | 123 |
/// false, then an assertion is raised. The concrete behaviour depends |
124 | 124 |
/// on the settings of the assertion system. \param msg A <tt>const |
125 | 125 |
/// char*</tt> parameter, which can be used to provide information |
126 | 126 |
/// about the circumstances of the failed assertion. |
127 | 127 |
/// |
128 | 128 |
/// The assertions are enabled in the default behaviour. |
129 | 129 |
/// You can disable them with the following code: |
130 | 130 |
/// \code |
131 | 131 |
/// #define LEMON_DISABLE_ASSERTS |
132 | 132 |
/// \endcode |
133 | 133 |
/// or with compilation parameters: |
134 | 134 |
/// \code |
135 | 135 |
/// g++ -DLEMON_DISABLE_ASSERTS |
136 | 136 |
/// make CXXFLAGS='-DLEMON_DISABLE_ASSERTS' |
137 | 137 |
/// \endcode |
138 | 138 |
/// The checking is also disabled when the standard macro \c NDEBUG is defined. |
139 | 139 |
/// |
140 | 140 |
/// The LEMON assertion system has a wide range of customization |
141 | 141 |
/// properties. As a default behaviour the failed assertion prints a |
142 | 142 |
/// short log message to the standard error and aborts the execution. |
143 | 143 |
/// |
144 | 144 |
/// The following modes can be used in the assertion system: |
145 | 145 |
/// |
146 | 146 |
/// - \c LEMON_ASSERT_LOG The failed assertion prints a short log |
147 | 147 |
/// message to the standard error and continues the execution. |
148 | 148 |
/// - \c LEMON_ASSERT_ABORT This mode is similar to the \c |
149 | 149 |
/// LEMON_ASSERT_LOG, but it aborts the program. It is the default |
150 | 150 |
/// behaviour. |
151 | 151 |
/// - \c LEMON_ASSERT_CUSTOM The user can define own assertion handler |
152 | 152 |
/// function. |
153 | 153 |
/// \code |
154 | 154 |
/// void custom_assert_handler(const char* file, int line, |
155 | 155 |
/// const char* function, const char* message, |
156 | 156 |
/// const char* assertion); |
157 | 157 |
/// \endcode |
158 | 158 |
/// The name of the function should be defined as the \c |
159 | 159 |
/// LEMON_CUSTOM_ASSERT_HANDLER macro name. |
160 | 160 |
/// \code |
161 | 161 |
/// #define LEMON_CUSTOM_ASSERT_HANDLER custom_assert_handler |
162 | 162 |
/// \endcode |
163 | 163 |
/// Whenever an assertion is occured, the custom assertion |
164 | 164 |
/// handler is called with appropiate parameters. |
165 | 165 |
/// |
166 | 166 |
/// The assertion mode can also be changed within one compilation unit. |
167 | 167 |
/// If the macros are redefined with other settings and the |
168 | 168 |
/// \ref lemon/assert.h "assert.h" file is reincluded, then the |
169 | 169 |
/// behaviour is changed appropiately to the new settings. |
170 | 170 |
# define LEMON_ASSERT(exp, msg) \ |
171 |
(static_cast<void> (!!(exp) ? 0 : ( \ |
|
172 |
LEMON_ASSERT_HANDLER(__FILE__, __LINE__, \ |
|
173 |
|
|
171 |
(static_cast<void> (!!(exp) ? 0 : ( \ |
|
172 |
LEMON_ASSERT_HANDLER(__FILE__, __LINE__, \ |
|
173 |
LEMON_FUNCTION_NAME, \ |
|
174 | 174 |
::lemon::_assert_bits::cstringify(msg), #exp), 0))) |
175 | 175 |
|
176 | 176 |
/// \ingroup exceptions |
177 | 177 |
/// |
178 | 178 |
/// \brief Macro for mark not yet implemented features. |
179 | 179 |
/// |
180 | 180 |
/// Macro for mark not yet implemented features and outstanding bugs. |
181 | 181 |
/// It is close to be the shortcut of the following code: |
182 | 182 |
/// \code |
183 | 183 |
/// LEMON_ASSERT(false, msg); |
184 | 184 |
/// \endcode |
185 | 185 |
/// |
186 | 186 |
/// \see LEMON_ASSERT |
187 |
# define LEMON_FIXME(msg) |
|
187 |
# define LEMON_FIXME(msg) \ |
|
188 | 188 |
(LEMON_ASSERT_HANDLER(__FILE__, __LINE__, LEMON_FUNCTION_NAME, \ |
189 |
::lemon::_assert_bits::cstringify(msg), |
|
189 |
::lemon::_assert_bits::cstringify(msg), \ |
|
190 | 190 |
static_cast<const char*>(0))) |
191 | 191 |
|
192 | 192 |
/// \ingroup exceptions |
193 | 193 |
/// |
194 | 194 |
/// \brief Macro for internal assertions |
195 | 195 |
/// |
196 | 196 |
/// Macro for internal assertions, it is used in the library to check |
197 | 197 |
/// the consistency of results of algorithms, several pre- and |
198 | 198 |
/// postconditions and invariants. The checking is disabled by |
199 | 199 |
/// default, but it can be turned on with the macro \c |
200 | 200 |
/// LEMON_ENABLE_DEBUG. |
201 | 201 |
/// \code |
202 | 202 |
/// #define LEMON_ENABLE_DEBUG |
203 | 203 |
/// \endcode |
204 | 204 |
/// or with compilation parameters: |
205 | 205 |
/// \code |
206 | 206 |
/// g++ -DLEMON_ENABLE_DEBUG |
207 | 207 |
/// make CXXFLAGS='-DLEMON_ENABLE_DEBUG' |
208 | 208 |
/// \endcode |
209 | 209 |
/// |
210 | 210 |
/// This macro works like the \c LEMON_ASSERT macro, therefore the |
211 | 211 |
/// current behaviour depends on the settings of \c LEMON_ASSERT |
212 | 212 |
/// macro. |
213 | 213 |
/// |
214 | 214 |
/// \see LEMON_ASSERT |
215 |
# define LEMON_DEBUG(exp, msg) \ |
|
216 |
(static_cast<void> (!!(exp) ? 0 : ( \ |
|
215 |
# define LEMON_DEBUG(exp, msg) \ |
|
216 |
(static_cast<void> (!!(exp) ? 0 : ( \ |
|
217 | 217 |
LEMON_ASSERT_HANDLER(__FILE__, __LINE__, \ |
218 |
LEMON_FUNCTION_NAME, |
|
218 |
LEMON_FUNCTION_NAME, \ |
|
219 | 219 |
::lemon::_assert_bits::cstringify(msg), #exp), 0))) |
220 | 220 |
|
221 | 221 |
#else |
222 | 222 |
|
223 | 223 |
# ifndef LEMON_ASSERT_HANDLER |
224 | 224 |
# define LEMON_ASSERT(exp, msg) (static_cast<void>(0)) |
225 | 225 |
# define LEMON_FIXME(msg) (static_cast<void>(0)) |
226 | 226 |
# define LEMON_DEBUG(exp, msg) (static_cast<void>(0)) |
227 | 227 |
# else |
228 |
# define LEMON_ASSERT(exp, msg) \ |
|
229 |
(static_cast<void> (!!(exp) ? 0 : ( \ |
|
228 |
# define LEMON_ASSERT(exp, msg) \ |
|
229 |
(static_cast<void> (!!(exp) ? 0 : ( \ |
|
230 | 230 |
LEMON_ASSERT_HANDLER(__FILE__, __LINE__, \ |
231 |
LEMON_FUNCTION_NAME, \ |
|
232 |
::lemon::_assert_bits::cstringify(msg), \ |
|
231 |
LEMON_FUNCTION_NAME, \ |
|
232 |
::lemon::_assert_bits::cstringify(msg), \ |
|
233 | 233 |
#exp), 0))) |
234 |
# define LEMON_FIXME(msg) \ |
|
235 |
(LEMON_ASSERT_HANDLER(__FILE__, __LINE__, LEMON_FUNCTION_NAME, \ |
|
236 |
|
|
234 |
# define LEMON_FIXME(msg) \ |
|
235 |
(LEMON_ASSERT_HANDLER(__FILE__, __LINE__, LEMON_FUNCTION_NAME, \ |
|
236 |
::lemon::_assert_bits::cstringify(msg), \ |
|
237 | 237 |
static_cast<const char*>(0))) |
238 | 238 |
|
239 | 239 |
# if LEMON_ENABLE_DEBUG |
240 | 240 |
# define LEMON_DEBUG(exp, msg) |
241 |
(static_cast<void> (!!(exp) ? 0 : ( \ |
|
242 |
LEMON_ASSERT_HANDLER(__FILE__, __LINE__, \ |
|
243 |
LEMON_FUNCTION_NAME, \ |
|
244 |
::lemon::_assert_bits::cstringify(msg), \ |
|
241 |
(static_cast<void> (!!(exp) ? 0 : ( \ |
|
242 |
LEMON_ASSERT_HANDLER(__FILE__, __LINE__, \ |
|
243 |
LEMON_FUNCTION_NAME, \ |
|
244 |
::lemon::_assert_bits::cstringify(msg), \ |
|
245 | 245 |
#exp), 0))) |
246 | 246 |
# else |
247 | 247 |
# define LEMON_DEBUG(exp, msg) (static_cast<void>(0)) |
248 | 248 |
# endif |
249 | 249 |
# endif |
250 | 250 |
|
251 | 251 |
#endif |
252 |
|
|
253 |
#ifdef DOXYGEN |
|
254 |
|
|
255 |
|
|
256 |
#else |
|
257 |
|
|
258 |
|
|
259 |
#endif |
|
260 |
|
|
261 |
1 | 1 |
/* -*- mode: C++; indent-tabs-mode: nil; -*- |
2 | 2 |
* |
3 | 3 |
* This file is a part of LEMON, a generic C++ optimization library. |
4 | 4 |
* |
5 | 5 |
* Copyright (C) 2003-2008 |
6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
7 | 7 |
* (Egervary Research Group on Combinatorial Optimization, EGRES). |
8 | 8 |
* |
9 | 9 |
* Permission to use, modify and distribute this software is granted |
10 | 10 |
* provided that this copyright notice appears in all copies. For |
11 | 11 |
* precise terms see the accompanying LICENSE file. |
12 | 12 |
* |
13 | 13 |
* This software is provided "AS IS" with no warranty of any kind, |
14 | 14 |
* express or implied, and with no claim as to its suitability for any |
15 | 15 |
* purpose. |
16 | 16 |
* |
17 | 17 |
*/ |
18 | 18 |
|
19 | 19 |
///\ingroup concept |
20 | 20 |
///\file |
21 | 21 |
///\brief Classes for representing paths in digraphs. |
22 | 22 |
/// |
23 | 23 |
///\todo Iterators have obsolete style |
24 | 24 |
|
25 | 25 |
#ifndef LEMON_CONCEPT_PATH_H |
26 | 26 |
#define LEMON_CONCEPT_PATH_H |
27 | 27 |
|
28 | 28 |
#include <lemon/bits/invalid.h> |
29 | 29 |
#include <lemon/bits/utility.h> |
30 | 30 |
#include <lemon/concept_check.h> |
31 | 31 |
|
32 | 32 |
namespace lemon { |
33 | 33 |
namespace concepts { |
34 | 34 |
|
35 | 35 |
/// \addtogroup concept |
36 | 36 |
/// @{ |
37 | 37 |
|
38 | 38 |
/// \brief A skeleton structure for representing directed paths in |
39 | 39 |
/// a digraph. |
40 | 40 |
/// |
41 | 41 |
/// A skeleton structure for representing directed paths in a |
42 | 42 |
/// digraph. |
43 | 43 |
/// \tparam _Digraph The digraph type in which the path is. |
44 | 44 |
/// |
45 | 45 |
/// In a sense, the path can be treated as a list of arcs. The |
46 | 46 |
/// lemon path type stores just this list. As a consequence it |
47 | 47 |
/// cannot enumerate the nodes in the path and the zero length |
48 | 48 |
/// paths cannot store the source. |
49 | 49 |
/// |
50 | 50 |
template <typename _Digraph> |
51 | 51 |
class Path { |
52 | 52 |
public: |
53 | 53 |
|
54 | 54 |
/// Type of the underlying digraph. |
55 | 55 |
typedef _Digraph Digraph; |
56 | 56 |
/// Arc type of the underlying digraph. |
57 | 57 |
typedef typename Digraph::Arc Arc; |
58 | 58 |
|
59 | 59 |
class ArcIt; |
60 | 60 |
|
61 | 61 |
/// \brief Default constructor |
62 | 62 |
Path() {} |
63 | 63 |
|
64 | 64 |
/// \brief Template constructor |
65 | 65 |
template <typename CPath> |
66 | 66 |
Path(const CPath& cpath) {} |
67 | 67 |
|
68 | 68 |
/// \brief Template assigment |
69 | 69 |
template <typename CPath> |
70 | 70 |
Path& operator=(const CPath& cpath) {} |
71 | 71 |
|
72 | 72 |
/// Length of the path ie. the number of arcs in the path. |
73 | 73 |
int length() const { return 0;} |
74 | 74 |
|
75 | 75 |
/// Returns whether the path is empty. |
76 | 76 |
bool empty() const { return true;} |
77 | 77 |
|
78 | 78 |
/// Resets the path to an empty path. |
79 | 79 |
void clear() {} |
80 | 80 |
|
81 | 81 |
/// \brief Lemon style iterator for path arcs |
82 | 82 |
/// |
83 | 83 |
/// This class is used to iterate on the arcs of the paths. |
84 | 84 |
class ArcIt { |
85 | 85 |
public: |
86 | 86 |
/// Default constructor |
87 | 87 |
ArcIt() {} |
88 | 88 |
/// Invalid constructor |
89 | 89 |
ArcIt(Invalid) {} |
90 | 90 |
/// Constructor for first arc |
91 | 91 |
ArcIt(const Path &) {} |
92 | 92 |
|
93 | 93 |
/// Conversion to Arc |
94 | 94 |
operator Arc() const { return INVALID; } |
95 | 95 |
|
96 | 96 |
/// Next arc |
97 | 97 |
ArcIt& operator++() {return *this;} |
98 | 98 |
|
99 | 99 |
/// Comparison operator |
100 | 100 |
bool operator==(const ArcIt&) const {return true;} |
101 | 101 |
/// Comparison operator |
102 | 102 |
bool operator!=(const ArcIt&) const {return true;} |
103 |
/// Comparison operator |
|
104 |
bool operator<(const ArcIt&) const {return false;} |
|
103 |
/// Comparison operator |
|
104 |
bool operator<(const ArcIt&) const {return false;} |
|
105 | 105 |
|
106 | 106 |
}; |
107 | 107 |
|
108 | 108 |
template <typename _Path> |
109 | 109 |
struct Constraints { |
110 | 110 |
void constraints() { |
111 | 111 |
Path<Digraph> pc; |
112 | 112 |
_Path p, pp(pc); |
113 | 113 |
int l = p.length(); |
114 | 114 |
int e = p.empty(); |
115 | 115 |
p.clear(); |
116 | 116 |
|
117 | 117 |
p = pc; |
118 | 118 |
|
119 | 119 |
typename _Path::ArcIt id, ii(INVALID), i(p); |
120 | 120 |
|
121 | 121 |
++i; |
122 | 122 |
typename Digraph::Arc ed = i; |
123 | 123 |
|
124 | 124 |
e = (i == ii); |
125 | 125 |
e = (i != ii); |
126 | 126 |
e = (i < ii); |
127 | 127 |
|
128 | 128 |
ignore_unused_variable_warning(l); |
129 | 129 |
ignore_unused_variable_warning(pp); |
130 | 130 |
ignore_unused_variable_warning(e); |
131 | 131 |
ignore_unused_variable_warning(id); |
132 | 132 |
ignore_unused_variable_warning(ii); |
133 | 133 |
ignore_unused_variable_warning(ed); |
134 | 134 |
} |
135 | 135 |
}; |
136 | 136 |
|
137 | 137 |
}; |
138 | 138 |
|
139 | 139 |
namespace _path_bits { |
140 | 140 |
|
141 | 141 |
template <typename _Digraph, typename _Path, typename RevPathTag = void> |
142 | 142 |
struct PathDumperConstraints { |
143 | 143 |
void constraints() { |
144 | 144 |
int l = p.length(); |
145 | 145 |
int e = p.empty(); |
146 | 146 |
|
147 | 147 |
typename _Path::ArcIt id, i(p); |
148 | 148 |
|
149 | 149 |
++i; |
150 | 150 |
typename _Digraph::Arc ed = i; |
151 | 151 |
|
152 | 152 |
e = (i == INVALID); |
153 | 153 |
e = (i != INVALID); |
154 | 154 |
|
155 | 155 |
ignore_unused_variable_warning(l); |
156 | 156 |
ignore_unused_variable_warning(e); |
157 | 157 |
ignore_unused_variable_warning(id); |
158 | 158 |
ignore_unused_variable_warning(ed); |
159 | 159 |
} |
160 | 160 |
_Path& p; |
161 | 161 |
}; |
162 | 162 |
|
163 | 163 |
template <typename _Digraph, typename _Path> |
164 | 164 |
struct PathDumperConstraints< |
165 | 165 |
_Digraph, _Path, |
166 | 166 |
typename enable_if<typename _Path::RevPathTag, void>::type |
167 | 167 |
> { |
168 | 168 |
void constraints() { |
169 | 169 |
int l = p.length(); |
170 | 170 |
int e = p.empty(); |
171 | 171 |
|
172 | 172 |
typename _Path::RevArcIt id, i(p); |
173 | 173 |
|
174 | 174 |
++i; |
175 | 175 |
typename _Digraph::Arc ed = i; |
176 | 176 |
|
177 | 177 |
e = (i == INVALID); |
178 | 178 |
e = (i != INVALID); |
179 | 179 |
|
180 | 180 |
ignore_unused_variable_warning(l); |
181 | 181 |
ignore_unused_variable_warning(e); |
182 | 182 |
ignore_unused_variable_warning(id); |
183 | 183 |
ignore_unused_variable_warning(ed); |
184 | 184 |
} |
185 | 185 |
_Path& p; |
186 | 186 |
}; |
187 | 187 |
|
188 | 188 |
} |
189 | 189 |
|
190 | 190 |
|
191 | 191 |
/// \brief A skeleton structure for path dumpers. |
192 | 192 |
/// |
193 | 193 |
/// A skeleton structure for path dumpers. The path dumpers are |
194 | 194 |
/// the generalization of the paths. The path dumpers can |
195 | 195 |
/// enumerate the arcs of the path wheter in forward or in |
196 | 196 |
/// backward order. In most time these classes are not used |
197 | 197 |
/// directly rather it used to assign a dumped class to a real |
198 | 198 |
/// path type. |
199 | 199 |
/// |
200 | 200 |
/// The main purpose of this concept is that the shortest path |
201 | 201 |
/// algorithms can enumerate easily the arcs in reverse order. |
202 | 202 |
/// If we would like to give back a real path from these |
203 | 203 |
/// algorithms then we should create a temporarly path object. In |
204 | 204 |
/// Lemon such algorithms gives back a path dumper what can |
205 | 205 |
/// assigned to a real path and the dumpers can be implemented as |
206 | 206 |
/// an adaptor class to the predecessor map. |
207 | 207 |
|
208 | 208 |
/// \tparam _Digraph The digraph type in which the path is. |
209 | 209 |
/// |
210 | 210 |
/// The paths can be constructed from any path type by a |
211 | 211 |
/// template constructor or a template assignment operator. |
212 | 212 |
/// |
213 | 213 |
template <typename _Digraph> |
214 | 214 |
class PathDumper { |
215 | 215 |
public: |
216 | 216 |
|
217 | 217 |
/// Type of the underlying digraph. |
218 | 218 |
typedef _Digraph Digraph; |
219 | 219 |
/// Arc type of the underlying digraph. |
220 | 220 |
typedef typename Digraph::Arc Arc; |
221 | 221 |
|
222 | 222 |
/// Length of the path ie. the number of arcs in the path. |
223 | 223 |
int length() const { return 0;} |
224 | 224 |
|
225 | 225 |
/// Returns whether the path is empty. |
226 | 226 |
bool empty() const { return true;} |
227 | 227 |
|
228 | 228 |
/// \brief Forward or reverse dumping |
229 | 229 |
/// |
230 | 230 |
/// If the RevPathTag is defined and true then reverse dumping |
231 | 231 |
/// is provided in the path dumper. In this case instead of the |
232 | 232 |
/// ArcIt the RevArcIt iterator should be implemented in the |
233 | 233 |
/// dumper. |
234 | 234 |
typedef False RevPathTag; |
235 | 235 |
|
236 | 236 |
/// \brief Lemon style iterator for path arcs |
237 | 237 |
/// |
238 | 238 |
/// This class is used to iterate on the arcs of the paths. |
239 | 239 |
class ArcIt { |
240 | 240 |
public: |
241 | 241 |
/// Default constructor |
242 | 242 |
ArcIt() {} |
243 | 243 |
/// Invalid constructor |
244 | 244 |
ArcIt(Invalid) {} |
245 | 245 |
/// Constructor for first arc |
246 | 246 |
ArcIt(const PathDumper&) {} |
247 | 247 |
|
248 | 248 |
/// Conversion to Arc |
249 | 249 |
operator Arc() const { return INVALID; } |
250 | 250 |
|
251 | 251 |
/// Next arc |
252 | 252 |
ArcIt& operator++() {return *this;} |
253 | 253 |
|
254 | 254 |
/// Comparison operator |
255 | 255 |
bool operator==(const ArcIt&) const {return true;} |
256 | 256 |
/// Comparison operator |
257 | 257 |
bool operator!=(const ArcIt&) const {return true;} |
258 |
/// Comparison operator |
|
259 |
bool operator<(const ArcIt&) const {return false;} |
|
258 |
/// Comparison operator |
|
259 |
bool operator<(const ArcIt&) const {return false;} |
|
260 | 260 |
|
261 | 261 |
}; |
262 | 262 |
|
263 | 263 |
/// \brief Lemon style iterator for path arcs |
264 | 264 |
/// |
265 | 265 |
/// This class is used to iterate on the arcs of the paths in |
266 | 266 |
/// reverse direction. |
267 | 267 |
class RevArcIt { |
268 | 268 |
public: |
269 | 269 |
/// Default constructor |
270 | 270 |
RevArcIt() {} |
271 | 271 |
/// Invalid constructor |
272 | 272 |
RevArcIt(Invalid) {} |
273 | 273 |
/// Constructor for first arc |
274 | 274 |
RevArcIt(const PathDumper &) {} |
275 | 275 |
|
276 | 276 |
/// Conversion to Arc |
277 | 277 |
operator Arc() const { return INVALID; } |
278 | 278 |
|
279 | 279 |
/// Next arc |
280 | 280 |
RevArcIt& operator++() {return *this;} |
281 | 281 |
|
282 | 282 |
/// Comparison operator |
283 | 283 |
bool operator==(const RevArcIt&) const {return true;} |
284 | 284 |
/// Comparison operator |
285 | 285 |
bool operator!=(const RevArcIt&) const {return true;} |
286 |
/// Comparison operator |
|
287 |
bool operator<(const RevArcIt&) const {return false;} |
|
286 |
/// Comparison operator |
|
287 |
bool operator<(const RevArcIt&) const {return false;} |
|
288 | 288 |
|
289 | 289 |
}; |
290 | 290 |
|
291 | 291 |
template <typename _Path> |
292 | 292 |
struct Constraints { |
293 | 293 |
void constraints() { |
294 | 294 |
function_requires<_path_bits:: |
295 | 295 |
PathDumperConstraints<Digraph, _Path> >(); |
296 | 296 |
} |
297 | 297 |
}; |
298 | 298 |
|
299 | 299 |
}; |
300 | 300 |
|
301 | 301 |
|
302 | 302 |
///@} |
303 | 303 |
} |
304 | 304 |
|
305 | 305 |
} // namespace lemon |
306 | 306 |
|
307 | 307 |
#endif // LEMON_CONCEPT_PATH_H |
1 | 1 |
/* -*- mode: C++; indent-tabs-mode: nil; -*- |
2 | 2 |
* |
3 | 3 |
* This file is a part of LEMON, a generic C++ optimization library. |
4 | 4 |
* |
5 | 5 |
* Copyright (C) 2003-2008 |
6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
7 | 7 |
* (Egervary Research Group on Combinatorial Optimization, EGRES). |
8 | 8 |
* |
9 | 9 |
* Permission to use, modify and distribute this software is granted |
10 | 10 |
* provided that this copyright notice appears in all copies. For |
11 | 11 |
* precise terms see the accompanying LICENSE file. |
12 | 12 |
* |
13 | 13 |
* This software is provided "AS IS" with no warranty of any kind, |
14 | 14 |
* express or implied, and with no claim as to its suitability for any |
15 | 15 |
* purpose. |
16 | 16 |
* |
17 | 17 |
*/ |
18 | 18 |
|
19 | 19 |
#ifndef LEMON_ERROR_H |
20 | 20 |
#define LEMON_ERROR_H |
21 | 21 |
|
22 | 22 |
/// \ingroup exceptions |
23 | 23 |
/// \file |
24 | 24 |
/// \brief Basic exception classes and error handling. |
25 | 25 |
|
26 | 26 |
#include <exception> |
27 | 27 |
#include <string> |
28 | 28 |
#include <sstream> |
29 | 29 |
#include <iostream> |
30 | 30 |
#include <cstdlib> |
31 | 31 |
#include <memory> |
32 | 32 |
|
33 | 33 |
namespace lemon { |
34 | 34 |
|
35 | 35 |
/// \addtogroup exceptions |
36 | 36 |
/// @{ |
37 | 37 |
|
38 | 38 |
/// \brief Exception safe wrapper class. |
39 | 39 |
/// |
40 | 40 |
/// Exception safe wrapper class to implement the members of exceptions. |
41 | 41 |
template <typename _Type> |
42 | 42 |
class ExceptionMember { |
43 | 43 |
public: |
44 | 44 |
typedef _Type Type; |
45 | 45 |
|
46 | 46 |
ExceptionMember() throw() { |
47 | 47 |
try { |
48 | 48 |
ptr.reset(new Type()); |
49 | 49 |
} catch (...) {} |
50 | 50 |
} |
51 | 51 |
|
52 | 52 |
ExceptionMember(const Type& type) throw() { |
53 | 53 |
try { |
54 | 54 |
ptr.reset(new Type()); |
55 | 55 |
if (ptr.get() == 0) return; |
56 | 56 |
*ptr = type; |
57 | 57 |
} catch (...) {} |
58 | 58 |
} |
59 | 59 |
|
60 | 60 |
ExceptionMember(const ExceptionMember& copy) throw() { |
61 | 61 |
try { |
62 | 62 |
if (!copy.valid()) return; |
63 | 63 |
ptr.reset(new Type()); |
64 | 64 |
if (ptr.get() == 0) return; |
65 | 65 |
*ptr = copy.get(); |
66 | 66 |
} catch (...) {} |
67 | 67 |
} |
68 | 68 |
|
69 | 69 |
ExceptionMember& operator=(const ExceptionMember& copy) throw() { |
70 | 70 |
if (ptr.get() == 0) return; |
71 | 71 |
try { |
72 | 72 |
if (!copy.valid()) return; |
73 |
|
|
73 |
*ptr = copy.get(); |
|
74 | 74 |
} catch (...) {} |
75 | 75 |
} |
76 | 76 |
|
77 | 77 |
void set(const Type& type) throw() { |
78 | 78 |
if (ptr.get() == 0) return; |
79 | 79 |
try { |
80 | 80 |
*ptr = type; |
81 | 81 |
} catch (...) {} |
82 | 82 |
} |
83 | 83 |
|
84 | 84 |
const Type& get() const { |
85 | 85 |
return *ptr; |
86 | 86 |
} |
87 | 87 |
|
88 | 88 |
bool valid() const throw() { |
89 | 89 |
return ptr.get() != 0; |
90 | 90 |
} |
91 | 91 |
|
92 | 92 |
private: |
93 | 93 |
std::auto_ptr<_Type> ptr; |
94 | 94 |
}; |
95 | 95 |
|
96 | 96 |
/// Exception-safe convenient error message builder class. |
97 | 97 |
|
98 | 98 |
/// Helper class which provides a convenient ostream-like (operator << |
99 | 99 |
/// based) interface to create a string message. Mostly useful in |
100 | 100 |
/// exception classes (therefore the name). |
101 | 101 |
class ErrorMessage { |
102 | 102 |
protected: |
103 | 103 |
///\e |
104 | 104 |
|
105 | 105 |
///\todo The good solution is boost::shared_ptr... |
106 | 106 |
/// |
107 | 107 |
mutable std::auto_ptr<std::ostringstream> buf; |
108 | 108 |
|
109 | 109 |
///\e |
110 | 110 |
bool init() throw() { |
111 | 111 |
try { |
112 | 112 |
buf.reset(new std::ostringstream); |
113 | 113 |
} |
114 | 114 |
catch(...) { |
115 | 115 |
buf.reset(); |
116 | 116 |
} |
117 | 117 |
return buf.get(); |
118 | 118 |
} |
119 | 119 |
|
120 | 120 |
public: |
121 | 121 |
|
122 | 122 |
///\e |
123 | 123 |
ErrorMessage() throw() { init(); } |
124 | 124 |
|
125 | 125 |
ErrorMessage(const ErrorMessage& em) throw() : buf(em.buf) { } |
126 | 126 |
|
127 | 127 |
///\e |
128 | 128 |
ErrorMessage(const char *msg) throw() { |
129 | 129 |
init(); |
130 | 130 |
*this << msg; |
131 | 131 |
} |
132 | 132 |
|
133 | 133 |
///\e |
134 | 134 |
ErrorMessage(const std::string &msg) throw() { |
135 | 135 |
init(); |
136 | 136 |
*this << msg; |
137 | 137 |
} |
138 | 138 |
|
139 | 139 |
///\e |
140 | 140 |
template <typename T> |
141 | 141 |
ErrorMessage& operator<<(const T &t) throw() { |
142 | 142 |
if( ! buf.get() ) return *this; |
143 | 143 |
|
144 | 144 |
try { |
145 | 145 |
*buf << t; |
146 | 146 |
} |
147 | 147 |
catch(...) { |
148 | 148 |
buf.reset(); |
149 | 149 |
} |
150 | 150 |
return *this; |
151 | 151 |
} |
152 | 152 |
|
153 | 153 |
///\e |
154 | 154 |
const char* message() throw() { |
155 | 155 |
if( ! buf.get() ) return 0; |
156 | 156 |
|
157 | 157 |
const char* mes = 0; |
158 | 158 |
try { |
159 | 159 |
mes = buf->str().c_str(); |
160 | 160 |
} |
161 | 161 |
catch(...) {} |
162 | 162 |
return mes; |
163 | 163 |
} |
164 | 164 |
|
165 | 165 |
}; |
166 | 166 |
|
167 | 167 |
/// Generic exception class. |
168 | 168 |
|
169 | 169 |
/// Base class for exceptions used in LEMON. |
170 | 170 |
/// |
171 | 171 |
class Exception : public std::exception { |
172 | 172 |
public: |
173 | 173 |
///\e |
174 | 174 |
Exception() {} |
175 | 175 |
///\e |
176 | 176 |
virtual ~Exception() throw() {} |
177 | 177 |
///\e |
178 | 178 |
virtual const char* what() const throw() { |
179 | 179 |
return "lemon::Exception"; |
180 | 180 |
} |
181 | 181 |
}; |
182 | 182 |
|
183 | 183 |
/// One of the two main subclasses of \ref Exception. |
184 | 184 |
|
185 | 185 |
/// Logic errors represent problems in the internal logic of a program; |
186 | 186 |
/// in theory, these are preventable, and even detectable before the |
187 | 187 |
/// program runs (e.g. violations of class invariants). |
188 | 188 |
/// |
189 | 189 |
/// A typical example for this is \ref UninitializedParameter. |
190 | 190 |
class LogicError : public Exception { |
191 | 191 |
public: |
192 | 192 |
virtual const char* what() const throw() { |
193 | 193 |
return "lemon::LogicError"; |
194 | 194 |
} |
195 | 195 |
}; |
196 | 196 |
|
197 | 197 |
/// \ref Exception for uninitialized parameters. |
198 | 198 |
|
199 | 199 |
/// This error represents problems in the initialization |
200 | 200 |
/// of the parameters of the algorithms. |
201 | 201 |
class UninitializedParameter : public LogicError { |
202 | 202 |
public: |
203 | 203 |
virtual const char* what() const throw() { |
204 | 204 |
return "lemon::UninitializedParameter"; |
205 | 205 |
} |
206 | 206 |
}; |
207 | 207 |
|
208 | 208 |
|
209 | 209 |
/// One of the two main subclasses of \ref Exception. |
210 | 210 |
|
211 | 211 |
/// Runtime errors represent problems outside the scope of a program; |
212 | 212 |
/// they cannot be easily predicted and can generally only be caught |
213 | 213 |
/// as the program executes. |
214 | 214 |
class RuntimeError : public Exception { |
215 | 215 |
public: |
216 | 216 |
virtual const char* what() const throw() { |
217 | 217 |
return "lemon::RuntimeError"; |
218 | 218 |
} |
219 | 219 |
}; |
220 | 220 |
|
221 | 221 |
///\e |
222 | 222 |
class RangeError : public RuntimeError { |
223 | 223 |
public: |
224 | 224 |
virtual const char* what() const throw() { |
225 | 225 |
return "lemon::RangeError"; |
226 | 226 |
} |
227 | 227 |
}; |
228 | 228 |
|
229 | 229 |
///\e |
230 | 230 |
class IoError : public RuntimeError { |
231 | 231 |
public: |
232 | 232 |
virtual const char* what() const throw() { |
233 | 233 |
return "lemon::IoError"; |
234 | 234 |
} |
235 | 235 |
}; |
236 | 236 |
|
237 | 237 |
///\e |
238 | 238 |
class DataFormatError : public IoError { |
239 | 239 |
protected: |
240 | 240 |
ExceptionMember<std::string> _message; |
241 | 241 |
ExceptionMember<std::string> _file; |
242 | 242 |
int _line; |
243 | 243 |
|
244 | 244 |
mutable ExceptionMember<std::string> _message_holder; |
245 | 245 |
public: |
246 | 246 |
|
247 | 247 |
DataFormatError(const DataFormatError &dfe) : |
248 | 248 |
IoError(dfe), _message(dfe._message), _file(dfe._file), |
249 | 249 |
_line(dfe._line) {} |
250 | 250 |
|
251 | 251 |
///\e |
252 | 252 |
explicit DataFormatError(const char *the_message) |
253 | 253 |
: _message(the_message), _line(0) {} |
254 | 254 |
|
255 | 255 |
///\e |
256 | 256 |
DataFormatError(const std::string &file_name, int line_num, |
257 | 257 |
const char *the_message) |
258 | 258 |
: _message(the_message), _line(line_num) { file(file_name); } |
259 | 259 |
|
260 | 260 |
///\e |
261 | 261 |
void line(int ln) { _line = ln; } |
262 | 262 |
///\e |
263 | 263 |
void message(const std::string& msg) { _message.set(msg); } |
264 | 264 |
///\e |
265 | 265 |
void file(const std::string &fl) { _file.set(fl); } |
266 | 266 |
|
267 | 267 |
///\e |
268 | 268 |
int line() const { return _line; } |
269 | 269 |
///\e |
270 | 270 |
const char* message() const { |
271 | 271 |
if (_message.valid() && !_message.get().empty()) { |
272 | 272 |
return _message.get().c_str(); |
273 | 273 |
} else { |
274 | 274 |
return 0; |
275 | 275 |
} |
276 | 276 |
} |
277 | 277 |
|
278 | 278 |
/// \brief Returns the filename. |
279 | 279 |
/// |
280 | 280 |
/// Returns \e null if the filename was not specified. |
281 | 281 |
const char* file() const { |
282 | 282 |
if (_file.valid() && !_file.get().empty()) { |
283 | 283 |
return _file.get().c_str(); |
284 | 284 |
} else { |
285 | 285 |
return 0; |
286 | 286 |
} |
287 | 287 |
} |
288 | 288 |
|
289 | 289 |
///\e |
290 | 290 |
virtual const char* what() const throw() { |
291 | 291 |
try { |
292 | 292 |
std::ostringstream ostr; |
293 | 293 |
ostr << "lemon:DataFormatError" << ": "; |
294 | 294 |
if (message()) ostr << message(); |
295 | 295 |
if( file() || line() != 0 ) { |
296 | 296 |
ostr << " ("; |
297 | 297 |
if( file() ) ostr << "in file '" << file() << "'"; |
298 | 298 |
if( file() && line() != 0 ) ostr << " "; |
299 | 299 |
if( line() != 0 ) ostr << "at line " << line(); |
300 | 300 |
ostr << ")"; |
301 | 301 |
} |
302 | 302 |
_message_holder.set(ostr.str()); |
303 | 303 |
} |
304 | 304 |
catch (...) {} |
305 | 305 |
if( _message_holder.valid()) return _message_holder.get().c_str(); |
306 | 306 |
return "lemon:DataFormatError"; |
307 | 307 |
} |
308 | 308 |
|
309 | 309 |
virtual ~DataFormatError() throw() {} |
310 | 310 |
}; |
311 | 311 |
|
312 | 312 |
///\e |
313 | 313 |
class FileOpenError : public IoError { |
314 | 314 |
protected: |
315 | 315 |
ExceptionMember<std::string> _file; |
316 | 316 |
|
317 | 317 |
mutable ExceptionMember<std::string> _message_holder; |
318 | 318 |
public: |
319 | 319 |
|
320 | 320 |
FileOpenError(const FileOpenError &foe) : |
321 | 321 |
IoError(foe), _file(foe._file) {} |
322 | 322 |
|
323 | 323 |
///\e |
324 | 324 |
explicit FileOpenError(const std::string& fl) |
325 | 325 |
: _file(fl) {} |
326 | 326 |
|
327 | 327 |
|
328 | 328 |
///\e |
329 | 329 |
void file(const std::string &fl) { _file.set(fl); } |
330 | 330 |
|
331 | 331 |
/// \brief Returns the filename. |
332 | 332 |
/// |
333 | 333 |
/// Returns \e null if the filename was not specified. |
334 | 334 |
const char* file() const { |
335 | 335 |
if (_file.valid() && !_file.get().empty()) { |
336 | 336 |
return _file.get().c_str(); |
337 | 337 |
} else { |
338 | 338 |
return 0; |
339 | 339 |
} |
340 | 340 |
} |
341 | 341 |
|
342 | 342 |
///\e |
343 | 343 |
virtual const char* what() const throw() { |
344 | 344 |
try { |
345 | 345 |
std::ostringstream ostr; |
346 | 346 |
ostr << "lemon::FileOpenError" << ": "; |
347 | 347 |
ostr << "Cannot open file - " << file(); |
348 | 348 |
_message_holder.set(ostr.str()); |
349 | 349 |
} |
350 | 350 |
catch (...) {} |
351 | 351 |
if( _message_holder.valid()) return _message_holder.get().c_str(); |
352 | 352 |
return "lemon::FileOpenError"; |
353 | 353 |
} |
354 | 354 |
virtual ~FileOpenError() throw() {} |
355 | 355 |
}; |
356 | 356 |
|
357 | 357 |
class IoParameterError : public IoError { |
358 | 358 |
protected: |
359 | 359 |
ExceptionMember<std::string> _message; |
360 | 360 |
ExceptionMember<std::string> _file; |
361 | 361 |
|
362 | 362 |
mutable ExceptionMember<std::string> _message_holder; |
363 | 363 |
public: |
364 | 364 |
|
365 | 365 |
IoParameterError(const IoParameterError &ile) : |
366 | 366 |
IoError(ile), _message(ile._message), _file(ile._file) {} |
367 | 367 |
|
368 | 368 |
///\e |
369 | 369 |
explicit IoParameterError(const char *the_message) |
370 | 370 |
: _message(the_message) {} |
371 | 371 |
|
372 | 372 |
///\e |
373 | 373 |
IoParameterError(const char *file_name, const char *the_message) |
374 | 374 |
: _message(the_message), _file(file_name) {} |
375 | 375 |
|
376 | 376 |
///\e |
377 | 377 |
void message(const std::string& msg) { _message.set(msg); } |
378 | 378 |
///\e |
379 | 379 |
void file(const std::string &fl) { _file.set(fl); } |
380 | 380 |
|
381 | 381 |
///\e |
382 | 382 |
const char* message() const { |
383 | 383 |
if (_message.valid()) { |
384 | 384 |
return _message.get().c_str(); |
385 | 385 |
} else { |
386 | 386 |
return 0; |
387 | 387 |
} |
388 | 388 |
} |
389 | 389 |
|
390 | 390 |
/// \brief Returns the filename. |
391 | 391 |
/// |
392 | 392 |
/// Returns \c 0 if the filename was not specified. |
393 | 393 |
const char* file() const { |
394 | 394 |
if (_file.valid()) { |
395 | 395 |
return _file.get().c_str(); |
396 | 396 |
} else { |
397 | 397 |
return 0; |
398 | 398 |
} |
399 | 399 |
} |
400 | 400 |
|
401 | 401 |
///\e |
402 | 402 |
virtual const char* what() const throw() { |
403 | 403 |
try { |
404 | 404 |
std::ostringstream ostr; |
405 | 405 |
if (message()) ostr << message(); |
406 | 406 |
if (file()) ostr << "(when reading file '" << file() << "')"; |
407 | 407 |
_message_holder.set(ostr.str()); |
408 | 408 |
} |
409 | 409 |
catch (...) {} |
410 | 410 |
if( _message_holder.valid() ) return _message_holder.get().c_str(); |
411 | 411 |
return "lemon:IoParameterError"; |
412 | 412 |
} |
413 | 413 |
virtual ~IoParameterError() throw() {} |
414 | 414 |
}; |
415 | 415 |
|
416 | 416 |
/// @} |
417 | 417 |
|
418 | 418 |
} |
419 | 419 |
|
420 | 420 |
#endif // LEMON_ERROR_H |
1 | 1 |
/* -*- mode: C++; indent-tabs-mode: nil; -*- |
2 | 2 |
* |
3 | 3 |
* This file is a part of LEMON, a generic C++ optimization library. |
4 | 4 |
* |
5 | 5 |
* Copyright (C) 2003-2008 |
6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
7 | 7 |
* (Egervary Research Group on Combinatorial Optimization, EGRES). |
8 | 8 |
* |
9 | 9 |
* Permission to use, modify and distribute this software is granted |
10 | 10 |
* provided that this copyright notice appears in all copies. For |
11 | 11 |
* precise terms see the accompanying LICENSE file. |
12 | 12 |
* |
13 | 13 |
* This software is provided "AS IS" with no warranty of any kind, |
14 | 14 |
* express or implied, and with no claim as to its suitability for any |
15 | 15 |
* purpose. |
16 | 16 |
* |
17 | 17 |
*/ |
18 | 18 |
|
19 | 19 |
#ifndef LEMON_GRAPH_TO_EPS_H |
20 | 20 |
#define LEMON_GRAPH_TO_EPS_H |
21 | 21 |
|
22 | 22 |
#include<iostream> |
23 | 23 |
#include<fstream> |
24 | 24 |
#include<sstream> |
25 | 25 |
#include<algorithm> |
26 | 26 |
#include<vector> |
27 | 27 |
|
28 | 28 |
#ifndef WIN32 |
29 | 29 |
#include<sys/time.h> |
30 | 30 |
#include<ctime> |
31 | 31 |
#else |
32 | 32 |
#define WIN32_LEAN_AND_MEAN |
33 | 33 |
#define NOMINMAX |
34 | 34 |
#include<windows.h> |
35 | 35 |
#endif |
36 | 36 |
|
37 | 37 |
#include<lemon/math.h> |
38 | 38 |
#include<lemon/bits/invalid.h> |
39 | 39 |
#include<lemon/dim2.h> |
40 | 40 |
#include<lemon/maps.h> |
41 | 41 |
#include<lemon/color.h> |
42 | 42 |
#include<lemon/bits/bezier.h> |
43 | 43 |
|
44 | 44 |
|
45 | 45 |
///\ingroup eps_io |
46 | 46 |
///\file |
47 | 47 |
///\brief A well configurable tool for visualizing graphs |
48 | 48 |
|
49 | 49 |
namespace lemon { |
50 | 50 |
|
51 | 51 |
namespace _graph_to_eps_bits { |
52 | 52 |
template<class MT> |
53 | 53 |
class _NegY { |
54 | 54 |
public: |
55 | 55 |
typedef typename MT::Key Key; |
56 | 56 |
typedef typename MT::Value Value; |
57 | 57 |
const MT ↦ |
58 | 58 |
int yscale; |
59 | 59 |
_NegY(const MT &m,bool b) : map(m), yscale(1-b*2) {} |
60 | 60 |
Value operator[](Key n) { return Value(map[n].x,map[n].y*yscale);} |
61 | 61 |
}; |
62 | 62 |
} |
63 | 63 |
|
64 | 64 |
///Default traits class of \ref GraphToEps |
65 | 65 |
|
66 | 66 |
///Default traits class of \ref GraphToEps. |
67 | 67 |
/// |
68 | 68 |
///\c G is the type of the underlying graph. |
69 | 69 |
template<class G> |
70 | 70 |
struct DefaultGraphToEpsTraits |
71 | 71 |
{ |
72 | 72 |
typedef G Graph; |
73 | 73 |
typedef typename Graph::Node Node; |
74 | 74 |
typedef typename Graph::NodeIt NodeIt; |
75 | 75 |
typedef typename Graph::Arc Arc; |
76 | 76 |
typedef typename Graph::ArcIt ArcIt; |
77 | 77 |
typedef typename Graph::InArcIt InArcIt; |
78 | 78 |
typedef typename Graph::OutArcIt OutArcIt; |
79 | 79 |
|
80 | 80 |
|
81 | 81 |
const Graph &g; |
82 | 82 |
|
83 | 83 |
std::ostream& os; |
84 | 84 |
|
85 | 85 |
typedef ConstMap<typename Graph::Node,dim2::Point<double> > CoordsMapType; |
86 | 86 |
CoordsMapType _coords; |
87 | 87 |
ConstMap<typename Graph::Node,double > _nodeSizes; |
88 | 88 |
ConstMap<typename Graph::Node,int > _nodeShapes; |
89 | 89 |
|
90 | 90 |
ConstMap<typename Graph::Node,Color > _nodeColors; |
91 | 91 |
ConstMap<typename Graph::Arc,Color > _arcColors; |
92 | 92 |
|
93 | 93 |
ConstMap<typename Graph::Arc,double > _arcWidths; |
94 | 94 |
|
95 | 95 |
double _arcWidthScale; |
96 | 96 |
|
97 | 97 |
double _nodeScale; |
98 | 98 |
double _xBorder, _yBorder; |
99 | 99 |
double _scale; |
100 | 100 |
double _nodeBorderQuotient; |
101 | 101 |
|
102 | 102 |
bool _drawArrows; |
103 | 103 |
double _arrowLength, _arrowWidth; |
104 | 104 |
|
105 | 105 |
bool _showNodes, _showArcs; |
106 | 106 |
|
107 | 107 |
bool _enableParallel; |
108 | 108 |
double _parArcDist; |
109 | 109 |
|
110 | 110 |
bool _showNodeText; |
111 | 111 |
ConstMap<typename Graph::Node,bool > _nodeTexts; |
112 | 112 |
double _nodeTextSize; |
113 | 113 |
|
114 | 114 |
bool _showNodePsText; |
115 | 115 |
ConstMap<typename Graph::Node,bool > _nodePsTexts; |
116 | 116 |
char *_nodePsTextsPreamble; |
117 | 117 |
|
118 | 118 |
bool _undirected; |
119 | 119 |
|
120 | 120 |
bool _pleaseRemoveOsStream; |
121 | 121 |
|
122 | 122 |
bool _scaleToA4; |
123 | 123 |
|
124 | 124 |
std::string _title; |
125 | 125 |
std::string _copyright; |
126 | 126 |
|
127 | 127 |
enum NodeTextColorType |
128 | 128 |
{ DIST_COL=0, DIST_BW=1, CUST_COL=2, SAME_COL=3 } _nodeTextColorType; |
129 | 129 |
ConstMap<typename Graph::Node,Color > _nodeTextColors; |
130 | 130 |
|
131 | 131 |
bool _autoNodeScale; |
132 | 132 |
bool _autoArcWidthScale; |
133 | 133 |
|
134 | 134 |
bool _absoluteNodeSizes; |
135 | 135 |
bool _absoluteArcWidths; |
136 | 136 |
|
137 | 137 |
bool _negY; |
138 | 138 |
|
139 | 139 |
bool _preScale; |
140 | 140 |
///Constructor |
141 | 141 |
|
142 | 142 |
///Constructor |
143 | 143 |
///\param _g Reference to the graph to be printed. |
144 | 144 |
///\param _os Reference to the output stream. |
145 | 145 |
///\param _os Reference to the output stream. |
146 | 146 |
///By default it is <tt>std::cout</tt>. |
147 | 147 |
///\param _pros If it is \c true, then the \c ostream referenced by \c _os |
148 | 148 |
///will be explicitly deallocated by the destructor. |
149 | 149 |
DefaultGraphToEpsTraits(const G &_g,std::ostream& _os=std::cout, |
150 | 150 |
bool _pros=false) : |
151 | 151 |
g(_g), os(_os), |
152 | 152 |
_coords(dim2::Point<double>(1,1)), _nodeSizes(1), _nodeShapes(0), |
153 | 153 |
_nodeColors(WHITE), _arcColors(BLACK), |
154 | 154 |
_arcWidths(1.0), _arcWidthScale(0.003), |
155 | 155 |
_nodeScale(.01), _xBorder(10), _yBorder(10), _scale(1.0), |
156 | 156 |
_nodeBorderQuotient(.1), |
157 | 157 |
_drawArrows(false), _arrowLength(1), _arrowWidth(0.3), |
158 | 158 |
_showNodes(true), _showArcs(true), |
159 | 159 |
_enableParallel(false), _parArcDist(1), |
160 | 160 |
_showNodeText(false), _nodeTexts(false), _nodeTextSize(1), |
161 | 161 |
_showNodePsText(false), _nodePsTexts(false), _nodePsTextsPreamble(0), |
162 | 162 |
_undirected(lemon::UndirectedTagIndicator<G>::value), |
163 | 163 |
_pleaseRemoveOsStream(_pros), _scaleToA4(false), |
164 | 164 |
_nodeTextColorType(SAME_COL), _nodeTextColors(BLACK), |
165 | 165 |
_autoNodeScale(false), |
166 | 166 |
_autoArcWidthScale(false), |
167 | 167 |
_absoluteNodeSizes(false), |
168 | 168 |
_absoluteArcWidths(false), |
169 | 169 |
_negY(false), |
170 | 170 |
_preScale(true) |
171 | 171 |
{} |
172 | 172 |
}; |
173 | 173 |
|
174 | 174 |
///Auxiliary class to implement the named parameters of \ref graphToEps() |
175 | 175 |
|
176 | 176 |
///Auxiliary class to implement the named parameters of \ref graphToEps(). |
177 | 177 |
/// |
178 | 178 |
///For detailed examples see the \ref graph_to_eps_demo.cc demo file. |
179 | 179 |
template<class T> class GraphToEps : public T |
180 | 180 |
{ |
181 | 181 |
// Can't believe it is required by the C++ standard |
182 | 182 |
using T::g; |
183 | 183 |
using T::os; |
184 | 184 |
|
185 | 185 |
using T::_coords; |
186 | 186 |
using T::_nodeSizes; |
187 | 187 |
using T::_nodeShapes; |
188 | 188 |
using T::_nodeColors; |
189 | 189 |
using T::_arcColors; |
190 | 190 |
using T::_arcWidths; |
191 | 191 |
|
192 | 192 |
using T::_arcWidthScale; |
193 | 193 |
using T::_nodeScale; |
194 | 194 |
using T::_xBorder; |
195 | 195 |
using T::_yBorder; |
196 | 196 |
using T::_scale; |
197 | 197 |
using T::_nodeBorderQuotient; |
198 | 198 |
|
199 | 199 |
using T::_drawArrows; |
200 | 200 |
using T::_arrowLength; |
201 | 201 |
using T::_arrowWidth; |
202 | 202 |
|
203 | 203 |
using T::_showNodes; |
204 | 204 |
using T::_showArcs; |
205 | 205 |
|
206 | 206 |
using T::_enableParallel; |
207 | 207 |
using T::_parArcDist; |
208 | 208 |
|
209 | 209 |
using T::_showNodeText; |
210 | 210 |
using T::_nodeTexts; |
211 | 211 |
using T::_nodeTextSize; |
212 | 212 |
|
213 | 213 |
using T::_showNodePsText; |
214 | 214 |
using T::_nodePsTexts; |
215 | 215 |
using T::_nodePsTextsPreamble; |
216 | 216 |
|
217 | 217 |
using T::_undirected; |
218 | 218 |
|
219 | 219 |
using T::_pleaseRemoveOsStream; |
220 | 220 |
|
221 | 221 |
using T::_scaleToA4; |
222 | 222 |
|
223 | 223 |
using T::_title; |
224 | 224 |
using T::_copyright; |
225 | 225 |
|
226 | 226 |
using T::NodeTextColorType; |
227 | 227 |
using T::CUST_COL; |
228 | 228 |
using T::DIST_COL; |
229 | 229 |
using T::DIST_BW; |
230 | 230 |
using T::_nodeTextColorType; |
231 | 231 |
using T::_nodeTextColors; |
232 | 232 |
|
233 | 233 |
using T::_autoNodeScale; |
234 | 234 |
using T::_autoArcWidthScale; |
235 | 235 |
|
236 | 236 |
using T::_absoluteNodeSizes; |
237 | 237 |
using T::_absoluteArcWidths; |
238 | 238 |
|
239 | 239 |
|
240 | 240 |
using T::_negY; |
241 | 241 |
using T::_preScale; |
242 | 242 |
|
243 | 243 |
// dradnats ++C eht yb deriuqer si ti eveileb t'naC |
244 | 244 |
|
245 | 245 |
typedef typename T::Graph Graph; |
246 | 246 |
typedef typename Graph::Node Node; |
247 | 247 |
typedef typename Graph::NodeIt NodeIt; |
248 | 248 |
typedef typename Graph::Arc Arc; |
249 | 249 |
typedef typename Graph::ArcIt ArcIt; |
250 | 250 |
typedef typename Graph::InArcIt InArcIt; |
251 | 251 |
typedef typename Graph::OutArcIt OutArcIt; |
252 | 252 |
|
253 | 253 |
static const int INTERPOL_PREC; |
254 | 254 |
static const double A4HEIGHT; |
255 | 255 |
static const double A4WIDTH; |
256 | 256 |
static const double A4BORDER; |
257 | 257 |
|
258 | 258 |
bool dontPrint; |
259 | 259 |
|
260 | 260 |
public: |
261 | 261 |
///Node shapes |
262 | 262 |
|
263 | 263 |
///Node shapes. |
264 | 264 |
/// |
265 | 265 |
enum NodeShapes { |
266 | 266 |
/// = 0 |
267 | 267 |
///\image html nodeshape_0.png |
268 | 268 |
///\image latex nodeshape_0.eps "CIRCLE shape (0)" width=2cm |
269 | 269 |
CIRCLE=0, |
270 | 270 |
/// = 1 |
271 | 271 |
///\image html nodeshape_1.png |
272 | 272 |
///\image latex nodeshape_1.eps "SQUARE shape (1)" width=2cm |
273 | 273 |
/// |
274 | 274 |
SQUARE=1, |
275 | 275 |
/// = 2 |
276 | 276 |
///\image html nodeshape_2.png |
277 | 277 |
///\image latex nodeshape_2.eps "DIAMOND shape (2)" width=2cm |
278 | 278 |
/// |
279 | 279 |
DIAMOND=2, |
280 | 280 |
/// = 3 |
281 | 281 |
///\image html nodeshape_3.png |
282 | 282 |
///\image latex nodeshape_2.eps "MALE shape (4)" width=2cm |
283 | 283 |
/// |
284 | 284 |
MALE=3, |
285 | 285 |
/// = 4 |
286 | 286 |
///\image html nodeshape_4.png |
287 | 287 |
///\image latex nodeshape_2.eps "FEMALE shape (4)" width=2cm |
288 | 288 |
/// |
289 | 289 |
FEMALE=4 |
290 | 290 |
}; |
291 | 291 |
|
292 | 292 |
private: |
293 | 293 |
class arcLess { |
294 | 294 |
const Graph &g; |
295 | 295 |
public: |
296 | 296 |
arcLess(const Graph &_g) : g(_g) {} |
297 | 297 |
bool operator()(Arc a,Arc b) const |
298 | 298 |
{ |
299 | 299 |
Node ai=std::min(g.source(a),g.target(a)); |
300 | 300 |
Node aa=std::max(g.source(a),g.target(a)); |
301 | 301 |
Node bi=std::min(g.source(b),g.target(b)); |
302 | 302 |
Node ba=std::max(g.source(b),g.target(b)); |
303 | 303 |
return ai<bi || |
304 | 304 |
(ai==bi && (aa < ba || |
305 | 305 |
(aa==ba && ai==g.source(a) && bi==g.target(b)))); |
306 | 306 |
} |
307 | 307 |
}; |
308 | 308 |
bool isParallel(Arc e,Arc f) const |
309 | 309 |
{ |
310 | 310 |
return (g.source(e)==g.source(f)&& |
311 | 311 |
g.target(e)==g.target(f)) || |
312 | 312 |
(g.source(e)==g.target(f)&& |
313 | 313 |
g.target(e)==g.source(f)); |
314 | 314 |
} |
315 | 315 |
template<class TT> |
316 | 316 |
static std::string psOut(const dim2::Point<TT> &p) |
317 | 317 |
{ |
318 | 318 |
std::ostringstream os; |
319 | 319 |
os << p.x << ' ' << p.y; |
320 | 320 |
return os.str(); |
321 | 321 |
} |
322 | 322 |
static std::string psOut(const Color &c) |
323 | 323 |
{ |
324 | 324 |
std::ostringstream os; |
325 | 325 |
os << c.red() << ' ' << c.green() << ' ' << c.blue(); |
326 | 326 |
return os.str(); |
327 | 327 |
} |
328 | 328 |
|
329 | 329 |
public: |
330 | 330 |
GraphToEps(const T &t) : T(t), dontPrint(false) {}; |
331 | 331 |
|
332 | 332 |
template<class X> struct CoordsTraits : public T { |
333 | 333 |
typedef X CoordsMapType; |
334 | 334 |
const X &_coords; |
335 | 335 |
CoordsTraits(const T &t,const X &x) : T(t), _coords(x) {} |
336 | 336 |
}; |
337 | 337 |
///Sets the map of the node coordinates |
338 | 338 |
|
339 | 339 |
///Sets the map of the node coordinates. |
340 | 340 |
///\param x must be a node map with \ref dim2::Point "dim2::Point<double>" or |
341 | 341 |
///\ref dim2::Point "dim2::Point<int>" values. |
342 | 342 |
template<class X> GraphToEps<CoordsTraits<X> > coords(const X &x) { |
343 | 343 |
dontPrint=true; |
344 | 344 |
return GraphToEps<CoordsTraits<X> >(CoordsTraits<X>(*this,x)); |
345 | 345 |
} |
346 | 346 |
template<class X> struct NodeSizesTraits : public T { |
347 | 347 |
const X &_nodeSizes; |
348 | 348 |
NodeSizesTraits(const T &t,const X &x) : T(t), _nodeSizes(x) {} |
349 | 349 |
}; |
350 | 350 |
///Sets the map of the node sizes |
351 | 351 |
|
352 | 352 |
///Sets the map of the node sizes. |
353 | 353 |
///\param x must be a node map with \c double (or convertible) values. |
354 | 354 |
template<class X> GraphToEps<NodeSizesTraits<X> > nodeSizes(const X &x) |
355 | 355 |
{ |
356 | 356 |
dontPrint=true; |
357 | 357 |
return GraphToEps<NodeSizesTraits<X> >(NodeSizesTraits<X>(*this,x)); |
358 | 358 |
} |
359 | 359 |
template<class X> struct NodeShapesTraits : public T { |
360 | 360 |
const X &_nodeShapes; |
361 | 361 |
NodeShapesTraits(const T &t,const X &x) : T(t), _nodeShapes(x) {} |
362 | 362 |
}; |
363 | 363 |
///Sets the map of the node shapes |
364 | 364 |
|
365 | 365 |
///Sets the map of the node shapes. |
366 | 366 |
///The available shape values |
367 | 367 |
///can be found in \ref NodeShapes "enum NodeShapes". |
368 | 368 |
///\param x must be a node map with \c int (or convertible) values. |
369 | 369 |
///\sa NodeShapes |
370 | 370 |
template<class X> GraphToEps<NodeShapesTraits<X> > nodeShapes(const X &x) |
371 | 371 |
{ |
372 | 372 |
dontPrint=true; |
373 | 373 |
return GraphToEps<NodeShapesTraits<X> >(NodeShapesTraits<X>(*this,x)); |
374 | 374 |
} |
375 | 375 |
template<class X> struct NodeTextsTraits : public T { |
376 | 376 |
const X &_nodeTexts; |
377 | 377 |
NodeTextsTraits(const T &t,const X &x) : T(t), _nodeTexts(x) {} |
378 | 378 |
}; |
379 | 379 |
///Sets the text printed on the nodes |
380 | 380 |
|
381 | 381 |
///Sets the text printed on the nodes. |
382 | 382 |
///\param x must be a node map with type that can be pushed to a standard |
383 | 383 |
///\c ostream. |
384 | 384 |
template<class X> GraphToEps<NodeTextsTraits<X> > nodeTexts(const X &x) |
385 | 385 |
{ |
386 | 386 |
dontPrint=true; |
387 | 387 |
_showNodeText=true; |
388 | 388 |
return GraphToEps<NodeTextsTraits<X> >(NodeTextsTraits<X>(*this,x)); |
389 | 389 |
} |
390 | 390 |
template<class X> struct NodePsTextsTraits : public T { |
391 | 391 |
const X &_nodePsTexts; |
392 | 392 |
NodePsTextsTraits(const T &t,const X &x) : T(t), _nodePsTexts(x) {} |
393 | 393 |
}; |
394 | 394 |
///Inserts a PostScript block to the nodes |
395 | 395 |
|
396 | 396 |
///With this command it is possible to insert a verbatim PostScript |
397 | 397 |
///block to the nodes. |
398 | 398 |
///The PS current point will be moved to the center of the node before |
399 | 399 |
///the PostScript block inserted. |
400 | 400 |
/// |
401 | 401 |
///Before and after the block a newline character is inserted so you |
402 | 402 |
///don't have to bother with the separators. |
403 | 403 |
/// |
404 | 404 |
///\param x must be a node map with type that can be pushed to a standard |
405 | 405 |
///\c ostream. |
406 | 406 |
/// |
407 | 407 |
///\sa nodePsTextsPreamble() |
408 | 408 |
template<class X> GraphToEps<NodePsTextsTraits<X> > nodePsTexts(const X &x) |
409 | 409 |
{ |
410 | 410 |
dontPrint=true; |
411 | 411 |
_showNodePsText=true; |
412 | 412 |
return GraphToEps<NodePsTextsTraits<X> >(NodePsTextsTraits<X>(*this,x)); |
413 | 413 |
} |
414 | 414 |
template<class X> struct ArcWidthsTraits : public T { |
415 | 415 |
const X &_arcWidths; |
416 | 416 |
ArcWidthsTraits(const T &t,const X &x) : T(t), _arcWidths(x) {} |
417 | 417 |
}; |
418 | 418 |
///Sets the map of the arc widths |
419 | 419 |
|
420 | 420 |
///Sets the map of the arc widths. |
421 | 421 |
///\param x must be an arc map with \c double (or convertible) values. |
422 | 422 |
template<class X> GraphToEps<ArcWidthsTraits<X> > arcWidths(const X &x) |
423 | 423 |
{ |
424 | 424 |
dontPrint=true; |
425 | 425 |
return GraphToEps<ArcWidthsTraits<X> >(ArcWidthsTraits<X>(*this,x)); |
426 | 426 |
} |
427 | 427 |
|
428 | 428 |
template<class X> struct NodeColorsTraits : public T { |
429 | 429 |
const X &_nodeColors; |
430 | 430 |
NodeColorsTraits(const T &t,const X &x) : T(t), _nodeColors(x) {} |
431 | 431 |
}; |
432 | 432 |
///Sets the map of the node colors |
433 | 433 |
|
434 | 434 |
///Sets the map of the node colors. |
435 | 435 |
///\param x must be a node map with \ref Color values. |
436 | 436 |
/// |
437 | 437 |
///\sa Palette |
438 | 438 |
template<class X> GraphToEps<NodeColorsTraits<X> > |
439 | 439 |
nodeColors(const X &x) |
440 | 440 |
{ |
441 | 441 |
dontPrint=true; |
442 | 442 |
return GraphToEps<NodeColorsTraits<X> >(NodeColorsTraits<X>(*this,x)); |
443 | 443 |
} |
444 | 444 |
template<class X> struct NodeTextColorsTraits : public T { |
445 | 445 |
const X &_nodeTextColors; |
446 | 446 |
NodeTextColorsTraits(const T &t,const X &x) : T(t), _nodeTextColors(x) {} |
447 | 447 |
}; |
448 | 448 |
///Sets the map of the node text colors |
449 | 449 |
|
450 | 450 |
///Sets the map of the node text colors. |
451 | 451 |
///\param x must be a node map with \ref Color values. |
452 | 452 |
/// |
453 | 453 |
///\sa Palette |
454 | 454 |
template<class X> GraphToEps<NodeTextColorsTraits<X> > |
455 | 455 |
nodeTextColors(const X &x) |
456 | 456 |
{ |
457 | 457 |
dontPrint=true; |
458 | 458 |
_nodeTextColorType=CUST_COL; |
459 | 459 |
return GraphToEps<NodeTextColorsTraits<X> > |
460 | 460 |
(NodeTextColorsTraits<X>(*this,x)); |
461 | 461 |
} |
462 | 462 |
template<class X> struct ArcColorsTraits : public T { |
463 | 463 |
const X &_arcColors; |
464 | 464 |
ArcColorsTraits(const T &t,const X &x) : T(t), _arcColors(x) {} |
465 | 465 |
}; |
466 | 466 |
///Sets the map of the arc colors |
467 | 467 |
|
468 | 468 |
///Sets the map of the arc colors. |
469 | 469 |
///\param x must be an arc map with \ref Color values. |
470 | 470 |
/// |
471 | 471 |
///\sa Palette |
472 | 472 |
template<class X> GraphToEps<ArcColorsTraits<X> > |
473 | 473 |
arcColors(const X &x) |
474 | 474 |
{ |
475 | 475 |
dontPrint=true; |
476 | 476 |
return GraphToEps<ArcColorsTraits<X> >(ArcColorsTraits<X>(*this,x)); |
477 | 477 |
} |
478 | 478 |
///Sets a global scale factor for node sizes |
479 | 479 |
|
480 | 480 |
///Sets a global scale factor for node sizes. |
481 | 481 |
/// |
482 | 482 |
/// If nodeSizes() is not given, this function simply sets the node |
483 | 483 |
/// sizes to \c d. If nodeSizes() is given, but |
484 | 484 |
/// autoNodeScale() is not, then the node size given by |
485 | 485 |
/// nodeSizes() will be multiplied by the value \c d. |
486 | 486 |
/// If both nodeSizes() and autoNodeScale() are used, then the |
487 | 487 |
/// node sizes will be scaled in such a way that the greatest size will be |
488 | 488 |
/// equal to \c d. |
489 | 489 |
/// \sa nodeSizes() |
490 | 490 |
/// \sa autoNodeScale() |
491 | 491 |
GraphToEps<T> &nodeScale(double d=.01) {_nodeScale=d;return *this;} |
492 | 492 |
///Turns on/off the automatic node size scaling. |
493 | 493 |
|
494 | 494 |
///Turns on/off the automatic node size scaling. |
495 | 495 |
/// |
496 | 496 |
///\sa nodeScale() |
497 | 497 |
/// |
498 | 498 |
GraphToEps<T> &autoNodeScale(bool b=true) { |
499 | 499 |
_autoNodeScale=b;return *this; |
500 | 500 |
} |
501 | 501 |
|
502 | 502 |
///Turns on/off the absolutematic node size scaling. |
503 | 503 |
|
504 | 504 |
///Turns on/off the absolutematic node size scaling. |
505 | 505 |
/// |
506 | 506 |
///\sa nodeScale() |
507 | 507 |
/// |
508 | 508 |
GraphToEps<T> &absoluteNodeSizes(bool b=true) { |
509 | 509 |
_absoluteNodeSizes=b;return *this; |
510 | 510 |
} |
511 | 511 |
|
512 | 512 |
///Negates the Y coordinates. |
513 | 513 |
GraphToEps<T> &negateY(bool b=true) { |
514 | 514 |
_negY=b;return *this; |
515 | 515 |
} |
516 | 516 |
|
517 | 517 |
///Turn on/off pre-scaling |
518 | 518 |
|
519 | 519 |
///By default graphToEps() rescales the whole image in order to avoid |
520 | 520 |
///very big or very small bounding boxes. |
521 | 521 |
/// |
522 | 522 |
///This (p)rescaling can be turned off with this function. |
523 | 523 |
/// |
524 | 524 |
GraphToEps<T> &preScale(bool b=true) { |
525 | 525 |
_preScale=b;return *this; |
526 | 526 |
} |
527 | 527 |
|
528 | 528 |
///Sets a global scale factor for arc widths |
529 | 529 |
|
530 | 530 |
/// Sets a global scale factor for arc widths. |
531 | 531 |
/// |
532 | 532 |
/// If arcWidths() is not given, this function simply sets the arc |
533 | 533 |
/// widths to \c d. If arcWidths() is given, but |
534 | 534 |
/// autoArcWidthScale() is not, then the arc withs given by |
535 | 535 |
/// arcWidths() will be multiplied by the value \c d. |
536 | 536 |
/// If both arcWidths() and autoArcWidthScale() are used, then the |
537 | 537 |
/// arc withs will be scaled in such a way that the greatest width will be |
538 | 538 |
/// equal to \c d. |
539 | 539 |
GraphToEps<T> &arcWidthScale(double d=.003) {_arcWidthScale=d;return *this;} |
540 | 540 |
///Turns on/off the automatic arc width scaling. |
541 | 541 |
|
542 | 542 |
///Turns on/off the automatic arc width scaling. |
543 | 543 |
/// |
544 | 544 |
///\sa arcWidthScale() |
545 | 545 |
/// |
546 | 546 |
GraphToEps<T> &autoArcWidthScale(bool b=true) { |
547 | 547 |
_autoArcWidthScale=b;return *this; |
548 | 548 |
} |
549 | 549 |
///Turns on/off the absolutematic arc width scaling. |
550 | 550 |
|
551 | 551 |
///Turns on/off the absolutematic arc width scaling. |
552 | 552 |
/// |
553 | 553 |
///\sa arcWidthScale() |
554 | 554 |
/// |
555 | 555 |
GraphToEps<T> &absoluteArcWidths(bool b=true) { |
556 | 556 |
_absoluteArcWidths=b;return *this; |
557 | 557 |
} |
558 | 558 |
///Sets a global scale factor for the whole picture |
559 | 559 |
GraphToEps<T> &scale(double d) {_scale=d;return *this;} |
560 | 560 |
///Sets the width of the border around the picture |
561 | 561 |
GraphToEps<T> &border(double b=10) {_xBorder=_yBorder=b;return *this;} |
562 | 562 |
///Sets the width of the border around the picture |
563 | 563 |
GraphToEps<T> &border(double x, double y) { |
564 | 564 |
_xBorder=x;_yBorder=y;return *this; |
565 | 565 |
} |
566 | 566 |
///Sets whether to draw arrows |
567 | 567 |
GraphToEps<T> &drawArrows(bool b=true) {_drawArrows=b;return *this;} |
568 | 568 |
///Sets the length of the arrowheads |
569 | 569 |
GraphToEps<T> &arrowLength(double d=1.0) {_arrowLength*=d;return *this;} |
570 | 570 |
///Sets the width of the arrowheads |
571 | 571 |
GraphToEps<T> &arrowWidth(double d=.3) {_arrowWidth*=d;return *this;} |
572 | 572 |
|
573 | 573 |
///Scales the drawing to fit to A4 page |
574 | 574 |
GraphToEps<T> &scaleToA4() {_scaleToA4=true;return *this;} |
575 | 575 |
|
576 | 576 |
///Enables parallel arcs |
577 | 577 |
GraphToEps<T> &enableParallel(bool b=true) {_enableParallel=b;return *this;} |
578 | 578 |
|
579 | 579 |
///Sets the distance between parallel arcs |
580 | 580 |
GraphToEps<T> &parArcDist(double d) {_parArcDist*=d;return *this;} |
581 | 581 |
|
582 | 582 |
///Hides the arcs |
583 | 583 |
GraphToEps<T> &hideArcs(bool b=true) {_showArcs=!b;return *this;} |
584 | 584 |
///Hides the nodes |
585 | 585 |
GraphToEps<T> &hideNodes(bool b=true) {_showNodes=!b;return *this;} |
586 | 586 |
|
587 | 587 |
///Sets the size of the node texts |
588 | 588 |
GraphToEps<T> &nodeTextSize(double d) {_nodeTextSize=d;return *this;} |
589 | 589 |
|
590 | 590 |
///Sets the color of the node texts to be different from the node color |
591 | 591 |
|
592 | 592 |
///Sets the color of the node texts to be as different from the node color |
593 | 593 |
///as it is possible. |
594 | 594 |
GraphToEps<T> &distantColorNodeTexts() |
595 | 595 |
{_nodeTextColorType=DIST_COL;return *this;} |
596 | 596 |
///Sets the color of the node texts to be black or white and always visible. |
597 | 597 |
|
598 | 598 |
///Sets the color of the node texts to be black or white according to |
599 | 599 |
///which is more different from the node color. |
600 | 600 |
GraphToEps<T> &distantBWNodeTexts() |
601 | 601 |
{_nodeTextColorType=DIST_BW;return *this;} |
602 | 602 |
|
603 | 603 |
///Gives a preamble block for node Postscript block. |
604 | 604 |
|
605 | 605 |
///Gives a preamble block for node Postscript block. |
606 | 606 |
/// |
607 | 607 |
///\sa nodePsTexts() |
608 | 608 |
GraphToEps<T> & nodePsTextsPreamble(const char *str) { |
609 | 609 |
_nodePsTextsPreamble=str ;return *this; |
610 | 610 |
} |
611 | 611 |
///Sets whether the graph is undirected |
612 | 612 |
|
613 | 613 |
///Sets whether the graph is undirected. |
614 | 614 |
/// |
615 | 615 |
///This setting is the default for undirected graphs. |
616 | 616 |
/// |
617 | 617 |
///\sa directed() |
618 | 618 |
GraphToEps<T> &undirected(bool b=true) {_undirected=b;return *this;} |
619 | 619 |
|
620 | 620 |
///Sets whether the graph is directed |
621 | 621 |
|
622 | 622 |
///Sets whether the graph is directed. |
623 | 623 |
///Use it to show the edges as a pair of directed ones. |
624 | 624 |
/// |
625 | 625 |
///This setting is the default for digraphs. |
626 | 626 |
/// |
627 | 627 |
///\sa undirected() |
628 | 628 |
GraphToEps<T> &directed(bool b=true) {_undirected=!b;return *this;} |
629 | 629 |
|
630 | 630 |
///Sets the title. |
631 | 631 |
|
632 | 632 |
///Sets the title of the generated image, |
633 | 633 |
///namely it inserts a <tt>%%Title:</tt> DSC field to the header of |
634 | 634 |
///the EPS file. |
635 | 635 |
GraphToEps<T> &title(const std::string &t) {_title=t;return *this;} |
636 | 636 |
///Sets the copyright statement. |
637 | 637 |
|
638 | 638 |
///Sets the copyright statement of the generated image, |
639 | 639 |
///namely it inserts a <tt>%%Copyright:</tt> DSC field to the header of |
640 | 640 |
///the EPS file. |
641 | 641 |
GraphToEps<T> ©right(const std::string &t) {_copyright=t;return *this;} |
642 | 642 |
|
643 | 643 |
protected: |
644 | 644 |
bool isInsideNode(dim2::Point<double> p, double r,int t) |
645 | 645 |
{ |
646 | 646 |
switch(t) { |
647 | 647 |
case CIRCLE: |
648 | 648 |
case MALE: |
649 | 649 |
case FEMALE: |
650 | 650 |
return p.normSquare()<=r*r; |
651 | 651 |
case SQUARE: |
652 | 652 |
return p.x<=r&&p.x>=-r&&p.y<=r&&p.y>=-r; |
653 | 653 |
case DIAMOND: |
654 | 654 |
return p.x+p.y<=r && p.x-p.y<=r && -p.x+p.y<=r && -p.x-p.y<=r; |
655 | 655 |
} |
656 | 656 |
return false; |
657 | 657 |
} |
658 | 658 |
|
659 | 659 |
public: |
660 | 660 |
~GraphToEps() { } |
661 | 661 |
|
662 | 662 |
///Draws the graph. |
663 | 663 |
|
664 | 664 |
///Like other functions using |
665 | 665 |
///\ref named-templ-func-param "named template parameters", |
666 | 666 |
///this function calls the algorithm itself, i.e. in this case |
667 | 667 |
///it draws the graph. |
668 | 668 |
void run() { |
669 | 669 |
//\todo better 'epsilon' would be nice here. |
670 | 670 |
const double EPSILON=1e-9; |
671 | 671 |
if(dontPrint) return; |
672 | 672 |
|
673 | 673 |
_graph_to_eps_bits::_NegY<typename T::CoordsMapType> |
674 | 674 |
mycoords(_coords,_negY); |
675 | 675 |
|
676 | 676 |
os << "%!PS-Adobe-2.0 EPSF-2.0\n"; |
677 | 677 |
if(_title.size()>0) os << "%%Title: " << _title << '\n'; |
678 | 678 |
if(_copyright.size()>0) os << "%%Copyright: " << _copyright << '\n'; |
679 | 679 |
os << "%%Creator: LEMON, graphToEps()\n"; |
680 | 680 |
|
681 | 681 |
{ |
682 | 682 |
#ifndef WIN32 |
683 | 683 |
timeval tv; |
684 | 684 |
gettimeofday(&tv, 0); |
685 | 685 |
|
686 | 686 |
char cbuf[26]; |
687 | 687 |
ctime_r(&tv.tv_sec,cbuf); |
688 | 688 |
os << "%%CreationDate: " << cbuf; |
689 | 689 |
#else |
690 | 690 |
SYSTEMTIME time; |
691 | 691 |
char buf1[11], buf2[9], buf3[5]; |
692 | 692 |
|
693 | 693 |
GetSystemTime(&time); |
694 | 694 |
if (GetDateFormat(LOCALE_USER_DEFAULT, 0, &time, |
695 | 695 |
"ddd MMM dd", buf1, 11) && |
696 | 696 |
GetTimeFormat(LOCALE_USER_DEFAULT, 0, &time, |
697 | 697 |
"HH':'mm':'ss", buf2, 9) && |
698 | 698 |
GetDateFormat(LOCALE_USER_DEFAULT, 0, &time, |
699 | 699 |
"yyyy", buf3, 5)) { |
700 | 700 |
os << "%%CreationDate: " << buf1 << ' ' |
701 | 701 |
<< buf2 << ' ' << buf3 << std::endl; |
702 | 702 |
} |
703 | 703 |
#endif |
704 | 704 |
} |
705 | 705 |
|
706 | 706 |
if (_autoArcWidthScale) { |
707 | 707 |
double max_w=0; |
708 | 708 |
for(ArcIt e(g);e!=INVALID;++e) |
709 | 709 |
max_w=std::max(double(_arcWidths[e]),max_w); |
710 | 710 |
//\todo better 'epsilon' would be nice here. |
711 | 711 |
if(max_w>EPSILON) { |
712 | 712 |
_arcWidthScale/=max_w; |
713 | 713 |
} |
714 | 714 |
} |
715 | 715 |
|
716 | 716 |
if (_autoNodeScale) { |
717 | 717 |
double max_s=0; |
718 | 718 |
for(NodeIt n(g);n!=INVALID;++n) |
719 | 719 |
max_s=std::max(double(_nodeSizes[n]),max_s); |
720 | 720 |
//\todo better 'epsilon' would be nice here. |
721 | 721 |
if(max_s>EPSILON) { |
722 | 722 |
_nodeScale/=max_s; |
723 | 723 |
} |
724 | 724 |
} |
725 | 725 |
|
726 | 726 |
double diag_len = 1; |
727 | 727 |
if(!(_absoluteNodeSizes&&_absoluteArcWidths)) { |
728 | 728 |
dim2::BoundingBox<double> bb; |
729 | 729 |
for(NodeIt n(g);n!=INVALID;++n) bb.add(mycoords[n]); |
730 | 730 |
if (bb.empty()) { |
731 | 731 |
bb = dim2::BoundingBox<double>(dim2::Point<double>(0,0)); |
732 | 732 |
} |
733 | 733 |
diag_len = std::sqrt((bb.bottomLeft()-bb.topRight()).normSquare()); |
734 | 734 |
if(diag_len<EPSILON) diag_len = 1; |
735 | 735 |
if(!_absoluteNodeSizes) _nodeScale*=diag_len; |
736 | 736 |
if(!_absoluteArcWidths) _arcWidthScale*=diag_len; |
737 | 737 |
} |
738 | 738 |
|
739 | 739 |
dim2::BoundingBox<double> bb; |
740 | 740 |
for(NodeIt n(g);n!=INVALID;++n) { |
741 | 741 |
double ns=_nodeSizes[n]*_nodeScale; |
742 | 742 |
dim2::Point<double> p(ns,ns); |
743 | 743 |
switch(_nodeShapes[n]) { |
744 | 744 |
case CIRCLE: |
745 | 745 |
case SQUARE: |
746 | 746 |
case DIAMOND: |
747 | 747 |
bb.add(p+mycoords[n]); |
748 | 748 |
bb.add(-p+mycoords[n]); |
749 | 749 |
break; |
750 | 750 |
case MALE: |
751 | 751 |
bb.add(-p+mycoords[n]); |
752 | 752 |
bb.add(dim2::Point<double>(1.5*ns,1.5*std::sqrt(3.0)*ns)+mycoords[n]); |
753 | 753 |
break; |
754 | 754 |
case FEMALE: |
755 | 755 |
bb.add(p+mycoords[n]); |
756 | 756 |
bb.add(dim2::Point<double>(-ns,-3.01*ns)+mycoords[n]); |
757 | 757 |
break; |
758 | 758 |
} |
759 | 759 |
} |
760 | 760 |
if (bb.empty()) { |
761 | 761 |
bb = dim2::BoundingBox<double>(dim2::Point<double>(0,0)); |
762 | 762 |
} |
763 | 763 |
|
764 | 764 |
if(_scaleToA4) |
765 | 765 |
os <<"%%BoundingBox: 0 0 596 842\n%%DocumentPaperSizes: a4\n"; |
766 | 766 |
else { |
767 | 767 |
if(_preScale) { |
768 | 768 |
//Rescale so that BoundingBox won't be neither to big nor too small. |
769 | 769 |
while(bb.height()*_scale>1000||bb.width()*_scale>1000) _scale/=10; |
770 | 770 |
while(bb.height()*_scale<100||bb.width()*_scale<100) _scale*=10; |
771 | 771 |
} |
772 | 772 |
|
773 | 773 |
os << "%%BoundingBox: " |
774 | 774 |
<< int(floor(bb.left() * _scale - _xBorder)) << ' ' |
775 | 775 |
<< int(floor(bb.bottom() * _scale - _yBorder)) << ' ' |
776 | 776 |
<< int(ceil(bb.right() * _scale + _xBorder)) << ' ' |
777 | 777 |
<< int(ceil(bb.top() * _scale + _yBorder)) << '\n'; |
778 | 778 |
} |
779 | 779 |
|
780 | 780 |
os << "%%EndComments\n"; |
781 | 781 |
|
782 | 782 |
//x1 y1 x2 y2 x3 y3 cr cg cb w |
783 | 783 |
os << "/lb { setlinewidth setrgbcolor newpath moveto\n" |
784 | 784 |
<< " 4 2 roll 1 index 1 index curveto stroke } bind def\n"; |
785 | 785 |
os << "/l { setlinewidth setrgbcolor newpath moveto lineto stroke }" |
786 | 786 |
<< " bind def\n"; |
787 | 787 |
//x y r |
788 | 788 |
os << "/c { newpath dup 3 index add 2 index moveto 0 360 arc closepath }" |
789 | 789 |
<< " bind def\n"; |
790 | 790 |
//x y r |
791 | 791 |
os << "/sq { newpath 2 index 1 index add 2 index 2 index add moveto\n" |
792 | 792 |
<< " 2 index 1 index sub 2 index 2 index add lineto\n" |
793 | 793 |
<< " 2 index 1 index sub 2 index 2 index sub lineto\n" |
794 | 794 |
<< " 2 index 1 index add 2 index 2 index sub lineto\n" |
795 | 795 |
<< " closepath pop pop pop} bind def\n"; |
796 | 796 |
//x y r |
797 | 797 |
os << "/di { newpath 2 index 1 index add 2 index moveto\n" |
798 | 798 |
<< " 2 index 2 index 2 index add lineto\n" |
799 | 799 |
<< " 2 index 1 index sub 2 index lineto\n" |
800 | 800 |
<< " 2 index 2 index 2 index sub lineto\n" |
801 | 801 |
<< " closepath pop pop pop} bind def\n"; |
802 | 802 |
// x y r cr cg cb |
803 | 803 |
os << "/nc { 0 0 0 setrgbcolor 5 index 5 index 5 index c fill\n" |
804 | 804 |
<< " setrgbcolor " << 1+_nodeBorderQuotient << " div c fill\n" |
805 | 805 |
<< " } bind def\n"; |
806 | 806 |
os << "/nsq { 0 0 0 setrgbcolor 5 index 5 index 5 index sq fill\n" |
807 | 807 |
<< " setrgbcolor " << 1+_nodeBorderQuotient << " div sq fill\n" |
808 | 808 |
<< " } bind def\n"; |
809 | 809 |
os << "/ndi { 0 0 0 setrgbcolor 5 index 5 index 5 index di fill\n" |
810 | 810 |
<< " setrgbcolor " << 1+_nodeBorderQuotient << " div di fill\n" |
811 | 811 |
<< " } bind def\n"; |
812 | 812 |
os << "/nfemale { 0 0 0 setrgbcolor 3 index " |
813 | 813 |
<< _nodeBorderQuotient/(1+_nodeBorderQuotient) |
814 | 814 |
<< " 1.5 mul mul setlinewidth\n" |
815 | 815 |
<< " newpath 5 index 5 index moveto " |
816 | 816 |
<< "5 index 5 index 5 index 3.01 mul sub\n" |
817 | 817 |
<< " lineto 5 index 4 index .7 mul sub 5 index 5 index 2.2 mul sub" |
818 | 818 |
<< " moveto\n" |
819 | 819 |
<< " 5 index 4 index .7 mul add 5 index 5 index 2.2 mul sub lineto " |
820 | 820 |
<< "stroke\n" |
821 | 821 |
<< " 5 index 5 index 5 index c fill\n" |
822 | 822 |
<< " setrgbcolor " << 1+_nodeBorderQuotient << " div c fill\n" |
823 | 823 |
<< " } bind def\n"; |
824 | 824 |
os << "/nmale {\n" |
825 | 825 |
<< " 0 0 0 setrgbcolor 3 index " |
826 | 826 |
<< _nodeBorderQuotient/(1+_nodeBorderQuotient) |
827 | 827 |
<<" 1.5 mul mul setlinewidth\n" |
828 | 828 |
<< " newpath 5 index 5 index moveto\n" |
829 | 829 |
<< " 5 index 4 index 1 mul 1.5 mul add\n" |
830 | 830 |
<< " 5 index 5 index 3 sqrt 1.5 mul mul add\n" |
831 | 831 |
<< " 1 index 1 index lineto\n" |
832 | 832 |
<< " 1 index 1 index 7 index sub moveto\n" |
833 | 833 |
<< " 1 index 1 index lineto\n" |
834 | 834 |
<< " exch 5 index 3 sqrt .5 mul mul sub exch 5 index .5 mul sub" |
835 | 835 |
<< " lineto\n" |
836 | 836 |
<< " stroke\n" |
837 | 837 |
<< " 5 index 5 index 5 index c fill\n" |
838 | 838 |
<< " setrgbcolor " << 1+_nodeBorderQuotient << " div c fill\n" |
839 | 839 |
<< " } bind def\n"; |
840 | 840 |
|
841 | 841 |
|
842 | 842 |
os << "/arrl " << _arrowLength << " def\n"; |
843 | 843 |
os << "/arrw " << _arrowWidth << " def\n"; |
844 | 844 |
// l dx_norm dy_norm |
845 | 845 |
os << "/lrl { 2 index mul exch 2 index mul exch rlineto pop} bind def\n"; |
846 | 846 |
//len w dx_norm dy_norm x1 y1 cr cg cb |
847 | 847 |
os << "/arr { setrgbcolor /y1 exch def /x1 exch def /dy exch def /dx " |
848 | 848 |
<< "exch def\n" |
849 | 849 |
<< " /w exch def /len exch def\n" |
850 | 850 |
//<< "0.1 setlinewidth x1 y1 moveto dx len mul dy len mul rlineto stroke" |
851 | 851 |
<< " newpath x1 dy w 2 div mul add y1 dx w 2 div mul sub moveto\n" |
852 | 852 |
<< " len w sub arrl sub dx dy lrl\n" |
853 | 853 |
<< " arrw dy dx neg lrl\n" |
854 | 854 |
<< " dx arrl w add mul dy w 2 div arrw add mul sub\n" |
855 | 855 |
<< " dy arrl w add mul dx w 2 div arrw add mul add rlineto\n" |
856 | 856 |
<< " dx arrl w add mul neg dy w 2 div arrw add mul sub\n" |
857 | 857 |
<< " dy arrl w add mul neg dx w 2 div arrw add mul add rlineto\n" |
858 | 858 |
<< " arrw dy dx neg lrl\n" |
859 | 859 |
<< " len w sub arrl sub neg dx dy lrl\n" |
860 | 860 |
<< " closepath fill } bind def\n"; |
861 | 861 |
os << "/cshow { 2 index 2 index moveto dup stringwidth pop\n" |
862 | 862 |
<< " neg 2 div fosi .35 mul neg rmoveto show pop pop} def\n"; |
863 | 863 |
|
864 | 864 |
os << "\ngsave\n"; |
865 | 865 |
if(_scaleToA4) |
866 | 866 |
if(bb.height()>bb.width()) { |
867 | 867 |
double sc= std::min((A4HEIGHT-2*A4BORDER)/bb.height(), |
868 | 868 |
(A4WIDTH-2*A4BORDER)/bb.width()); |
869 | 869 |
os << ((A4WIDTH -2*A4BORDER)-sc*bb.width())/2 + A4BORDER << ' ' |
870 | 870 |
<< ((A4HEIGHT-2*A4BORDER)-sc*bb.height())/2 + A4BORDER |
871 | 871 |
<< " translate\n" |
872 | 872 |
<< sc << " dup scale\n" |
873 | 873 |
<< -bb.left() << ' ' << -bb.bottom() << " translate\n"; |
874 | 874 |
} |
875 | 875 |
else { |
876 | 876 |
//\todo Verify centering |
877 | 877 |
double sc= std::min((A4HEIGHT-2*A4BORDER)/bb.width(), |
878 | 878 |
(A4WIDTH-2*A4BORDER)/bb.height()); |
879 | 879 |
os << ((A4WIDTH -2*A4BORDER)-sc*bb.height())/2 + A4BORDER << ' ' |
880 | 880 |
<< ((A4HEIGHT-2*A4BORDER)-sc*bb.width())/2 + A4BORDER |
881 | 881 |
<< " translate\n" |
882 | 882 |
<< sc << " dup scale\n90 rotate\n" |
883 | 883 |
<< -bb.left() << ' ' << -bb.top() << " translate\n"; |
884 | 884 |
} |
885 | 885 |
else if(_scale!=1.0) os << _scale << " dup scale\n"; |
886 | 886 |
|
887 | 887 |
if(_showArcs) { |
888 | 888 |
os << "%Arcs:\ngsave\n"; |
889 | 889 |
if(_enableParallel) { |
890 | 890 |
std::vector<Arc> el; |
891 | 891 |
for(ArcIt e(g);e!=INVALID;++e) |
892 | 892 |
if((!_undirected||g.source(e)<g.target(e))&&_arcWidths[e]>0 |
893 | 893 |
&&g.source(e)!=g.target(e)) |
894 | 894 |
el.push_back(e); |
895 | 895 |
std::sort(el.begin(),el.end(),arcLess(g)); |
896 | 896 |
|
897 | 897 |
typename std::vector<Arc>::iterator j; |
898 | 898 |
for(typename std::vector<Arc>::iterator i=el.begin();i!=el.end();i=j) { |
899 | 899 |
for(j=i+1;j!=el.end()&&isParallel(*i,*j);++j) ; |
900 | 900 |
|
901 | 901 |
double sw=0; |
902 | 902 |
for(typename std::vector<Arc>::iterator e=i;e!=j;++e) |
903 | 903 |
sw+=_arcWidths[*e]*_arcWidthScale+_parArcDist; |
904 | 904 |
sw-=_parArcDist; |
905 | 905 |
sw/=-2.0; |
906 | 906 |
dim2::Point<double> |
907 | 907 |
dvec(mycoords[g.target(*i)]-mycoords[g.source(*i)]); |
908 | 908 |
double l=std::sqrt(dvec.normSquare()); |
909 | 909 |
//\todo better 'epsilon' would be nice here. |
910 | 910 |
dim2::Point<double> d(dvec/std::max(l,EPSILON)); |
911 |
|
|
911 |
dim2::Point<double> m; |
|
912 | 912 |
// m=dim2::Point<double>(mycoords[g.target(*i)]+ |
913 | 913 |
// mycoords[g.source(*i)])/2.0; |
914 | 914 |
|
915 | 915 |
// m=dim2::Point<double>(mycoords[g.source(*i)])+ |
916 | 916 |
// dvec*(double(_nodeSizes[g.source(*i)])/ |
917 | 917 |
// (_nodeSizes[g.source(*i)]+_nodeSizes[g.target(*i)])); |
918 | 918 |
|
919 |
|
|
919 |
m=dim2::Point<double>(mycoords[g.source(*i)])+ |
|
920 | 920 |
d*(l+_nodeSizes[g.source(*i)]-_nodeSizes[g.target(*i)])/2.0; |
921 | 921 |
|
922 | 922 |
for(typename std::vector<Arc>::iterator e=i;e!=j;++e) { |
923 | 923 |
sw+=_arcWidths[*e]*_arcWidthScale/2.0; |
924 | 924 |
dim2::Point<double> mm=m+rot90(d)*sw/.75; |
925 | 925 |
if(_drawArrows) { |
926 | 926 |
int node_shape; |
927 | 927 |
dim2::Point<double> s=mycoords[g.source(*e)]; |
928 | 928 |
dim2::Point<double> t=mycoords[g.target(*e)]; |
929 | 929 |
double rn=_nodeSizes[g.target(*e)]*_nodeScale; |
930 | 930 |
node_shape=_nodeShapes[g.target(*e)]; |
931 | 931 |
dim2::Bezier3 bez(s,mm,mm,t); |
932 | 932 |
double t1=0,t2=1; |
933 | 933 |
for(int ii=0;ii<INTERPOL_PREC;++ii) |
934 | 934 |
if(isInsideNode(bez((t1+t2)/2)-t,rn,node_shape)) t2=(t1+t2)/2; |
935 | 935 |
else t1=(t1+t2)/2; |
936 | 936 |
dim2::Point<double> apoint=bez((t1+t2)/2); |
937 | 937 |
rn = _arrowLength+_arcWidths[*e]*_arcWidthScale; |
938 | 938 |
rn*=rn; |
939 | 939 |
t2=(t1+t2)/2;t1=0; |
940 | 940 |
for(int ii=0;ii<INTERPOL_PREC;++ii) |
941 | 941 |
if((bez((t1+t2)/2)-apoint).normSquare()>rn) t1=(t1+t2)/2; |
942 | 942 |
else t2=(t1+t2)/2; |
943 | 943 |
dim2::Point<double> linend=bez((t1+t2)/2); |
944 | 944 |
bez=bez.before((t1+t2)/2); |
945 | 945 |
// rn=_nodeSizes[g.source(*e)]*_nodeScale; |
946 | 946 |
// node_shape=_nodeShapes[g.source(*e)]; |
947 | 947 |
// t1=0;t2=1; |
948 | 948 |
// for(int i=0;i<INTERPOL_PREC;++i) |
949 | 949 |
// if(isInsideNode(bez((t1+t2)/2)-t,rn,node_shape)) |
950 | 950 |
// t1=(t1+t2)/2; |
951 | 951 |
// else t2=(t1+t2)/2; |
952 | 952 |
// bez=bez.after((t1+t2)/2); |
953 | 953 |
os << _arcWidths[*e]*_arcWidthScale << " setlinewidth " |
954 | 954 |
<< _arcColors[*e].red() << ' ' |
955 | 955 |
<< _arcColors[*e].green() << ' ' |
956 | 956 |
<< _arcColors[*e].blue() << " setrgbcolor newpath\n" |
957 | 957 |
<< bez.p1.x << ' ' << bez.p1.y << " moveto\n" |
958 | 958 |
<< bez.p2.x << ' ' << bez.p2.y << ' ' |
959 | 959 |
<< bez.p3.x << ' ' << bez.p3.y << ' ' |
960 | 960 |
<< bez.p4.x << ' ' << bez.p4.y << " curveto stroke\n"; |
961 | 961 |
dim2::Point<double> dd(rot90(linend-apoint)); |
962 | 962 |
dd*=(.5*_arcWidths[*e]*_arcWidthScale+_arrowWidth)/ |
963 | 963 |
std::sqrt(dd.normSquare()); |
964 | 964 |
os << "newpath " << psOut(apoint) << " moveto " |
965 | 965 |
<< psOut(linend+dd) << " lineto " |
966 | 966 |
<< psOut(linend-dd) << " lineto closepath fill\n"; |
967 | 967 |
} |
968 | 968 |
else { |
969 | 969 |
os << mycoords[g.source(*e)].x << ' ' |
970 | 970 |
<< mycoords[g.source(*e)].y << ' ' |
971 | 971 |
<< mm.x << ' ' << mm.y << ' ' |
972 | 972 |
<< mycoords[g.target(*e)].x << ' ' |
973 | 973 |
<< mycoords[g.target(*e)].y << ' ' |
974 | 974 |
<< _arcColors[*e].red() << ' ' |
975 | 975 |
<< _arcColors[*e].green() << ' ' |
976 | 976 |
<< _arcColors[*e].blue() << ' ' |
977 | 977 |
<< _arcWidths[*e]*_arcWidthScale << " lb\n"; |
978 | 978 |
} |
979 | 979 |
sw+=_arcWidths[*e]*_arcWidthScale/2.0+_parArcDist; |
980 | 980 |
} |
981 | 981 |
} |
982 | 982 |
} |
983 | 983 |
else for(ArcIt e(g);e!=INVALID;++e) |
984 | 984 |
if((!_undirected||g.source(e)<g.target(e))&&_arcWidths[e]>0 |
985 | 985 |
&&g.source(e)!=g.target(e)) { |
986 | 986 |
if(_drawArrows) { |
987 | 987 |
dim2::Point<double> d(mycoords[g.target(e)]-mycoords[g.source(e)]); |
988 | 988 |
double rn=_nodeSizes[g.target(e)]*_nodeScale; |
989 | 989 |
int node_shape=_nodeShapes[g.target(e)]; |
990 | 990 |
double t1=0,t2=1; |
991 | 991 |
for(int i=0;i<INTERPOL_PREC;++i) |
992 | 992 |
if(isInsideNode((-(t1+t2)/2)*d,rn,node_shape)) t1=(t1+t2)/2; |
993 | 993 |
else t2=(t1+t2)/2; |
994 | 994 |
double l=std::sqrt(d.normSquare()); |
995 | 995 |
d/=l; |
996 | 996 |
|
997 | 997 |
os << l*(1-(t1+t2)/2) << ' ' |
998 | 998 |
<< _arcWidths[e]*_arcWidthScale << ' ' |
999 | 999 |
<< d.x << ' ' << d.y << ' ' |
1000 | 1000 |
<< mycoords[g.source(e)].x << ' ' |
1001 | 1001 |
<< mycoords[g.source(e)].y << ' ' |
1002 | 1002 |
<< _arcColors[e].red() << ' ' |
1003 | 1003 |
<< _arcColors[e].green() << ' ' |
1004 | 1004 |
<< _arcColors[e].blue() << " arr\n"; |
1005 | 1005 |
} |
1006 | 1006 |
else os << mycoords[g.source(e)].x << ' ' |
1007 | 1007 |
<< mycoords[g.source(e)].y << ' ' |
1008 | 1008 |
<< mycoords[g.target(e)].x << ' ' |
1009 | 1009 |
<< mycoords[g.target(e)].y << ' ' |
1010 | 1010 |
<< _arcColors[e].red() << ' ' |
1011 | 1011 |
<< _arcColors[e].green() << ' ' |
1012 | 1012 |
<< _arcColors[e].blue() << ' ' |
1013 | 1013 |
<< _arcWidths[e]*_arcWidthScale << " l\n"; |
1014 | 1014 |
} |
1015 | 1015 |
os << "grestore\n"; |
1016 | 1016 |
} |
1017 | 1017 |
if(_showNodes) { |
1018 | 1018 |
os << "%Nodes:\ngsave\n"; |
1019 | 1019 |
for(NodeIt n(g);n!=INVALID;++n) { |
1020 | 1020 |
os << mycoords[n].x << ' ' << mycoords[n].y << ' ' |
1021 | 1021 |
<< _nodeSizes[n]*_nodeScale << ' ' |
1022 | 1022 |
<< _nodeColors[n].red() << ' ' |
1023 | 1023 |
<< _nodeColors[n].green() << ' ' |
1024 | 1024 |
<< _nodeColors[n].blue() << ' '; |
1025 | 1025 |
switch(_nodeShapes[n]) { |
1026 | 1026 |
case CIRCLE: |
1027 | 1027 |
os<< "nc";break; |
1028 | 1028 |
case SQUARE: |
1029 | 1029 |
os<< "nsq";break; |
1030 | 1030 |
case DIAMOND: |
1031 | 1031 |
os<< "ndi";break; |
1032 | 1032 |
case MALE: |
1033 | 1033 |
os<< "nmale";break; |
1034 | 1034 |
case FEMALE: |
1035 | 1035 |
os<< "nfemale";break; |
1036 | 1036 |
} |
1037 | 1037 |
os<<'\n'; |
1038 | 1038 |
} |
1039 | 1039 |
os << "grestore\n"; |
1040 | 1040 |
} |
1041 | 1041 |
if(_showNodeText) { |
1042 | 1042 |
os << "%Node texts:\ngsave\n"; |
1043 | 1043 |
os << "/fosi " << _nodeTextSize << " def\n"; |
1044 | 1044 |
os << "(Helvetica) findfont fosi scalefont setfont\n"; |
1045 | 1045 |
for(NodeIt n(g);n!=INVALID;++n) { |
1046 | 1046 |
switch(_nodeTextColorType) { |
1047 | 1047 |
case DIST_COL: |
1048 | 1048 |
os << psOut(distantColor(_nodeColors[n])) << " setrgbcolor\n"; |
1049 | 1049 |
break; |
1050 | 1050 |
case DIST_BW: |
1051 | 1051 |
os << psOut(distantBW(_nodeColors[n])) << " setrgbcolor\n"; |
1052 | 1052 |
break; |
1053 | 1053 |
case CUST_COL: |
1054 | 1054 |
os << psOut(distantColor(_nodeTextColors[n])) << " setrgbcolor\n"; |
1055 | 1055 |
break; |
1056 | 1056 |
default: |
1057 | 1057 |
os << "0 0 0 setrgbcolor\n"; |
1058 | 1058 |
} |
1059 | 1059 |
os << mycoords[n].x << ' ' << mycoords[n].y |
1060 | 1060 |
<< " (" << _nodeTexts[n] << ") cshow\n"; |
1061 | 1061 |
} |
1062 | 1062 |
os << "grestore\n"; |
1063 | 1063 |
} |
1064 | 1064 |
if(_showNodePsText) { |
1065 | 1065 |
os << "%Node PS blocks:\ngsave\n"; |
1066 | 1066 |
for(NodeIt n(g);n!=INVALID;++n) |
1067 | 1067 |
os << mycoords[n].x << ' ' << mycoords[n].y |
1068 | 1068 |
<< " moveto\n" << _nodePsTexts[n] << "\n"; |
1069 | 1069 |
os << "grestore\n"; |
1070 | 1070 |
} |
1071 | 1071 |
|
1072 | 1072 |
os << "grestore\nshowpage\n"; |
1073 | 1073 |
|
1074 | 1074 |
//CleanUp: |
1075 | 1075 |
if(_pleaseRemoveOsStream) {delete &os;} |
1076 | 1076 |
} |
1077 | 1077 |
|
1078 | 1078 |
///\name Aliases |
1079 | 1079 |
///These are just some aliases to other parameter setting functions. |
1080 | 1080 |
|
1081 | 1081 |
///@{ |
1082 | 1082 |
|
1083 | 1083 |
///An alias for arcWidths() |
1084 | 1084 |
template<class X> GraphToEps<ArcWidthsTraits<X> > edgeWidths(const X &x) |
1085 | 1085 |
{ |
1086 | 1086 |
return arcWidths(x); |
1087 | 1087 |
} |
1088 | 1088 |
|
1089 | 1089 |
///An alias for arcColors() |
1090 | 1090 |
template<class X> GraphToEps<ArcColorsTraits<X> > |
1091 | 1091 |
edgeColors(const X &x) |
1092 | 1092 |
{ |
1093 | 1093 |
return arcColors(x); |
1094 | 1094 |
} |
1095 | 1095 |
|
1096 | 1096 |
///An alias for arcWidthScale() |
1097 | 1097 |
GraphToEps<T> &edgeWidthScale(double d) {return arcWidthScale(d);} |
1098 | 1098 |
|
1099 | 1099 |
///An alias for autoArcWidthScale() |
1100 | 1100 |
GraphToEps<T> &autoEdgeWidthScale(bool b=true) |
1101 | 1101 |
{ |
1102 | 1102 |
return autoArcWidthScale(b); |
1103 | 1103 |
} |
1104 | 1104 |
|
1105 | 1105 |
///An alias for absoluteArcWidths() |
1106 | 1106 |
GraphToEps<T> &absoluteEdgeWidths(bool b=true) |
1107 | 1107 |
{ |
1108 | 1108 |
return absoluteArcWidths(b); |
1109 | 1109 |
} |
1110 | 1110 |
|
1111 | 1111 |
///An alias for parArcDist() |
1112 | 1112 |
GraphToEps<T> &parEdgeDist(double d) {return parArcDist(d);} |
1113 | 1113 |
|
1114 | 1114 |
///An alias for hideArcs() |
1115 | 1115 |
GraphToEps<T> &hideEdges(bool b=true) {return hideArcs(b);} |
1116 | 1116 |
|
1117 | 1117 |
///@} |
1118 | 1118 |
}; |
1119 | 1119 |
|
1120 | 1120 |
template<class T> |
1121 | 1121 |
const int GraphToEps<T>::INTERPOL_PREC = 20; |
1122 | 1122 |
template<class T> |
1123 | 1123 |
const double GraphToEps<T>::A4HEIGHT = 841.8897637795276; |
1124 | 1124 |
template<class T> |
1125 | 1125 |
const double GraphToEps<T>::A4WIDTH = 595.275590551181; |
1126 | 1126 |
template<class T> |
1127 | 1127 |
const double GraphToEps<T>::A4BORDER = 15; |
1128 | 1128 |
|
1129 | 1129 |
|
1130 | 1130 |
///Generates an EPS file from a graph |
1131 | 1131 |
|
1132 | 1132 |
///\ingroup eps_io |
1133 | 1133 |
///Generates an EPS file from a graph. |
1134 | 1134 |
///\param g Reference to the graph to be printed. |
1135 | 1135 |
///\param os Reference to the output stream. |
1136 | 1136 |
///By default it is <tt>std::cout</tt>. |
1137 | 1137 |
/// |
1138 | 1138 |
///This function also has a lot of |
1139 | 1139 |
///\ref named-templ-func-param "named parameters", |
1140 | 1140 |
///they are declared as the members of class \ref GraphToEps. The following |
1141 | 1141 |
///example shows how to use these parameters. |
1142 | 1142 |
///\code |
1143 | 1143 |
/// graphToEps(g,os).scale(10).coords(coords) |
1144 | 1144 |
/// .nodeScale(2).nodeSizes(sizes) |
1145 | 1145 |
/// .arcWidthScale(.4).run(); |
1146 | 1146 |
///\endcode |
1147 | 1147 |
/// |
1148 | 1148 |
///For more detailed examples see the \ref graph_to_eps_demo.cc demo file. |
1149 | 1149 |
/// |
1150 | 1150 |
///\warning Don't forget to put the \ref GraphToEps::run() "run()" |
1151 | 1151 |
///to the end of the parameter list. |
1152 | 1152 |
///\sa GraphToEps |
1153 | 1153 |
///\sa graphToEps(G &g, const char *file_name) |
1154 | 1154 |
template<class G> |
1155 | 1155 |
GraphToEps<DefaultGraphToEpsTraits<G> > |
1156 | 1156 |
graphToEps(G &g, std::ostream& os=std::cout) |
1157 | 1157 |
{ |
1158 | 1158 |
return |
1159 | 1159 |
GraphToEps<DefaultGraphToEpsTraits<G> >(DefaultGraphToEpsTraits<G>(g,os)); |
1160 | 1160 |
} |
1161 | 1161 |
|
1162 | 1162 |
///Generates an EPS file from a graph |
1163 | 1163 |
|
1164 | 1164 |
///\ingroup eps_io |
1165 | 1165 |
///This function does the same as |
1166 | 1166 |
///\ref graphToEps(G &g,std::ostream& os) |
1167 | 1167 |
///but it writes its output into the file \c file_name |
1168 | 1168 |
///instead of a stream. |
1169 | 1169 |
///\sa graphToEps(G &g, std::ostream& os) |
1170 | 1170 |
template<class G> |
1171 | 1171 |
GraphToEps<DefaultGraphToEpsTraits<G> > |
1172 | 1172 |
graphToEps(G &g,const char *file_name) |
1173 | 1173 |
{ |
1174 | 1174 |
return GraphToEps<DefaultGraphToEpsTraits<G> > |
1175 | 1175 |
(DefaultGraphToEpsTraits<G>(g,*new std::ofstream(file_name),true)); |
1176 | 1176 |
} |
1177 | 1177 |
|
1178 | 1178 |
///Generates an EPS file from a graph |
1179 | 1179 |
|
1180 | 1180 |
///\ingroup eps_io |
1181 | 1181 |
///This function does the same as |
1182 | 1182 |
///\ref graphToEps(G &g,std::ostream& os) |
1183 | 1183 |
///but it writes its output into the file \c file_name |
1184 | 1184 |
///instead of a stream. |
1185 | 1185 |
///\sa graphToEps(G &g, std::ostream& os) |
1186 | 1186 |
template<class G> |
1187 | 1187 |
GraphToEps<DefaultGraphToEpsTraits<G> > |
1188 | 1188 |
graphToEps(G &g,const std::string& file_name) |
1189 | 1189 |
{ |
1190 | 1190 |
return GraphToEps<DefaultGraphToEpsTraits<G> > |
1191 | 1191 |
(DefaultGraphToEpsTraits<G>(g,*new std::ofstream(file_name.c_str()),true)); |
1192 | 1192 |
} |
1193 | 1193 |
|
1194 | 1194 |
} //END OF NAMESPACE LEMON |
1195 | 1195 |
|
1196 | 1196 |
#endif // LEMON_GRAPH_TO_EPS_H |
1 | 1 |
/* -*- mode: C++; indent-tabs-mode: nil; -*- |
2 | 2 |
* |
3 | 3 |
* This file is a part of LEMON, a generic C++ optimization library. |
4 | 4 |
* |
5 | 5 |
* Copyright (C) 2003-2008 |
6 | 6 |
* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
7 | 7 |
* (Egervary Research Group on Combinatorial Optimization, EGRES). |
8 | 8 |
* |
9 | 9 |
* Permission to use, modify and distribute this software is granted |
10 | 10 |
* provided that this copyright notice appears in all copies. For |
11 | 11 |
* precise terms see the accompanying LICENSE file. |
12 | 12 |
* |
13 | 13 |
* This software is provided "AS IS" with no warranty of any kind, |
14 | 14 |
* express or implied, and with no claim as to its suitability for any |
15 | 15 |
* purpose. |
16 | 16 |
* |
17 | 17 |
*/ |
18 | 18 |
|
19 | 19 |
#ifndef LEMON_GRAPH_UTILS_H |
20 | 20 |
#define LEMON_GRAPH_UTILS_H |
21 | 21 |
|
22 | 22 |
#include <iterator> |
23 | 23 |
#include <vector> |
24 | 24 |
#include <map> |
25 | 25 |
#include <cmath> |
26 | 26 |
#include <algorithm> |
27 | 27 |
|
28 | 28 |
#include <lemon/bits/invalid.h> |
29 | 29 |
#include <lemon/bits/utility.h> |
30 | 30 |
#include <lemon/maps.h> |
31 | 31 |
#include <lemon/bits/traits.h> |
32 | 32 |
|
33 | 33 |
#include <lemon/bits/alteration_notifier.h> |
34 | 34 |
#include <lemon/bits/default_map.h> |
35 | 35 |
|
36 | 36 |
///\ingroup gutils |
37 | 37 |
///\file |
38 | 38 |
///\brief Graph utilities. |
39 | 39 |
|
40 | 40 |
namespace lemon { |
41 | 41 |
|
42 | 42 |
/// \addtogroup gutils |
43 | 43 |
/// @{ |
44 | 44 |
|
45 | 45 |
///Creates convenience typedefs for the digraph types and iterators |
46 | 46 |
|
47 | 47 |
///This \c \#define creates convenience typedefs for the following types |
48 | 48 |
///of \c Digraph: \c Node, \c NodeIt, \c Arc, \c ArcIt, \c InArcIt, |
49 | 49 |
///\c OutArcIt, \c BoolNodeMap, \c IntNodeMap, \c DoubleNodeMap, |
50 | 50 |
///\c BoolArcMap, \c IntArcMap, \c DoubleArcMap. |
51 | 51 |
/// |
52 | 52 |
///\note If the graph type is a dependent type, ie. the graph type depend |
53 | 53 |
///on a template parameter, then use \c TEMPLATE_DIGRAPH_TYPEDEFS() |
54 | 54 |
///macro. |
55 |
#define DIGRAPH_TYPEDEFS(Digraph) \ |
|
56 |
typedef Digraph::Node Node; \ |
|
57 |
typedef Digraph::NodeIt NodeIt; \ |
|
58 |
typedef Digraph::Arc Arc; \ |
|
59 |
typedef Digraph::ArcIt ArcIt; \ |
|
60 |
typedef Digraph::InArcIt InArcIt; \ |
|
61 |
typedef Digraph::OutArcIt OutArcIt; \ |
|
62 |
typedef Digraph::NodeMap<bool> BoolNodeMap; \ |
|
63 |
typedef Digraph::NodeMap<int> IntNodeMap; \ |
|
64 |
typedef Digraph::NodeMap<double> DoubleNodeMap; \ |
|
65 |
typedef Digraph::ArcMap<bool> BoolArcMap; \ |
|
66 |
typedef Digraph::ArcMap<int> IntArcMap; \ |
|
55 |
#define DIGRAPH_TYPEDEFS(Digraph) \ |
|
56 |
typedef Digraph::Node Node; \ |
|
57 |
typedef Digraph::NodeIt NodeIt; \ |
|
58 |
typedef Digraph::Arc Arc; \ |
|
59 |
typedef Digraph::ArcIt ArcIt; \ |
|
60 |
typedef Digraph::InArcIt InArcIt; \ |
|
61 |
typedef Digraph::OutArcIt OutArcIt; \ |
|
62 |
typedef Digraph::NodeMap<bool> BoolNodeMap; \ |
|
63 |
typedef Digraph::NodeMap<int> IntNodeMap; \ |
|
64 |
typedef Digraph::NodeMap<double> DoubleNodeMap; \ |
|
65 |
typedef Digraph::ArcMap<bool> BoolArcMap; \ |
|
66 |
typedef Digraph::ArcMap<int> IntArcMap; \ |
|
67 | 67 |
typedef Digraph::ArcMap<double> DoubleArcMap |
68 | 68 |
|
69 | 69 |
///Creates convenience typedefs for the digraph types and iterators |
70 | 70 |
|
71 | 71 |
///\see DIGRAPH_TYPEDEFS |
72 | 72 |
/// |
73 | 73 |
///\note Use this macro, if the graph type is a dependent type, |
74 | 74 |
///ie. the graph type depend on a template parameter. |
75 |
#define TEMPLATE_DIGRAPH_TYPEDEFS(Digraph) \ |
|
76 |
typedef typename Digraph::Node Node; \ |
|
77 |
typedef typename Digraph::NodeIt NodeIt; \ |
|
78 |
typedef typename Digraph::Arc Arc; \ |
|
75 |
#define TEMPLATE_DIGRAPH_TYPEDEFS(Digraph) \ |
|
76 |
typedef typename Digraph::Node Node; \ |
|
77 |
typedef typename Digraph::NodeIt NodeIt; \ |
|
78 |
typedef typename Digraph::Arc Arc; \ |
|
79 | 79 |
typedef typename Digraph::ArcIt ArcIt; \ |
80 |
typedef typename Digraph::InArcIt InArcIt; \ |
|
81 |
typedef typename Digraph::OutArcIt OutArcIt; \ |
|
82 |
typedef typename Digraph::template NodeMap<bool> BoolNodeMap; \ |
|
83 |
typedef typename Digraph::template NodeMap<int> IntNodeMap; \ |
|
84 |
typedef typename Digraph::template NodeMap<double> DoubleNodeMap; \ |
|
85 |
typedef typename Digraph::template ArcMap<bool> BoolArcMap; \ |
|
86 |
typedef typename Digraph:: |
|
80 |
typedef typename Digraph::InArcIt InArcIt; \ |
|
81 |
typedef typename Digraph::OutArcIt OutArcIt; \ |
|
82 |
typedef typename Digraph::template NodeMap<bool> BoolNodeMap; \ |
|
83 |
typedef typename Digraph::template NodeMap<int> IntNodeMap; \ |
|
84 |
typedef typename Digraph::template NodeMap<double> DoubleNodeMap; \ |
|
85 |
typedef typename Digraph::template ArcMap<bool> BoolArcMap; \ |
|
86 |
typedef typename Digraph::template ArcMap<int> IntArcMap; \ |
|
87 | 87 |
typedef typename Digraph::template ArcMap<double> DoubleArcMap |
88 | 88 |
|
89 | 89 |
///Creates convenience typedefs for the graph types and iterators |
90 | 90 |
|
91 | 91 |
///This \c \#define creates the same convenience typedefs as defined |
92 | 92 |
///by \ref DIGRAPH_TYPEDEFS(Graph) and six more, namely it creates |
93 | 93 |
///\c Edge, \c EdgeIt, \c IncEdgeIt, \c BoolEdgeMap, \c IntEdgeMap, |
94 | 94 |
///\c DoubleEdgeMap. |
95 | 95 |
/// |
96 | 96 |
///\note If the graph type is a dependent type, ie. the graph type depend |
97 | 97 |
///on a template parameter, then use \c TEMPLATE_DIGRAPH_TYPEDEFS() |
98 | 98 |
///macro. |
99 |
#define GRAPH_TYPEDEFS(Graph) \ |
|
100 |
DIGRAPH_TYPEDEFS(Graph); \ |
|
101 |
typedef Graph::Edge Edge; \ |
|
102 |
typedef Graph::EdgeIt EdgeIt; \ |
|
103 |
typedef Graph::IncEdgeIt IncEdgeIt; \ |
|
104 |
typedef Graph::EdgeMap<bool> BoolEdgeMap; \ |
|
105 |
|
|
99 |
#define GRAPH_TYPEDEFS(Graph) \ |
|
100 |
DIGRAPH_TYPEDEFS(Graph); \ |
|
101 |
typedef Graph::Edge Edge; \ |
|
102 |
typedef Graph::EdgeIt EdgeIt; \ |
|
103 |
typedef Graph::IncEdgeIt IncEdgeIt; \ |
|
104 |
typedef Graph::EdgeMap<bool> BoolEdgeMap; \ |
|
105 |
typedef Graph::EdgeMap<int> IntEdgeMap; \ |
|
106 | 106 |
typedef Graph::EdgeMap<double> DoubleEdgeMap |
107 | 107 |
|
108 | 108 |
///Creates convenience typedefs for the graph types and iterators |
109 | 109 |
|
110 | 110 |
///\see GRAPH_TYPEDEFS |
111 | 111 |
/// |
112 | 112 |
///\note Use this macro, if the graph type is a dependent type, |
113 | 113 |
///ie. the graph type depend on a template parameter. |
114 |
#define TEMPLATE_GRAPH_TYPEDEFS(Graph) \ |
|
115 |
TEMPLATE_DIGRAPH_TYPEDEFS(Graph); \ |
|
116 |
|
|
114 |
#define TEMPLATE_GRAPH_TYPEDEFS(Graph) \ |
|
115 |
TEMPLATE_DIGRAPH_TYPEDEFS(Graph); \ |
|
116 |
typedef typename Graph::Edge Edge; \ |
|
117 | 117 |
typedef typename Graph::EdgeIt EdgeIt; \ |
118 |
typedef typename Graph::IncEdgeIt IncEdgeIt; \ |
|
119 |
typedef typename Graph::template EdgeMap<bool> BoolEdgeMap; \ |
|
120 |
typedef typename Graph:: |
|
118 |
typedef typename Graph::IncEdgeIt IncEdgeIt; \ |
|
119 |
typedef typename Graph::template EdgeMap<bool> BoolEdgeMap; \ |
|
120 |
typedef typename Graph::template EdgeMap<int> IntEdgeMap; \ |
|
121 | 121 |
typedef typename Graph::template EdgeMap<double> DoubleEdgeMap |
122 | 122 |
|
123 | 123 |
/// \brief Function to count the items in the graph. |
124 | 124 |
/// |
125 | 125 |
/// This function counts the items (nodes, arcs etc) in the graph. |
126 | 126 |
/// The complexity of the function is O(n) because |
127 | 127 |
/// it iterates on all of the items. |
128 | 128 |
template <typename Graph, typename Item> |
129 | 129 |
inline int countItems(const Graph& g) { |
130 | 130 |
typedef typename ItemSetTraits<Graph, Item>::ItemIt ItemIt; |
131 | 131 |
int num = 0; |
132 | 132 |
for (ItemIt it(g); it != INVALID; ++it) { |
133 | 133 |
++num; |
134 | 134 |
} |
135 | 135 |
return num; |
136 | 136 |
} |
137 | 137 |
|
138 | 138 |
// Node counting: |
139 | 139 |
|
140 | 140 |
namespace _graph_utils_bits { |
141 | 141 |
|
142 | 142 |
template <typename Graph, typename Enable = void> |
143 | 143 |
struct CountNodesSelector { |
144 | 144 |
static int count(const Graph &g) { |
145 | 145 |
return countItems<Graph, typename Graph::Node>(g); |
146 | 146 |
} |
147 | 147 |
}; |
148 | 148 |
|
149 | 149 |
template <typename Graph> |
150 | 150 |
struct CountNodesSelector< |
151 | 151 |
Graph, typename |
152 | 152 |
enable_if<typename Graph::NodeNumTag, void>::type> |
153 | 153 |
{ |
154 | 154 |
static int count(const Graph &g) { |
155 | 155 |
return g.nodeNum(); |
156 | 156 |
} |
157 | 157 |
}; |
158 | 158 |
} |
159 | 159 |
|
160 | 160 |
/// \brief Function to count the nodes in the graph. |
161 | 161 |
/// |
162 | 162 |
/// This function counts the nodes in the graph. |
163 | 163 |
/// The complexity of the function is O(n) but for some |
164 | 164 |
/// graph structures it is specialized to run in O(1). |
165 | 165 |
/// |
166 | 166 |
/// If the graph contains a \e nodeNum() member function and a |
167 | 167 |
/// \e NodeNumTag tag then this function calls directly the member |
168 | 168 |
/// function to query the cardinality of the node set. |
169 | 169 |
template <typename Graph> |
170 | 170 |
inline int countNodes(const Graph& g) { |
171 | 171 |
return _graph_utils_bits::CountNodesSelector<Graph>::count(g); |
172 | 172 |
} |
173 | 173 |
|
174 | 174 |
// Arc counting: |
175 | 175 |
|
176 | 176 |
namespace _graph_utils_bits { |
177 | 177 |
|
178 | 178 |
template <typename Graph, typename Enable = void> |
179 | 179 |
struct CountArcsSelector { |
180 | 180 |
static int count(const Graph &g) { |
181 | 181 |
return countItems<Graph, typename Graph::Arc>(g); |
182 | 182 |
} |
183 | 183 |
}; |
184 | 184 |
|
185 | 185 |
template <typename Graph> |
186 | 186 |
struct CountArcsSelector< |
187 | 187 |
Graph, |
188 | 188 |
typename enable_if<typename Graph::ArcNumTag, void>::type> |
189 | 189 |
{ |
190 | 190 |
static int count(const Graph &g) { |
191 | 191 |
return g.arcNum(); |
192 | 192 |
} |
193 | 193 |
}; |
194 | 194 |
} |
195 | 195 |
|
196 | 196 |
/// \brief Function to count the arcs in the graph. |
197 | 197 |
/// |
198 | 198 |
/// This function counts the arcs in the graph. |
199 | 199 |
/// The complexity of the function is O(e) but for some |
200 | 200 |
/// graph structures it is specialized to run in O(1). |
201 | 201 |
/// |
202 | 202 |
/// If the graph contains a \e arcNum() member function and a |
203 | 203 |
/// \e EdgeNumTag tag then this function calls directly the member |
204 | 204 |
/// function to query the cardinality of the arc set. |
205 | 205 |
template <typename Graph> |
206 | 206 |
inline int countArcs(const Graph& g) { |
207 | 207 |
return _graph_utils_bits::CountArcsSelector<Graph>::count(g); |
208 | 208 |
} |
209 | 209 |
|
210 | 210 |
// Edge counting: |
211 | 211 |
namespace _graph_utils_bits { |
212 | 212 |
|
213 | 213 |
template <typename Graph, typename Enable = void> |
214 | 214 |
struct CountEdgesSelector { |
215 | 215 |
static int count(const Graph &g) { |
216 | 216 |
return countItems<Graph, typename Graph::Edge>(g); |
217 | 217 |
} |
218 | 218 |
}; |
219 | 219 |
|
220 | 220 |
template <typename Graph> |
221 | 221 |
struct CountEdgesSelector< |
222 | 222 |
Graph, |
223 | 223 |
typename enable_if<typename Graph::EdgeNumTag, void>::type> |
224 | 224 |
{ |
225 | 225 |
static int count(const Graph &g) { |
226 | 226 |
return g.edgeNum(); |
227 | 227 |
} |
228 | 228 |
}; |
229 | 229 |
} |
230 | 230 |
|
231 | 231 |
/// \brief Function to count the edges in the graph. |
232 | 232 |
/// |
233 | 233 |
/// This function counts the edges in the graph. |
234 | 234 |
/// The complexity of the function is O(m) but for some |
235 | 235 |
/// graph structures it is specialized to run in O(1). |
236 | 236 |
/// |
237 | 237 |
/// If the graph contains a \e edgeNum() member function and a |
238 | 238 |
/// \e EdgeNumTag tag then this function calls directly the member |
239 | 239 |
/// function to query the cardinality of the edge set. |
240 | 240 |
template <typename Graph> |
241 | 241 |
inline int countEdges(const Graph& g) { |
242 | 242 |
return _graph_utils_bits::CountEdgesSelector<Graph>::count(g); |
243 | 243 |
|
244 | 244 |
} |
245 | 245 |
|
246 | 246 |
|
247 | 247 |
template <typename Graph, typename DegIt> |
248 | 248 |
inline int countNodeDegree(const Graph& _g, const typename Graph::Node& _n) { |
249 | 249 |
int num = 0; |
250 | 250 |
for (DegIt it(_g, _n); it != INVALID; ++it) { |
251 | 251 |
++num; |
252 | 252 |
} |
253 | 253 |
return num; |
254 | 254 |
} |
255 | 255 |
|
256 | 256 |
/// \brief Function to count the number of the out-arcs from node \c n. |
257 | 257 |
/// |
258 | 258 |
/// This function counts the number of the out-arcs from node \c n |
259 | 259 |
/// in the graph. |
260 | 260 |
template <typename Graph> |
261 | 261 |
inline int countOutArcs(const Graph& _g, const typename Graph::Node& _n) { |
262 | 262 |
return countNodeDegree<Graph, typename Graph::OutArcIt>(_g, _n); |
263 | 263 |
} |
264 | 264 |
|
265 | 265 |
/// \brief Function to count the number of the in-arcs to node \c n. |
266 | 266 |
/// |
267 | 267 |
/// This function counts the number of the in-arcs to node \c n |
268 | 268 |
/// in the graph. |
269 | 269 |
template <typename Graph> |
270 | 270 |
inline int countInArcs(const Graph& _g, const typename Graph::Node& _n) { |
271 | 271 |
return countNodeDegree<Graph, typename Graph::InArcIt>(_g, _n); |
272 | 272 |
} |
273 | 273 |
|
274 | 274 |
/// \brief Function to count the number of the inc-edges to node \c n. |
275 | 275 |
/// |
276 | 276 |
/// This function counts the number of the inc-edges to node \c n |
277 | 277 |
/// in the graph. |
278 | 278 |
template <typename Graph> |
279 | 279 |
inline int countIncEdges(const Graph& _g, const typename Graph::Node& _n) { |
280 | 280 |
return countNodeDegree<Graph, typename Graph::IncEdgeIt>(_g, _n); |
281 | 281 |
} |
282 | 282 |
|
283 | 283 |
namespace _graph_utils_bits { |
284 | 284 |
|
285 | 285 |
template <typename Graph, typename Enable = void> |
286 | 286 |
struct FindArcSelector { |
287 | 287 |
typedef typename Graph::Node Node; |
288 | 288 |
typedef typename Graph::Arc Arc; |
289 | 289 |
static Arc find(const Graph &g, Node u, Node v, Arc e) { |
290 | 290 |
if (e == INVALID) { |
291 | 291 |
g.firstOut(e, u); |
292 | 292 |
} else { |
293 | 293 |
g.nextOut(e); |
294 | 294 |
} |
295 | 295 |
while (e != INVALID && g.target(e) != v) { |
296 | 296 |
g.nextOut(e); |
297 | 297 |
} |
298 | 298 |
return e; |
299 | 299 |
} |
300 | 300 |
}; |
301 | 301 |
|
302 | 302 |
template <typename Graph> |
303 | 303 |
struct FindArcSelector< |
304 | 304 |
Graph, |
305 | 305 |
typename enable_if<typename Graph::FindEdgeTag, void>::type> |
306 | 306 |
{ |
307 | 307 |
typedef typename Graph::Node Node; |
308 | 308 |
typedef typename Graph::Arc Arc; |
309 | 309 |
static Arc find(const Graph &g, Node u, Node v, Arc prev) { |
310 | 310 |
return g.findArc(u, v, prev); |
311 | 311 |
} |
312 | 312 |
}; |
313 | 313 |
} |
314 | 314 |
|
315 | 315 |
/// \brief Finds an arc between two nodes of a graph. |
316 | 316 |
/// |
317 | 317 |
/// Finds an arc from node \c u to node \c v in graph \c g. |
318 | 318 |
/// |
319 | 319 |
/// If \c prev is \ref INVALID (this is the default value), then |
320 | 320 |
/// it finds the first arc from \c u to \c v. Otherwise it looks for |
321 | 321 |
/// the next arc from \c u to \c v after \c prev. |
322 | 322 |
/// \return The found arc or \ref INVALID if there is no such an arc. |
323 | 323 |
/// |
324 | 324 |
/// Thus you can iterate through each arc from \c u to \c v as it follows. |
325 | 325 |
///\code |
326 | 326 |
/// for(Arc e=findArc(g,u,v);e!=INVALID;e=findArc(g,u,v,e)) { |
327 | 327 |
/// ... |
328 | 328 |
/// } |
329 | 329 |
///\endcode |
330 | 330 |
/// |
331 | 331 |
///\sa ArcLookUp |
332 | 332 |
///\sa AllArcLookUp |
333 | 333 |
///\sa DynArcLookUp |
334 | 334 |
///\sa ConArcIt |
335 | 335 |
template <typename Graph> |
336 | 336 |
inline typename Graph::Arc |
337 | 337 |
findArc(const Graph &g, typename Graph::Node u, typename Graph::Node v, |
338 | 338 |
typename Graph::Arc prev = INVALID) { |
339 | 339 |
return _graph_utils_bits::FindArcSelector<Graph>::find(g, u, v, prev); |
340 | 340 |
} |
341 | 341 |
|
342 | 342 |
/// \brief Iterator for iterating on arcs connected the same nodes. |
343 | 343 |
/// |
344 | 344 |
/// Iterator for iterating on arcs connected the same nodes. It is |
345 | 345 |
/// higher level interface for the findArc() function. You can |
346 | 346 |
/// use it the following way: |
347 | 347 |
///\code |
348 | 348 |
/// for (ConArcIt<Graph> it(g, src, trg); it != INVALID; ++it) { |
349 | 349 |
/// ... |
350 | 350 |
/// } |
351 | 351 |
///\endcode |
352 | 352 |
/// |
353 | 353 |
///\sa findArc() |
354 | 354 |
///\sa ArcLookUp |
355 | 355 |
///\sa AllArcLookUp |
356 | 356 |
///\sa DynArcLookUp |
357 | 357 |
template <typename _Graph> |
358 | 358 |
class ConArcIt : public _Graph::Arc { |
359 | 359 |
public: |
360 | 360 |
|
361 | 361 |
typedef _Graph Graph; |
362 | 362 |
typedef typename Graph::Arc Parent; |
363 | 363 |
|
364 | 364 |
typedef typename Graph::Arc Arc; |
365 | 365 |
typedef typename Graph::Node Node; |
366 | 366 |
|
367 | 367 |
/// \brief Constructor. |
368 | 368 |
/// |
369 | 369 |
/// Construct a new ConArcIt iterating on the arcs which |
370 | 370 |
/// connects the \c u and \c v node. |
371 | 371 |
ConArcIt(const Graph& g, Node u, Node v) : _graph(g) { |
372 | 372 |
Parent::operator=(findArc(_graph, u, v)); |
373 | 373 |
} |
374 | 374 |
|
375 | 375 |
/// \brief Constructor. |
376 | 376 |
/// |
377 | 377 |
/// Construct a new ConArcIt which continues the iterating from |
378 | 378 |
/// the \c e arc. |
379 | 379 |
ConArcIt(const Graph& g, Arc a) : Parent(a), _graph(g) {} |
380 | 380 |
|
381 | 381 |
/// \brief Increment operator. |
382 | 382 |
/// |
383 | 383 |
/// It increments the iterator and gives back the next arc. |
384 | 384 |
ConArcIt& operator++() { |
385 | 385 |
Parent::operator=(findArc(_graph, _graph.source(*this), |
386 | 386 |
_graph.target(*this), *this)); |
387 | 387 |
return *this; |
388 | 388 |
} |
389 | 389 |
private: |
390 | 390 |
const Graph& _graph; |
391 | 391 |
}; |
392 | 392 |
|
393 | 393 |
namespace _graph_utils_bits { |
394 | 394 |
|
395 | 395 |
template <typename Graph, typename Enable = void> |
396 | 396 |
struct FindEdgeSelector { |
397 | 397 |
typedef typename Graph::Node Node; |
398 | 398 |
typedef typename Graph::Edge Edge; |
399 | 399 |
static Edge find(const Graph &g, Node u, Node v, Edge e) { |
400 | 400 |
bool b; |
401 | 401 |
if (u != v) { |
402 | 402 |
if (e == INVALID) { |
403 | 403 |
g.firstInc(e, b, u); |
404 | 404 |
} else { |
405 | 405 |
b = g.u(e) == u; |
406 | 406 |
g.nextInc(e, b); |
407 | 407 |
} |
408 | 408 |
while (e != INVALID && (b ? g.v(e) : g.u(e)) != v) { |
409 | 409 |
g.nextInc(e, b); |
410 | 410 |
} |
411 | 411 |
} else { |
412 | 412 |
if (e == INVALID) { |
413 | 413 |
g.firstInc(e, b, u); |
414 | 414 |
} else { |
415 | 415 |
b = true; |
416 | 416 |
g.nextInc(e, b); |
417 | 417 |
} |
418 | 418 |
while (e != INVALID && (!b || g.v(e) != v)) { |
419 | 419 |
g.nextInc(e, b); |
420 | 420 |
} |
421 | 421 |
} |
422 | 422 |
return e; |
423 | 423 |
} |
424 | 424 |
}; |
425 | 425 |
|
426 | 426 |
template <typename Graph> |
427 | 427 |
struct FindEdgeSelector< |
428 | 428 |
Graph, |
429 | 429 |
typename enable_if<typename Graph::FindEdgeTag, void>::type> |
430 | 430 |
{ |
431 | 431 |
typedef typename Graph::Node Node; |
432 | 432 |
typedef typename Graph::Edge Edge; |
433 | 433 |
static Edge find(const Graph &g, Node u, Node v, Edge prev) { |
434 | 434 |
return g.findEdge(u, v, prev); |
435 | 435 |
} |
436 | 436 |
}; |
437 | 437 |
} |
438 | 438 |
|
439 | 439 |
/// \brief Finds an edge between two nodes of a graph. |
440 | 440 |
/// |
441 | 441 |
/// Finds an edge from node \c u to node \c v in graph \c g. |
442 | 442 |
/// If the node \c u and node \c v is equal then each loop edge |
443 | 443 |
/// will be enumerated once. |
444 | 444 |
/// |
445 | 445 |
/// If \c prev is \ref INVALID (this is the default value), then |
446 | 446 |
/// it finds the first arc from \c u to \c v. Otherwise it looks for |
447 | 447 |
/// the next arc from \c u to \c v after \c prev. |
448 | 448 |
/// \return The found arc or \ref INVALID if there is no such an arc. |
449 | 449 |
/// |
450 | 450 |
/// Thus you can iterate through each arc from \c u to \c v as it follows. |
451 | 451 |
///\code |
452 | 452 |
/// for(Edge e = findEdge(g,u,v); e != INVALID; |
453 | 453 |
/// e = findEdge(g,u,v,e)) { |
454 | 454 |
/// ... |
455 | 455 |
/// } |
456 | 456 |
///\endcode |
457 | 457 |
/// |
458 | 458 |
///\sa ConEdgeIt |
459 | 459 |
|
460 | 460 |
template <typename Graph> |
461 | 461 |
inline typename Graph::Edge |
462 | 462 |
findEdge(const Graph &g, typename Graph::Node u, typename Graph::Node v, |
463 | 463 |
typename Graph::Edge p = INVALID) { |
464 | 464 |
return _graph_utils_bits::FindEdgeSelector<Graph>::find(g, u, v, p); |
465 | 465 |
} |
466 | 466 |
|
467 | 467 |
/// \brief Iterator for iterating on edges connected the same nodes. |
468 | 468 |
/// |
469 | 469 |
/// Iterator for iterating on edges connected the same nodes. It is |
470 | 470 |
/// higher level interface for the findEdge() function. You can |
471 | 471 |
/// use it the following way: |
472 | 472 |
///\code |
473 | 473 |
/// for (ConEdgeIt<Graph> it(g, src, trg); it != INVALID; ++it) { |
474 | 474 |
/// ... |
475 | 475 |
/// } |
476 | 476 |
///\endcode |
477 | 477 |
/// |
478 | 478 |
///\sa findEdge() |
479 | 479 |
template <typename _Graph> |
480 | 480 |
class ConEdgeIt : public _Graph::Edge { |
481 | 481 |
public: |
482 | 482 |
|
483 | 483 |
typedef _Graph Graph; |
484 | 484 |
typedef typename Graph::Edge Parent; |
485 | 485 |
|
486 | 486 |
typedef typename Graph::Edge Edge; |
487 | 487 |
typedef typename Graph::Node Node; |
488 | 488 |
|
489 | 489 |
/// \brief Constructor. |
490 | 490 |
/// |
491 | 491 |
/// Construct a new ConEdgeIt iterating on the edges which |
492 | 492 |
/// connects the \c u and \c v node. |
493 | 493 |
ConEdgeIt(const Graph& g, Node u, Node v) : _graph(g) { |
494 | 494 |
Parent::operator=(findEdge(_graph, u, v)); |
495 | 495 |
} |
496 | 496 |
|
497 | 497 |
/// \brief Constructor. |
498 | 498 |
/// |
499 | 499 |
/// Construct a new ConEdgeIt which continues the iterating from |
500 | 500 |
/// the \c e edge. |
501 | 501 |
ConEdgeIt(const Graph& g, Edge e) : Parent(e), _graph(g) {} |
502 | 502 |
|
503 | 503 |
/// \brief Increment operator. |
504 | 504 |
/// |
505 | 505 |
/// It increments the iterator and gives back the next edge. |
506 | 506 |
ConEdgeIt& operator++() { |
507 | 507 |
Parent::operator=(findEdge(_graph, _graph.u(*this), |
508 | 508 |
_graph.v(*this), *this)); |
509 | 509 |
return *this; |
510 | 510 |
} |
511 | 511 |
private: |
512 | 512 |
const Graph& _graph; |
513 | 513 |
}; |
514 | 514 |
|
515 | 515 |
namespace _graph_utils_bits { |
516 | 516 |
|
517 | 517 |
template <typename Digraph, typename Item, typename RefMap> |
518 | 518 |
class MapCopyBase { |
519 | 519 |
public: |
520 | 520 |
virtual void copy(const Digraph& from, const RefMap& refMap) = 0; |
521 | 521 |
|
522 | 522 |
virtual ~MapCopyBase() {} |
523 | 523 |
}; |
524 | 524 |
|
525 | 525 |
template <typename Digraph, typename Item, typename RefMap, |
526 | 526 |
typename ToMap, typename FromMap> |
527 | 527 |
class MapCopy : public MapCopyBase<Digraph, Item, RefMap> { |
528 | 528 |
public: |
529 | 529 |
|
530 | 530 |
MapCopy(ToMap& tmap, const FromMap& map) |
531 | 531 |
: _tmap(tmap), _map(map) {} |
532 | 532 |
|
533 | 533 |
virtual void copy(const Digraph& digraph, const RefMap& refMap) { |
534 | 534 |
typedef typename ItemSetTraits<Digraph, Item>::ItemIt ItemIt; |
535 | 535 |
for (ItemIt it(digraph); it != INVALID; ++it) { |
536 | 536 |
_tmap.set(refMap[it], _map[it]); |
537 | 537 |
} |
538 | 538 |
} |
539 | 539 |
|
540 | 540 |
private: |
541 | 541 |
ToMap& _tmap; |
542 | 542 |
const FromMap& _map; |
543 | 543 |
}; |
544 | 544 |
|
545 | 545 |
template <typename Digraph, typename Item, typename RefMap, typename It> |
546 | 546 |
class ItemCopy : public MapCopyBase<Digraph, Item, RefMap> { |
547 | 547 |
public: |
548 | 548 |
|
549 | 549 |
ItemCopy(It& it, const Item& item) : _it(it), _item(item) {} |
550 | 550 |
|
551 | 551 |
virtual void copy(const Digraph&, const RefMap& refMap) { |
552 | 552 |
_it = refMap[_item]; |
553 | 553 |
} |
554 | 554 |
|
555 | 555 |
private: |
556 | 556 |
It& _it; |
557 | 557 |
Item _item; |
558 | 558 |
}; |
559 | 559 |
|
560 | 560 |
template <typename Digraph, typename Item, typename RefMap, typename Ref> |
561 | 561 |
class RefCopy : public MapCopyBase<Digraph, Item, RefMap> { |
562 | 562 |
public: |
563 | 563 |
|
564 | 564 |
RefCopy(Ref& map) : _map(map) {} |
565 | 565 |
|
566 | 566 |
virtual void copy(const Digraph& digraph, const RefMap& refMap) { |
567 | 567 |
typedef typename ItemSetTraits<Digraph, Item>::ItemIt ItemIt; |
568 | 568 |
for (ItemIt it(digraph); it != INVALID; ++it) { |
569 | 569 |
_map.set(it, refMap[it]); |
570 | 570 |
} |
571 | 571 |
} |
572 | 572 |
|
573 | 573 |
private: |
574 | 574 |
Ref& _map; |
575 | 575 |
}; |
576 | 576 |
|
577 | 577 |
template <typename Digraph, typename Item, typename RefMap, |
578 | 578 |
typename CrossRef> |
579 | 579 |
class CrossRefCopy : public MapCopyBase<Digraph, Item, RefMap> { |
580 | 580 |
public: |
581 | 581 |
|
582 | 582 |
CrossRefCopy(CrossRef& cmap) : _cmap(cmap) {} |
583 | 583 |
|
584 | 584 |
virtual void copy(const Digraph& digraph, const RefMap& refMap) { |
585 | 585 |
typedef typename ItemSetTraits<Digraph, Item>::ItemIt ItemIt; |
586 | 586 |
for (ItemIt it(digraph); it != INVALID; ++it) { |
587 | 587 |
_cmap.set(refMap[it], it); |
588 | 588 |
} |
589 | 589 |
} |
590 | 590 |
|
591 | 591 |
private: |
592 | 592 |
CrossRef& _cmap; |
593 | 593 |
}; |
594 | 594 |
|
595 | 595 |
template <typename Digraph, typename Enable = void> |
596 | 596 |
struct DigraphCopySelector { |
597 | 597 |
template <typename From, typename NodeRefMap, typename ArcRefMap> |
598 | 598 |
static void copy(Digraph &to, const From& from, |
599 | 599 |
NodeRefMap& nodeRefMap, ArcRefMap& arcRefMap) { |
600 | 600 |
for (typename From::NodeIt it(from); it != INVALID; ++it) { |
601 | 601 |
nodeRefMap[it] = to.addNode(); |
602 | 602 |
} |
603 | 603 |
for (typename From::ArcIt it(from); it != INVALID; ++it) { |
604 | 604 |
arcRefMap[it] = to.addArc(nodeRefMap[from.source(it)], |
605 | 605 |
nodeRefMap[from.target(it)]); |
606 | 606 |
} |
607 | 607 |
} |
608 | 608 |
}; |
609 | 609 |
|
610 | 610 |
template <typename Digraph> |
611 | 611 |
struct DigraphCopySelector< |
612 | 612 |
Digraph, |
613 | 613 |
typename enable_if<typename Digraph::BuildTag, void>::type> |
614 | 614 |
{ |
615 | 615 |
template <typename From, typename NodeRefMap, typename ArcRefMap> |
616 | 616 |
static void copy(Digraph &to, const From& from, |
617 | 617 |
NodeRefMap& nodeRefMap, ArcRefMap& arcRefMap) { |
618 | 618 |
to.build(from, nodeRefMap, arcRefMap); |
619 | 619 |
} |
620 | 620 |
}; |
621 | 621 |
|
622 | 622 |
template <typename Graph, typename Enable = void> |
623 | 623 |
struct GraphCopySelector { |
624 | 624 |
template <typename From, typename NodeRefMap, typename EdgeRefMap> |
625 | 625 |
static void copy(Graph &to, const From& from, |
626 | 626 |
NodeRefMap& nodeRefMap, EdgeRefMap& edgeRefMap) { |
627 | 627 |
for (typename From::NodeIt it(from); it != INVALID; ++it) { |
628 | 628 |
nodeRefMap[it] = to.addNode(); |
629 | 629 |
} |
630 | 630 |
for (typename From::EdgeIt it(from); it != INVALID; ++it) { |
631 | 631 |
edgeRefMap[it] = to.addEdge(nodeRefMap[from.u(it)], |
632 | 632 |
nodeRefMap[from.v(it)]); |
633 | 633 |
} |
634 | 634 |
} |
635 | 635 |
}; |
636 | 636 |
|
637 | 637 |
template <typename Graph> |
638 | 638 |
struct GraphCopySelector< |
639 | 639 |
Graph, |
640 | 640 |
typename enable_if<typename Graph::BuildTag, void>::type> |
641 | 641 |
{ |
642 | 642 |
template <typename From, typename NodeRefMap, typename EdgeRefMap> |
643 | 643 |
static void copy(Graph &to, const From& from, |
644 | 644 |
NodeRefMap& nodeRefMap, EdgeRefMap& edgeRefMap) { |
645 | 645 |
to.build(from, nodeRefMap, edgeRefMap); |
646 | 646 |
} |
647 | 647 |
}; |
648 | 648 |
|
649 | 649 |
} |
650 | 650 |
|
651 | 651 |
/// \brief Class to copy a digraph. |
652 | 652 |
/// |
653 | 653 |
/// Class to copy a digraph to another digraph (duplicate a digraph). The |
654 | 654 |
/// simplest way of using it is through the \c copyDigraph() function. |
655 | 655 |
/// |
656 | 656 |
/// This class not just make a copy of a graph, but it can create |
657 | 657 |
/// references and cross references between the nodes and arcs of |
658 | 658 |
/// the two graphs, it can copy maps for use with the newly created |
659 | 659 |
/// graph and copy nodes and arcs. |
660 | 660 |
/// |
661 | 661 |
/// To make a copy from a graph, first an instance of DigraphCopy |
662 | 662 |
/// should be created, then the data belongs to the graph should |
663 | 663 |
/// assigned to copy. In the end, the \c run() member should be |
664 | 664 |
/// called. |
665 | 665 |
/// |
666 | 666 |
/// The next code copies a graph with several data: |
667 | 667 |
///\code |
668 | 668 |
/// DigraphCopy<NewGraph, OrigGraph> dc(new_graph, orig_graph); |
669 | 669 |
/// // create a reference for the nodes |
670 | 670 |
/// OrigGraph::NodeMap<NewGraph::Node> nr(orig_graph); |
671 | 671 |
/// dc.nodeRef(nr); |
672 | 672 |
/// // create a cross reference (inverse) for the arcs |
673 | 673 |
/// NewGraph::ArcMap<OrigGraph::Arc> acr(new_graph); |
674 | 674 |
/// dc.arcCrossRef(acr); |
675 | 675 |
/// // copy an arc map |
676 | 676 |
/// OrigGraph::ArcMap<double> oamap(orig_graph); |
677 | 677 |
/// NewGraph::ArcMap<double> namap(new_graph); |
678 | 678 |
/// dc.arcMap(namap, oamap); |
679 | 679 |
/// // copy a node |
680 | 680 |
/// OrigGraph::Node on; |
681 | 681 |
/// NewGraph::Node nn; |
682 | 682 |
/// dc.node(nn, on); |
683 | 683 |
/// // Executions of copy |
684 | 684 |
/// dc.run(); |
685 | 685 |
///\endcode |
686 | 686 |
template <typename To, typename From> |
687 | 687 |
class DigraphCopy { |
688 | 688 |
private: |
689 | 689 |
|
690 | 690 |
typedef typename From::Node Node; |
691 | 691 |
typedef typename From::NodeIt NodeIt; |
692 | 692 |
typedef typename From::Arc Arc; |
693 | 693 |
typedef typename From::ArcIt ArcIt; |
694 | 694 |
|
695 | 695 |
typedef typename To::Node TNode; |
696 | 696 |
typedef typename To::Arc TArc; |
697 | 697 |
|
698 | 698 |
typedef typename From::template NodeMap<TNode> NodeRefMap; |
699 | 699 |
typedef typename From::template ArcMap<TArc> ArcRefMap; |
700 | 700 |
|
701 | 701 |
|
702 | 702 |
public: |
703 | 703 |
|
704 | 704 |
|
705 | 705 |
/// \brief Constructor for the DigraphCopy. |
706 | 706 |
/// |
707 | 707 |
/// It copies the content of the \c _from digraph into the |
708 | 708 |
/// \c _to digraph. |
709 | 709 |
DigraphCopy(To& to, const From& from) |
710 | 710 |
: _from(from), _to(to) {} |
711 | 711 |
|
712 | 712 |
/// \brief Destructor of the DigraphCopy |
713 | 713 |
/// |
714 | 714 |
/// Destructor of the DigraphCopy |
715 | 715 |
~DigraphCopy() { |
716 | 716 |
for (int i = 0; i < int(_node_maps.size()); ++i) { |
717 | 717 |
delete _node_maps[i]; |
718 | 718 |
} |
719 | 719 |
for (int i = 0; i < int(_arc_maps.size()); ++i) { |
720 | 720 |
delete _arc_maps[i]; |
721 | 721 |
} |
722 | 722 |
|
723 | 723 |
} |
724 | 724 |
|
725 | 725 |
/// \brief Copies the node references into the given map. |
726 | 726 |
/// |
727 | 727 |
/// Copies the node references into the given map. The parameter |
728 | 728 |
/// should be a map, which key type is the Node type of the source |
729 | 729 |
/// graph, while the value type is the Node type of the |
730 | 730 |
/// destination graph. |
731 | 731 |
template <typename NodeRef> |
732 | 732 |
DigraphCopy& nodeRef(NodeRef& map) { |
733 | 733 |
_node_maps.push_back(new _graph_utils_bits::RefCopy<From, Node, |
734 | 734 |
NodeRefMap, NodeRef>(map)); |
735 | 735 |
return *this; |
736 | 736 |
} |
737 | 737 |
|
738 | 738 |
/// \brief Copies the node cross references into the given map. |
739 | 739 |
/// |
740 | 740 |
/// Copies the node cross references (reverse references) into |
741 | 741 |
/// the given map. The parameter should be a map, which key type |
742 | 742 |
/// is the Node type of the destination graph, while the value type is |
743 | 743 |
/// the Node type of the source graph. |
744 | 744 |
template <typename NodeCrossRef> |
745 | 745 |
DigraphCopy& nodeCrossRef(NodeCrossRef& map) { |
746 | 746 |
_node_maps.push_back(new _graph_utils_bits::CrossRefCopy<From, Node, |
747 | 747 |
NodeRefMap, NodeCrossRef>(map)); |
748 | 748 |
return *this; |
749 | 749 |
} |
750 | 750 |
|
751 | 751 |
/// \brief Make copy of the given map. |
752 | 752 |
/// |
753 | 753 |
/// Makes copy of the given map for the newly created digraph. |
754 | 754 |
/// The new map's key type is the destination graph's node type, |
755 | 755 |
/// and the copied map's key type is the source graph's node type. |
756 | 756 |
template <typename ToMap, typename FromMap> |
757 | 757 |
DigraphCopy& nodeMap(ToMap& tmap, const FromMap& map) { |
758 | 758 |
_node_maps.push_back(new _graph_utils_bits::MapCopy<From, Node, |
759 | 759 |
NodeRefMap, ToMap, FromMap>(tmap, map)); |
760 | 760 |
return *this; |
761 | 761 |
} |
762 | 762 |
|
763 | 763 |
/// \brief Make a copy of the given node. |
764 | 764 |
/// |
765 | 765 |
/// Make a copy of the given node. |
766 | 766 |
DigraphCopy& node(TNode& tnode, const Node& snode) { |
767 | 767 |
_node_maps.push_back(new _graph_utils_bits::ItemCopy<From, Node, |
768 | 768 |
NodeRefMap, TNode>(tnode, snode)); |
769 | 769 |
return *this; |
770 | 770 |
} |
771 | 771 |
|
772 | 772 |
/// \brief Copies the arc references into the given map. |
773 | 773 |
/// |
774 | 774 |
/// Copies the arc references into the given map. |
775 | 775 |
template <typename ArcRef> |
776 | 776 |
DigraphCopy& arcRef(ArcRef& map) { |
777 | 777 |
_arc_maps.push_back(new _graph_utils_bits::RefCopy<From, Arc, |
778 | 778 |
ArcRefMap, ArcRef>(map)); |
779 | 779 |
return *this; |
780 | 780 |
} |
781 | 781 |
|
782 | 782 |
/// \brief Copies the arc cross references into the given map. |
783 | 783 |
/// |
784 | 784 |
/// Copies the arc cross references (reverse references) into |
785 | 785 |
/// the given map. |
786 | 786 |
template <typename ArcCrossRef> |
787 | 787 |
DigraphCopy& arcCrossRef(ArcCrossRef& map) { |
788 | 788 |
_arc_maps.push_back(new _graph_utils_bits::CrossRefCopy<From, Arc, |
789 | 789 |
ArcRefMap, ArcCrossRef>(map)); |
790 | 790 |
return *this; |
791 | 791 |
} |
792 | 792 |
|
793 | 793 |
/// \brief Make copy of the given map. |
794 | 794 |
/// |
795 | 795 |
/// Makes copy of the given map for the newly created digraph. |
796 | 796 |
/// The new map's key type is the to digraph's arc type, |
797 | 797 |
/// and the copied map's key type is the from digraph's arc |
798 | 798 |
/// type. |
799 | 799 |
template <typename ToMap, typename FromMap> |
800 | 800 |
DigraphCopy& arcMap(ToMap& tmap, const FromMap& map) { |
801 | 801 |
_arc_maps.push_back(new _graph_utils_bits::MapCopy<From, Arc, |
802 | 802 |
ArcRefMap, ToMap, FromMap>(tmap, map)); |
803 | 803 |
return *this; |
804 | 804 |
} |
805 | 805 |
|
806 | 806 |
/// \brief Make a copy of the given arc. |
807 | 807 |
/// |
808 | 808 |
/// Make a copy of the given arc. |
809 | 809 |
DigraphCopy& arc(TArc& tarc, const Arc& sarc) { |
810 | 810 |
_arc_maps.push_back(new _graph_utils_bits::ItemCopy<From, Arc, |
811 | 811 |
ArcRefMap, TArc>(tarc, sarc)); |
812 | 812 |
return *this; |
813 | 813 |
} |
814 | 814 |
|
815 | 815 |
/// \brief Executes the copies. |
816 | 816 |
/// |
817 | 817 |
/// Executes the copies. |
818 | 818 |
void run() { |
819 | 819 |
NodeRefMap nodeRefMap(_from); |
820 | 820 |
ArcRefMap arcRefMap(_from); |
821 | 821 |
_graph_utils_bits::DigraphCopySelector<To>:: |
822 | 822 |
copy(_to, _from, nodeRefMap, arcRefMap); |
823 | 823 |
for (int i = 0; i < int(_node_maps.size()); ++i) { |
824 | 824 |
_node_maps[i]->copy(_from, nodeRefMap); |
825 | 825 |
} |
826 | 826 |
for (int i = 0; i < int(_arc_maps.size()); ++i) { |
827 | 827 |
_arc_maps[i]->copy(_from, arcRefMap); |
828 | 828 |
} |
829 | 829 |
} |
830 | 830 |
|
831 | 831 |
protected: |
832 | 832 |
|
833 | 833 |
|
834 | 834 |
const From& _from; |
835 | 835 |
To& _to; |
836 | 836 |
|
837 | 837 |
std::vector<_graph_utils_bits::MapCopyBase<From, Node, NodeRefMap>* > |
838 | 838 |
_node_maps; |
839 | 839 |
|
840 | 840 |
std::vector<_graph_utils_bits::MapCopyBase<From, Arc, ArcRefMap>* > |
841 | 841 |
_arc_maps; |
842 | 842 |
|
843 | 843 |
}; |
844 | 844 |
|
845 | 845 |
/// \brief Copy a digraph to another digraph. |
846 | 846 |
/// |
847 | 847 |
/// Copy a digraph to another digraph. The complete usage of the |
848 | 848 |
/// function is detailed in the DigraphCopy class, but a short |
849 | 849 |
/// example shows a basic work: |
850 | 850 |
///\code |
851 | 851 |
/// copyDigraph(trg, src).nodeRef(nr).arcCrossRef(ecr).run(); |
852 | 852 |
///\endcode |
853 | 853 |
/// |
854 | 854 |
/// After the copy the \c nr map will contain the mapping from the |
855 | 855 |
/// nodes of the \c from digraph to the nodes of the \c to digraph and |
856 | 856 |
/// \c ecr will contain the mapping from the arcs of the \c to digraph |
857 | 857 |
/// to the arcs of the \c from digraph. |
858 | 858 |
/// |
859 | 859 |
/// \see DigraphCopy |
860 | 860 |
template <typename To, typename From> |
861 | 861 |
DigraphCopy<To, From> copyDigraph(To& to, const From& from) { |
862 | 862 |
return DigraphCopy<To, From>(to, from); |
863 | 863 |
} |
864 | 864 |
|
865 | 865 |
/// \brief Class to copy a graph. |
866 | 866 |
/// |
867 | 867 |
/// Class to copy a graph to another graph (duplicate a graph). The |
868 | 868 |
/// simplest way of using it is through the \c copyGraph() function. |
869 | 869 |
/// |
870 | 870 |
/// This class not just make a copy of a graph, but it can create |
871 | 871 |
/// references and cross references between the nodes, edges and arcs of |
872 | 872 |
/// the two graphs, it can copy maps for use with the newly created |
873 | 873 |
/// graph and copy nodes, edges and arcs. |
874 | 874 |
/// |
875 | 875 |
/// To make a copy from a graph, first an instance of GraphCopy |
876 | 876 |
/// should be created, then the data belongs to the graph should |
877 | 877 |
/// assigned to copy. In the end, the \c run() member should be |
878 | 878 |
/// called. |
879 | 879 |
/// |
880 | 880 |
/// The next code copies a graph with several data: |
881 | 881 |
///\code |
882 | 882 |
/// GraphCopy<NewGraph, OrigGraph> dc(new_graph, orig_graph); |
883 | 883 |
/// // create a reference for the nodes |
884 | 884 |
/// OrigGraph::NodeMap<NewGraph::Node> nr(orig_graph); |
885 | 885 |
/// dc.nodeRef(nr); |
886 | 886 |
/// // create a cross reference (inverse) for the edges |
887 | 887 |
/// NewGraph::EdgeMap<OrigGraph::Arc> ecr(new_graph); |
888 | 888 |
/// dc.edgeCrossRef(ecr); |
889 | 889 |
/// // copy an arc map |
890 | 890 |
/// OrigGraph::ArcMap<double> oamap(orig_graph); |
891 | 891 |
/// NewGraph::ArcMap<double> namap(new_graph); |
892 | 892 |
/// dc.arcMap(namap, oamap); |
893 | 893 |
/// // copy a node |
894 | 894 |
/// OrigGraph::Node on; |
895 | 895 |
/// NewGraph::Node nn; |
896 | 896 |
/// dc.node(nn, on); |
897 | 897 |
/// // Executions of copy |
898 | 898 |
/// dc.run(); |
899 | 899 |
///\endcode |
900 | 900 |
template <typename To, typename From> |
901 | 901 |
class GraphCopy { |
902 | 902 |
private: |
903 | 903 |
|
904 | 904 |
typedef typename From::Node Node; |
905 | 905 |
typedef typename From::NodeIt NodeIt; |
906 | 906 |
typedef typename From::Arc Arc; |
907 | 907 |
typedef typename From::ArcIt ArcIt; |
908 | 908 |
typedef typename From::Edge Edge; |
909 | 909 |
typedef typename From::EdgeIt EdgeIt; |
910 | 910 |
|
911 | 911 |
typedef typename To::Node TNode; |
912 | 912 |
typedef typename To::Arc TArc; |
913 | 913 |
typedef typename To::Edge TEdge; |
914 | 914 |
|
915 | 915 |
typedef typename From::template NodeMap<TNode> NodeRefMap; |
916 | 916 |
typedef typename From::template EdgeMap<TEdge> EdgeRefMap; |
917 | 917 |
|
918 | 918 |
struct ArcRefMap { |
919 | 919 |
ArcRefMap(const To& to, const From& from, |
920 | 920 |
const EdgeRefMap& edge_ref, const NodeRefMap& node_ref) |
921 | 921 |
: _to(to), _from(from), |
922 | 922 |
_edge_ref(edge_ref), _node_ref(node_ref) {} |
923 | 923 |
|
924 | 924 |
typedef typename From::Arc Key; |
925 | 925 |
typedef typename To::Arc Value; |
926 | 926 |
|
927 | 927 |
Value operator[](const Key& key) const { |
928 | 928 |
bool forward = _from.u(key) != _from.v(key) ? |
929 | 929 |
_node_ref[_from.source(key)] == |
930 | 930 |
_to.source(_to.direct(_edge_ref[key], true)) : |
931 | 931 |
_from.direction(key); |
932 | 932 |
return _to.direct(_edge_ref[key], forward); |
933 | 933 |
} |
934 | 934 |
|
935 | 935 |
const To& _to; |
936 | 936 |
const From& _from; |
937 | 937 |
const EdgeRefMap& _edge_ref; |
938 | 938 |
const NodeRefMap& _node_ref; |
939 | 939 |
}; |
940 | 940 |
|
941 | 941 |
|
942 | 942 |
public: |
943 | 943 |
|
944 | 944 |
|
945 | 945 |
/// \brief Constructor for the GraphCopy. |
946 | 946 |
/// |
947 | 947 |
/// It copies the content of the \c _from graph into the |
948 | 948 |
/// \c _to graph. |
949 | 949 |
GraphCopy(To& to, const From& from) |
950 | 950 |
: _from(from), _to(to) {} |
951 | 951 |
|
952 | 952 |
/// \brief Destructor of the GraphCopy |
953 | 953 |
/// |
954 | 954 |
/// Destructor of the GraphCopy |
955 | 955 |
~GraphCopy() { |
956 | 956 |
for (int i = 0; i < int(_node_maps.size()); ++i) { |
957 | 957 |
delete _node_maps[i]; |
958 | 958 |
} |
959 | 959 |
for (int i = 0; i < int(_arc_maps.size()); ++i) { |
960 | 960 |
delete _arc_maps[i]; |
961 | 961 |
} |
962 | 962 |
for (int i = 0; i < int(_edge_maps.size()); ++i) { |
963 | 963 |
delete _edge_maps[i]; |
964 | 964 |
} |
965 | 965 |
|
966 | 966 |
} |
967 | 967 |
|
968 | 968 |
/// \brief Copies the node references into the given map. |
969 | 969 |
/// |
970 | 970 |
/// Copies the node references into the given map. |
971 | 971 |
template <typename NodeRef> |
972 | 972 |
GraphCopy& nodeRef(NodeRef& map) { |
973 | 973 |
_node_maps.push_back(new _graph_utils_bits::RefCopy<From, Node, |
974 | 974 |
NodeRefMap, NodeRef>(map)); |
975 | 975 |
return *this; |
976 | 976 |
} |
977 | 977 |
|
978 | 978 |
/// \brief Copies the node cross references into the given map. |
979 | 979 |
/// |
980 | 980 |
/// Copies the node cross references (reverse references) into |
981 | 981 |
/// the given map. |
982 | 982 |
template <typename NodeCrossRef> |
983 | 983 |
GraphCopy& nodeCrossRef(NodeCrossRef& map) { |
984 | 984 |
_node_maps.push_back(new _graph_utils_bits::CrossRefCopy<From, Node, |
985 | 985 |
NodeRefMap, NodeCrossRef>(map)); |
986 | 986 |
return *this; |
987 | 987 |
} |
988 | 988 |
|
989 | 989 |
/// \brief Make copy of the given map. |
990 | 990 |
/// |
991 | 991 |
/// Makes copy of the given map for the newly created graph. |
992 | 992 |
/// The new map's key type is the to graph's node type, |
993 | 993 |
/// and the copied map's key type is the from graph's node |
994 | 994 |
/// type. |
995 | 995 |
template <typename ToMap, typename FromMap> |
996 | 996 |
GraphCopy& nodeMap(ToMap& tmap, const FromMap& map) { |
997 | 997 |
_node_maps.push_back(new _graph_utils_bits::MapCopy<From, Node, |
998 | 998 |
NodeRefMap, ToMap, FromMap>(tmap, map)); |
999 | 999 |
return *this; |
1000 | 1000 |
} |
1001 | 1001 |
|
1002 | 1002 |
/// \brief Make a copy of the given node. |
1003 | 1003 |
/// |
1004 | 1004 |
/// Make a copy of the given node. |
1005 | 1005 |
GraphCopy& node(TNode& tnode, const Node& snode) { |
1006 | 1006 |
_node_maps.push_back(new _graph_utils_bits::ItemCopy<From, Node, |
1007 | 1007 |
NodeRefMap, TNode>(tnode, snode)); |
1008 | 1008 |
return *this; |
1009 | 1009 |
} |
1010 | 1010 |
|
1011 | 1011 |
/// \brief Copies the arc references into the given map. |
1012 | 1012 |
/// |
1013 | 1013 |
/// Copies the arc references into the given map. |
1014 | 1014 |
template <typename ArcRef> |
1015 | 1015 |
GraphCopy& arcRef(ArcRef& map) { |
1016 | 1016 |
_arc_maps.push_back(new _graph_utils_bits::RefCopy<From, Arc, |
1017 | 1017 |
ArcRefMap, ArcRef>(map)); |
1018 | 1018 |
return *this; |
1019 | 1019 |
} |
1020 | 1020 |
|
1021 | 1021 |
/// \brief Copies the arc cross references into the given map. |
1022 | 1022 |
/// |
1023 | 1023 |
/// Copies the arc cross references (reverse references) into |
1024 | 1024 |
/// the given map. |
1025 | 1025 |
template <typename ArcCrossRef> |
1026 | 1026 |
GraphCopy& arcCrossRef(ArcCrossRef& map) { |
1027 | 1027 |
_arc_maps.push_back(new _graph_utils_bits::CrossRefCopy<From, Arc, |
1028 | 1028 |
ArcRefMap, ArcCrossRef>(map)); |
1029 | 1029 |
return *this; |
1030 | 1030 |
} |
1031 | 1031 |
|
1032 | 1032 |
/// \brief Make copy of the given map. |
1033 | 1033 |
/// |
1034 | 1034 |
/// Makes copy of the given map for the newly created graph. |
1035 | 1035 |
/// The new map's key type is the to graph's arc type, |
1036 | 1036 |
/// and the copied map's key type is the from graph's arc |
1037 | 1037 |
/// type. |
1038 | 1038 |
template <typename ToMap, typename FromMap> |
1039 | 1039 |
GraphCopy& arcMap(ToMap& tmap, const FromMap& map) { |
1040 | 1040 |
_arc_maps.push_back(new _graph_utils_bits::MapCopy<From, Arc, |
1041 | 1041 |
ArcRefMap, ToMap, FromMap>(tmap, map)); |
1042 | 1042 |
return *this; |
1043 | 1043 |
} |
1044 | 1044 |
|
1045 | 1045 |
/// \brief Make a copy of the given arc. |
1046 | 1046 |
/// |
1047 | 1047 |
/// Make a copy of the given arc. |
1048 | 1048 |
GraphCopy& arc(TArc& tarc, const Arc& sarc) { |
1049 | 1049 |
_arc_maps.push_back(new _graph_utils_bits::ItemCopy<From, Arc, |
1050 | 1050 |
ArcRefMap, TArc>(tarc, sarc)); |
1051 | 1051 |
return *this; |
1052 | 1052 |
} |
1053 | 1053 |
|
1054 | 1054 |
/// \brief Copies the edge references into the given map. |
1055 | 1055 |
/// |
1056 | 1056 |
/// Copies the edge references into the given map. |
1057 | 1057 |
template <typename EdgeRef> |
1058 | 1058 |
GraphCopy& edgeRef(EdgeRef& map) { |
1059 | 1059 |
_edge_maps.push_back(new _graph_utils_bits::RefCopy<From, Edge, |
1060 | 1060 |
EdgeRefMap, EdgeRef>(map)); |
1061 | 1061 |
return *this; |
1062 | 1062 |
} |
1063 | 1063 |
|
1064 | 1064 |
/// \brief Copies the edge cross references into the given map. |
1065 | 1065 |
/// |
1066 | 1066 |
/// Copies the edge cross references (reverse |
1067 | 1067 |
/// references) into the given map. |
1068 | 1068 |
template <typename EdgeCrossRef> |
1069 | 1069 |
GraphCopy& edgeCrossRef(EdgeCrossRef& map) { |
1070 | 1070 |
_edge_maps.push_back(new _graph_utils_bits::CrossRefCopy<From, |
1071 | 1071 |
Edge, EdgeRefMap, EdgeCrossRef>(map)); |
1072 | 1072 |
return *this; |
1073 | 1073 |
} |
1074 | 1074 |
|
1075 | 1075 |
/// \brief Make copy of the given map. |
1076 | 1076 |
/// |
1077 | 1077 |
/// Makes copy of the given map for the newly created graph. |
1078 | 1078 |
/// The new map's key type is the to graph's edge type, |
1079 | 1079 |
/// and the copied map's key type is the from graph's edge |
1080 | 1080 |
/// type. |
1081 | 1081 |
template <typename ToMap, typename FromMap> |
1082 | 1082 |
GraphCopy& edgeMap(ToMap& tmap, const FromMap& map) { |
1083 | 1083 |
_edge_maps.push_back(new _graph_utils_bits::MapCopy<From, Edge, |
1084 | 1084 |
EdgeRefMap, ToMap, FromMap>(tmap, map)); |
1085 | 1085 |
return *this; |
1086 | 1086 |
} |
1087 | 1087 |
|
1088 | 1088 |
/// \brief Make a copy of the given edge. |
1089 | 1089 |
/// |
1090 | 1090 |
/// Make a copy of the given edge. |
1091 | 1091 |
GraphCopy& edge(TEdge& tedge, const Edge& sedge) { |
1092 | 1092 |
_edge_maps.push_back(new _graph_utils_bits::ItemCopy<From, Edge, |
1093 | 1093 |
EdgeRefMap, TEdge>(tedge, sedge)); |
1094 | 1094 |
return *this; |
1095 | 1095 |
} |
1096 | 1096 |
|
1097 | 1097 |
/// \brief Executes the copies. |
1098 | 1098 |
/// |
1099 | 1099 |
/// Executes the copies. |
1100 | 1100 |
void run() { |
1101 | 1101 |
NodeRefMap nodeRefMap(_from); |
1102 | 1102 |
EdgeRefMap edgeRefMap(_from); |
1103 | 1103 |
ArcRefMap arcRefMap(_to, _from, edgeRefMap, nodeRefMap); |
1104 | 1104 |
_graph_utils_bits::GraphCopySelector<To>:: |
1105 | 1105 |
copy(_to, _from, nodeRefMap, edgeRefMap); |
1106 | 1106 |
for (int i = 0; i < int(_node_maps.size()); ++i) { |
1107 | 1107 |
_node_maps[i]->copy(_from, nodeRefMap); |
1108 | 1108 |
} |
1109 | 1109 |
for (int i = 0; i < int(_edge_maps.size()); ++i) { |
1110 | 1110 |
_edge_maps[i]->copy(_from, edgeRefMap); |
1111 | 1111 |
} |
1112 | 1112 |
for (int i = 0; i < int(_arc_maps.size()); ++i) { |
1113 | 1113 |
_arc_maps[i]->copy(_from, arcRefMap); |
1114 | 1114 |
} |
1115 | 1115 |
} |
1116 | 1116 |
|
1117 | 1117 |
private: |
1118 | 1118 |
|
1119 | 1119 |
const From& _from; |
1120 | 1120 |
To& _to; |
1121 | 1121 |
|
1122 | 1122 |
std::vector<_graph_utils_bits::MapCopyBase<From, Node, NodeRefMap>* > |
1123 | 1123 |
_node_maps; |
1124 | 1124 |
|
1125 | 1125 |
std::vector<_graph_utils_bits::MapCopyBase<From, Arc, ArcRefMap>* > |
1126 | 1126 |
_arc_maps; |
1127 | 1127 |
|
1128 | 1128 |
std::vector<_graph_utils_bits::MapCopyBase<From, Edge, EdgeRefMap>* > |
1129 | 1129 |
_edge_maps; |
1130 | 1130 |
|
1131 | 1131 |
}; |
1132 | 1132 |
|
1133 | 1133 |
/// \brief Copy a graph to another graph. |
1134 | 1134 |
/// |
1135 | 1135 |
/// Copy a graph to another graph. The complete usage of the |
1136 | 1136 |
/// function is detailed in the GraphCopy class, but a short |
1137 | 1137 |
/// example shows a basic work: |
1138 | 1138 |
///\code |
1139 | 1139 |
/// copyGraph(trg, src).nodeRef(nr).arcCrossRef(ecr).run(); |
1140 | 1140 |
///\endcode |
1141 | 1141 |
/// |
1142 | 1142 |
/// After the copy the \c nr map will contain the mapping from the |
1143 | 1143 |
/// nodes of the \c from graph to the nodes of the \c to graph and |
1144 | 1144 |
/// \c ecr will contain the mapping from the arcs of the \c to graph |
1145 | 1145 |
/// to the arcs of the \c from graph. |
1146 | 1146 |
/// |
1147 | 1147 |
/// \see GraphCopy |
1148 | 1148 |
template <typename To, typename From> |
1149 | 1149 |
GraphCopy<To, From> |
1150 | 1150 |
copyGraph(To& to, const From& from) { |
1151 | 1151 |
return GraphCopy<To, From>(to, from); |
1152 | 1152 |
} |
1153 | 1153 |
|
1154 | 1154 |
/// @} |
1155 | 1155 |
|
1156 | 1156 |
/// \addtogroup graph_maps |
1157 | 1157 |
/// @{ |
1158 | 1158 |
|
1159 | 1159 |
/// Provides an immutable and unique id for each item in the graph. |
1160 | 1160 |
|
1161 | 1161 |
/// The IdMap class provides a unique and immutable id for each item of the |
1162 | 1162 |
/// same type (e.g. node) in the graph. This id is <ul><li>\b unique: |
1163 | 1163 |
/// different items (nodes) get different ids <li>\b immutable: the id of an |
1164 | 1164 |
/// item (node) does not change (even if you delete other nodes). </ul> |
1165 | 1165 |
/// Through this map you get access (i.e. can read) the inner id values of |
1166 | 1166 |
/// the items stored in the graph. This map can be inverted with its member |
1167 | 1167 |
/// class \c InverseMap or with the \c operator() member. |
1168 | 1168 |
/// |
1169 | 1169 |
template <typename _Graph, typename _Item> |
1170 | 1170 |
class IdMap { |
1171 | 1171 |
public: |
1172 | 1172 |
typedef _Graph Graph; |
1173 | 1173 |
typedef int Value; |
1174 | 1174 |
typedef _Item Item; |
1175 | 1175 |
typedef _Item Key; |
1176 | 1176 |
|
1177 | 1177 |
/// \brief Constructor. |
1178 | 1178 |
/// |
1179 | 1179 |
/// Constructor of the map. |
1180 | 1180 |
explicit IdMap(const Graph& graph) : _graph(&graph) {} |
1181 | 1181 |
|
1182 | 1182 |
/// \brief Gives back the \e id of the item. |
1183 | 1183 |
/// |
1184 | 1184 |
/// Gives back the immutable and unique \e id of the item. |
1185 | 1185 |
int operator[](const Item& item) const { return _graph->id(item);} |
1186 | 1186 |
|
1187 | 1187 |
/// \brief Gives back the item by its id. |
1188 | 1188 |
/// |
1189 | 1189 |
/// Gives back the item by its id. |
1190 | 1190 |
Item operator()(int id) { return _graph->fromId(id, Item()); } |
1191 | 1191 |
|
1192 | 1192 |
private: |
1193 | 1193 |
const Graph* _graph; |
1194 | 1194 |
|
1195 | 1195 |
public: |
1196 | 1196 |
|
1197 | 1197 |
/// \brief The class represents the inverse of its owner (IdMap). |
1198 | 1198 |
/// |
1199 | 1199 |
/// The class represents the inverse of its owner (IdMap). |
1200 | 1200 |
/// \see inverse() |
1201 | 1201 |
class InverseMap { |
1202 | 1202 |
public: |
1203 | 1203 |
|
1204 | 1204 |
/// \brief Constructor. |
1205 | 1205 |
/// |
1206 | 1206 |
/// Constructor for creating an id-to-item map. |
1207 | 1207 |
explicit InverseMap(const Graph& graph) : _graph(&graph) {} |
1208 | 1208 |
|
1209 | 1209 |
/// \brief Constructor. |
1210 | 1210 |
/// |
1211 | 1211 |
/// Constructor for creating an id-to-item map. |
1212 | 1212 |
explicit InverseMap(const IdMap& map) : _graph(map._graph) {} |
1213 | 1213 |
|
1214 | 1214 |
/// \brief Gives back the given item from its id. |
1215 | 1215 |
/// |
1216 | 1216 |
/// Gives back the given item from its id. |
1217 | 1217 |
/// |
1218 | 1218 |
Item operator[](int id) const { return _graph->fromId(id, Item());} |
1219 | 1219 |
|
1220 | 1220 |
private: |
1221 | 1221 |
const Graph* _graph; |
1222 | 1222 |
}; |
1223 | 1223 |
|
1224 | 1224 |
/// \brief Gives back the inverse of the map. |
1225 | 1225 |
/// |
1226 | 1226 |
/// Gives back the inverse of the IdMap. |
1227 | 1227 |
InverseMap inverse() const { return InverseMap(*_graph);} |
1228 | 1228 |
|
1229 | 1229 |
}; |
1230 | 1230 |
|
1231 | 1231 |
|
1232 | 1232 |
/// \brief General invertable graph-map type. |
1233 | 1233 |
|
1234 | 1234 |
/// This type provides simple invertable graph-maps. |
1235 | 1235 |
/// The InvertableMap wraps an arbitrary ReadWriteMap |
1236 | 1236 |
/// and if a key is set to a new value then store it |
1237 | 1237 |
/// in the inverse map. |
1238 | 1238 |
/// |
1239 | 1239 |
/// The values of the map can be accessed |
1240 | 1240 |
/// with stl compatible forward iterator. |
1241 | 1241 |
/// |
1242 | 1242 |
/// \tparam _Graph The graph type. |
1243 | 1243 |
/// \tparam _Item The item type of the graph. |
1244 | 1244 |
/// \tparam _Value The value type of the map. |
1245 | 1245 |
/// |
1246 | 1246 |
/// \see IterableValueMap |
1247 | 1247 |
template <typename _Graph, typename _Item, typename _Value> |
1248 | 1248 |
class InvertableMap : protected DefaultMap<_Graph, _Item, _Value> { |
1249 | 1249 |
private: |
1250 | 1250 |
|
1251 | 1251 |
typedef DefaultMap<_Graph, _Item, _Value> Map; |
1252 | 1252 |
typedef _Graph Graph; |
1253 | 1253 |
|
1254 | 1254 |
typedef std::map<_Value, _Item> Container; |
1255 | 1255 |
Container _inv_map; |
1256 | 1256 |
|
1257 | 1257 |
public: |
1258 | 1258 |
|
1259 | 1259 |
/// The key type of InvertableMap (Node, Arc, Edge). |
1260 | 1260 |
typedef typename Map::Key Key; |
1261 | 1261 |
/// The value type of the InvertableMap. |
1262 | 1262 |
typedef typename Map::Value Value; |
1263 | 1263 |
|
1264 | 1264 |
|
1265 | 1265 |
|
1266 | 1266 |
/// \brief Constructor. |
1267 | 1267 |
/// |
1268 | 1268 |
/// Construct a new InvertableMap for the graph. |
1269 | 1269 |
/// |
1270 | 1270 |
explicit InvertableMap(const Graph& graph) : Map(graph) {} |
1271 | 1271 |
|
1272 | 1272 |
/// \brief Forward iterator for values. |
1273 | 1273 |
/// |
1274 | 1274 |
/// This iterator is an stl compatible forward |
1275 | 1275 |
/// iterator on the values of the map. The values can |
1276 | 1276 |
/// be accessed in the [beginValue, endValue) range. |
1277 | 1277 |
/// |
1278 | 1278 |
class ValueIterator |
1279 | 1279 |
: public std::iterator<std::forward_iterator_tag, Value> { |
1280 | 1280 |
friend class InvertableMap; |
1281 | 1281 |
private: |
1282 | 1282 |
ValueIterator(typename Container::const_iterator _it) |
1283 | 1283 |
: it(_it) {} |
1284 | 1284 |
public: |
1285 | 1285 |
|
1286 | 1286 |
ValueIterator() {} |
1287 | 1287 |
|
1288 | 1288 |
ValueIterator& operator++() { ++it; return *this; } |
1289 | 1289 |
ValueIterator operator++(int) { |
1290 | 1290 |
ValueIterator tmp(*this); |
1291 | 1291 |
operator++(); |
1292 | 1292 |
return tmp; |
1293 | 1293 |
} |
1294 | 1294 |
|
1295 | 1295 |
const Value& operator*() const { return it->first; } |
1296 | 1296 |
const Value* operator->() const { return &(it->first); } |
1297 | 1297 |
|
1298 | 1298 |
bool operator==(ValueIterator jt) const { return it == jt.it; } |
1299 | 1299 |
bool operator!=(ValueIterator jt) const { return it != jt.it; } |
1300 | 1300 |
|
1301 | 1301 |
private: |
1302 | 1302 |
typename Container::const_iterator it; |
1303 | 1303 |
}; |
1304 | 1304 |
|
1305 | 1305 |
/// \brief Returns an iterator to the first value. |
1306 | 1306 |
/// |
1307 | 1307 |
/// Returns an stl compatible iterator to the |
1308 | 1308 |
/// first value of the map. The values of the |
1309 | 1309 |
/// map can be accessed in the [beginValue, endValue) |
1310 | 1310 |
/// range. |
1311 | 1311 |
ValueIterator beginValue() const { |
1312 | 1312 |
return ValueIterator(_inv_map.begin()); |
1313 | 1313 |
} |
1314 | 1314 |
|
1315 | 1315 |
/// \brief Returns an iterator after the last value. |
1316 | 1316 |
/// |
1317 | 1317 |
/// Returns an stl compatible iterator after the |
1318 | 1318 |
/// last value of the map. The values of the |
1319 | 1319 |
/// map can be accessed in the [beginValue, endValue) |
1320 | 1320 |
/// range. |
1321 | 1321 |
ValueIterator endValue() const { |
1322 | 1322 |
return ValueIterator(_inv_map.end()); |
1323 | 1323 |
} |
1324 | 1324 |
|
1325 | 1325 |
/// \brief The setter function of the map. |
1326 | 1326 |
/// |
1327 | 1327 |
/// Sets the mapped value. |
1328 | 1328 |
void set(const Key& key, const Value& val) { |
1329 | 1329 |
Value oldval = Map::operator[](key); |
1330 | 1330 |
typename Container::iterator it = _inv_map.find(oldval); |
1331 | 1331 |
if (it != _inv_map.end() && it->second == key) { |
1332 | 1332 |
_inv_map.erase(it); |
1333 | 1333 |
} |
1334 | 1334 |
_inv_map.insert(make_pair(val, key)); |
1335 | 1335 |
Map::set(key, val); |
1336 | 1336 |
} |
1337 | 1337 |
|
1338 | 1338 |
/// \brief The getter function of the map. |
1339 | 1339 |
/// |
1340 | 1340 |
/// It gives back the value associated with the key. |
1341 | 1341 |
typename MapTraits<Map>::ConstReturnValue |
1342 | 1342 |
operator[](const Key& key) const { |
1343 | 1343 |
return Map::operator[](key); |
1344 | 1344 |
} |
1345 | 1345 |
|
1346 | 1346 |
/// \brief Gives back the item by its value. |
1347 | 1347 |
/// |
1348 | 1348 |
/// Gives back the item by its value. |
1349 | 1349 |
Key operator()(const Value& key) const { |
1350 | 1350 |
typename Container::const_iterator it = _inv_map.find(key); |
1351 | 1351 |
return it != _inv_map.end() ? it->second : INVALID; |
1352 | 1352 |
} |
1353 | 1353 |
|
1354 | 1354 |
protected: |
1355 | 1355 |
|
1356 | 1356 |
/// \brief Erase the key from the map. |
1357 | 1357 |
/// |
1358 | 1358 |
/// Erase the key to the map. It is called by the |
1359 | 1359 |
/// \c AlterationNotifier. |
1360 | 1360 |
virtual void erase(const Key& key) { |
1361 | 1361 |
Value val = Map::operator[](key); |
1362 | 1362 |
typename Container::iterator it = _inv_map.find(val); |
1363 | 1363 |
if (it != _inv_map.end() && it->second == key) { |
1364 | 1364 |
_inv_map.erase(it); |
1365 | 1365 |
} |
1366 | 1366 |
Map::erase(key); |
1367 | 1367 |
} |
1368 | 1368 |
|
1369 | 1369 |
/// \brief Erase more keys from the map. |
1370 | 1370 |
/// |
1371 | 1371 |
/// Erase more keys from the map. It is called by the |
1372 | 1372 |
/// \c AlterationNotifier. |
1373 | 1373 |
virtual void erase(const std::vector<Key>& keys) { |
1374 | 1374 |
for (int i = 0; i < int(keys.size()); ++i) { |
1375 | 1375 |
Value val = Map::operator[](keys[i]); |
1376 | 1376 |
typename Container::iterator it = _inv_map.find(val); |
1377 | 1377 |
if (it != _inv_map.end() && it->second == keys[i]) { |
1378 | 1378 |
_inv_map.erase(it); |
1379 | 1379 |
} |
1380 | 1380 |
} |
1381 | 1381 |
Map::erase(keys); |
1382 | 1382 |
} |
1383 | 1383 |
|
1384 | 1384 |
/// \brief Clear the keys from the map and inverse map. |
1385 | 1385 |
/// |
1386 | 1386 |
/// Clear the keys from the map and inverse map. It is called by the |
1387 | 1387 |
/// \c AlterationNotifier. |
1388 | 1388 |
virtual void clear() { |
1389 | 1389 |
_inv_map.clear(); |
1390 | 1390 |
Map::clear(); |
1391 | 1391 |
} |
1392 | 1392 |
|
1393 | 1393 |
public: |
1394 | 1394 |
|
1395 | 1395 |
/// \brief The inverse map type. |
1396 | 1396 |
/// |
1397 | 1397 |
/// The inverse of this map. The subscript operator of the map |
1398 | 1398 |
/// gives back always the item what was last assigned to the value. |
1399 | 1399 |
class InverseMap { |
1400 | 1400 |
public: |
1401 | 1401 |
/// \brief Constructor of the InverseMap. |
1402 | 1402 |
/// |
1403 | 1403 |
/// Constructor of the InverseMap. |
1404 | 1404 |
explicit InverseMap(const InvertableMap& inverted) |
1405 | 1405 |
: _inverted(inverted) {} |
1406 | 1406 |
|
1407 | 1407 |
/// The value type of the InverseMap. |
1408 | 1408 |
typedef typename InvertableMap::Key Value; |
1409 | 1409 |
/// The key type of the InverseMap. |
1410 | 1410 |
typedef typename InvertableMap::Value Key; |
1411 | 1411 |
|
1412 | 1412 |
/// \brief Subscript operator. |
1413 | 1413 |
/// |
1414 | 1414 |
/// Subscript operator. It gives back always the item |
1415 | 1415 |
/// what was last assigned to the value. |
1416 | 1416 |
Value operator[](const Key& key) const { |
1417 | 1417 |
return _inverted(key); |
1418 | 1418 |
} |
1419 | 1419 |
|
1420 | 1420 |
private: |
1421 | 1421 |
const InvertableMap& _inverted; |
1422 | 1422 |
}; |
1423 | 1423 |
|
1424 | 1424 |
/// \brief It gives back the just readable inverse map. |
1425 | 1425 |
/// |
1426 | 1426 |
/// It gives back the just readable inverse map. |
1427 | 1427 |
InverseMap inverse() const { |
1428 | 1428 |
return InverseMap(*this); |
1429 | 1429 |
} |
1430 | 1430 |
|
1431 | 1431 |
|
1432 | 1432 |
|
1433 | 1433 |
}; |
1434 | 1434 |
|
1435 | 1435 |
/// \brief Provides a mutable, continuous and unique descriptor for each |
1436 | 1436 |
/// item in the graph. |
1437 | 1437 |
/// |
1438 | 1438 |
/// The DescriptorMap class provides a unique and continuous (but mutable) |
1439 | 1439 |
/// descriptor (id) for each item of the same type (e.g. node) in the |
1440 | 1440 |
/// graph. This id is <ul><li>\b unique: different items (nodes) get |
1441 | 1441 |
/// different ids <li>\b continuous: the range of the ids is the set of |
1442 | 1442 |
/// integers between 0 and \c n-1, where \c n is the number of the items of |
1443 | 1443 |
/// this type (e.g. nodes) (so the id of a node can change if you delete an |
1444 | 1444 |
/// other node, i.e. this id is mutable). </ul> This map can be inverted |
1445 | 1445 |
/// with its member class \c InverseMap, or with the \c operator() member. |
1446 | 1446 |
/// |
1447 | 1447 |
/// \tparam _Graph The graph class the \c DescriptorMap belongs to. |
1448 | 1448 |
/// \tparam _Item The Item is the Key of the Map. It may be Node, Arc or |
1449 | 1449 |
/// Edge. |
1450 | 1450 |
template <typename _Graph, typename _Item> |
1451 | 1451 |
class DescriptorMap : protected DefaultMap<_Graph, _Item, int> { |
1452 | 1452 |
|
1453 | 1453 |
typedef _Item Item; |
1454 | 1454 |
typedef DefaultMap<_Graph, _Item, int> Map; |
1455 | 1455 |
|
1456 | 1456 |
public: |
1457 | 1457 |
/// The graph class of DescriptorMap. |
1458 | 1458 |
typedef _Graph Graph; |
1459 | 1459 |
|
1460 | 1460 |
/// The key type of DescriptorMap (Node, Arc, Edge). |
1461 | 1461 |
typedef typename Map::Key Key; |
1462 | 1462 |
/// The value type of DescriptorMap. |
1463 | 1463 |
typedef typename Map::Value Value; |
1464 | 1464 |
|
1465 | 1465 |
/// \brief Constructor. |
1466 | 1466 |
/// |
1467 | 1467 |
/// Constructor for descriptor map. |
1468 | 1468 |
explicit DescriptorMap(const Graph& _graph) : Map(_graph) { |
1469 | 1469 |
Item it; |
1470 | 1470 |
const typename Map::Notifier* nf = Map::notifier(); |
1471 | 1471 |
for (nf->first(it); it != INVALID; nf->next(it)) { |
1472 | 1472 |
Map::set(it, _inv_map.size()); |
1473 | 1473 |
_inv_map.push_back(it); |
1474 | 1474 |
} |
1475 | 1475 |
} |
1476 | 1476 |
|
1477 | 1477 |
protected: |
1478 | 1478 |
|
1479 | 1479 |
/// \brief Add a new key to the map. |
1480 | 1480 |
/// |
1481 | 1481 |
/// Add a new key to the map. It is called by the |
1482 | 1482 |
/// \c AlterationNotifier. |
1483 | 1483 |
virtual void add(const Item& item) { |
1484 | 1484 |
Map::add(item); |
1485 | 1485 |
Map::set(item, _inv_map.size()); |
1486 | 1486 |
_inv_map.push_back(item); |
1487 | 1487 |
} |
1488 | 1488 |
|
1489 | 1489 |
/// \brief Add more new keys to the map. |
1490 | 1490 |
/// |
1491 | 1491 |
/// Add more new keys to the map. It is called by the |
1492 | 1492 |
/// \c AlterationNotifier. |
1493 | 1493 |
virtual void add(const std::vector<Item>& items) { |
1494 | 1494 |
Map::add(items); |
1495 | 1495 |
for (int i = 0; i < int(items.size()); ++i) { |
1496 | 1496 |
Map::set(items[i], _inv_map.size()); |
1497 | 1497 |
_inv_map.push_back(items[i]); |
1498 | 1498 |
} |
1499 | 1499 |
} |
1500 | 1500 |
|
1501 | 1501 |
/// \brief Erase the key from the map. |
1502 | 1502 |
/// |
1503 | 1503 |
/// Erase the key from the map. It is called by the |
1504 | 1504 |
/// \c AlterationNotifier. |
1505 | 1505 |
virtual void erase(const Item& item) { |
1506 | 1506 |
Map::set(_inv_map.back(), Map::operator[](item)); |
1507 | 1507 |
_inv_map[Map::operator[](item)] = _inv_map.back(); |
1508 | 1508 |
_inv_map.pop_back(); |
1509 | 1509 |
Map::erase(item); |
1510 | 1510 |
} |
1511 | 1511 |
|
1512 | 1512 |
/// \brief Erase more keys from the map. |
1513 | 1513 |
/// |
1514 | 1514 |
/// Erase more keys from the map. It is called by the |
1515 | 1515 |
/// \c AlterationNotifier. |
1516 | 1516 |
virtual void erase(const std::vector<Item>& items) { |
1517 | 1517 |
for (int i = 0; i < int(items.size()); ++i) { |
1518 | 1518 |
Map::set(_inv_map.back(), Map::operator[](items[i])); |
1519 | 1519 |
_inv_map[Map::operator[](items[i])] = _inv_map.back(); |
1520 | 1520 |
_inv_map.pop_back(); |
1521 | 1521 |
} |
1522 | 1522 |
Map::erase(items); |
1523 | 1523 |
} |
1524 | 1524 |
|
1525 | 1525 |
/// \brief Build the unique map. |
1526 | 1526 |
/// |
1527 | 1527 |
/// Build the unique map. It is called by the |
1528 | 1528 |
/// \c AlterationNotifier. |
1529 | 1529 |
virtual void build() { |
1530 | 1530 |
Map::build(); |
1531 | 1531 |
Item it; |
1532 | 1532 |
const typename Map::Notifier* nf = Map::notifier(); |
1533 | 1533 |
for (nf->first(it); it != INVALID; nf->next(it)) { |
1534 | 1534 |
Map::set(it, _inv_map.size()); |
1535 | 1535 |
_inv_map.push_back(it); |
1536 | 1536 |
} |
1537 | 1537 |
} |
1538 | 1538 |
|
1539 | 1539 |
/// \brief Clear the keys from the map. |
1540 | 1540 |
/// |
1541 | 1541 |
/// Clear the keys from the map. It is called by the |
1542 | 1542 |
/// \c AlterationNotifier. |
1543 | 1543 |
virtual void clear() { |
1544 | 1544 |
_inv_map.clear(); |
1545 | 1545 |
Map::clear(); |
1546 | 1546 |
} |
1547 | 1547 |
|
1548 | 1548 |
public: |
1549 | 1549 |
|
1550 | 1550 |
/// \brief Returns the maximal value plus one. |
1551 | 1551 |
/// |
1552 | 1552 |
/// Returns the maximal value plus one in the map. |
1553 | 1553 |
unsigned int size() const { |
1554 | 1554 |
return _inv_map.size(); |
1555 | 1555 |
} |
1556 | 1556 |
|
1557 | 1557 |
/// \brief Swaps the position of the two items in the map. |
1558 | 1558 |
/// |
1559 | 1559 |
/// Swaps the position of the two items in the map. |
1560 | 1560 |
void swap(const Item& p, const Item& q) { |
1561 | 1561 |
int pi = Map::operator[](p); |
1562 | 1562 |
int qi = Map::operator[](q); |
1563 | 1563 |
Map::set(p, qi); |
1564 | 1564 |
_inv_map[qi] = p; |
1565 | 1565 |
Map::set(q, pi); |
1566 | 1566 |
_inv_map[pi] = q; |
1567 | 1567 |
} |
1568 | 1568 |
|
1569 | 1569 |
/// \brief Gives back the \e descriptor of the item. |
1570 | 1570 |
/// |
1571 | 1571 |
/// Gives back the mutable and unique \e descriptor of the map. |
1572 | 1572 |
int operator[](const Item& item) const { |
1573 | 1573 |
return Map::operator[](item); |
1574 | 1574 |
} |
1575 | 1575 |
|
1576 | 1576 |
/// \brief Gives back the item by its descriptor. |
1577 | 1577 |
/// |
1578 | 1578 |
/// Gives back th item by its descriptor. |
1579 | 1579 |
Item operator()(int id) const { |
1580 | 1580 |
return _inv_map[id]; |
1581 | 1581 |
} |
1582 | 1582 |
|
1583 | 1583 |
private: |
1584 | 1584 |
|
1585 | 1585 |
typedef std::vector<Item> Container; |
1586 | 1586 |
Container _inv_map; |
1587 | 1587 |
|
1588 | 1588 |
public: |
1589 | 1589 |
/// \brief The inverse map type of DescriptorMap. |
1590 | 1590 |
/// |
1591 | 1591 |
/// The inverse map type of DescriptorMap. |
1592 | 1592 |
class InverseMap { |
1593 | 1593 |
public: |
1594 | 1594 |
/// \brief Constructor of the InverseMap. |
1595 | 1595 |
/// |
1596 | 1596 |
/// Constructor of the InverseMap. |
1597 | 1597 |
explicit InverseMap(const DescriptorMap& inverted) |
1598 | 1598 |
: _inverted(inverted) {} |
1599 | 1599 |
|
1600 | 1600 |
|
1601 | 1601 |
/// The value type of the InverseMap. |
1602 | 1602 |
typedef typename DescriptorMap::Key Value; |
1603 | 1603 |
/// The key type of the InverseMap. |
1604 | 1604 |
typedef typename DescriptorMap::Value Key; |
1605 | 1605 |
|
1606 | 1606 |
/// \brief Subscript operator. |
1607 | 1607 |
/// |
1608 | 1608 |
/// Subscript operator. It gives back the item |
1609 | 1609 |
/// that the descriptor belongs to currently. |
1610 | 1610 |
Value operator[](const Key& key) const { |
1611 | 1611 |
return _inverted(key); |
1612 | 1612 |
} |
1613 | 1613 |
|
1614 | 1614 |
/// \brief Size of the map. |
1615 | 1615 |
/// |
1616 | 1616 |
/// Returns the size of the map. |
1617 | 1617 |
unsigned int size() const { |
1618 | 1618 |
return _inverted.size(); |
1619 | 1619 |
} |
1620 | 1620 |
|
1621 | 1621 |
private: |
1622 | 1622 |
const DescriptorMap& _inverted; |
1623 | 1623 |
}; |
1624 | 1624 |
|
1625 | 1625 |
/// \brief Gives back the inverse of the map. |
1626 | 1626 |
/// |
1627 | 1627 |
/// Gives back the inverse of the map. |
1628 | 1628 |
const InverseMap inverse() const { |
1629 | 1629 |
return InverseMap(*this); |
1630 | 1630 |
} |
1631 | 1631 |
}; |
1632 | 1632 |
|
1633 | 1633 |
/// \brief Returns the source of the given arc. |
1634 | 1634 |
/// |
1635 | 1635 |
/// The SourceMap gives back the source Node of the given arc. |
1636 | 1636 |
/// \see TargetMap |
1637 | 1637 |
template <typename Digraph> |
1638 | 1638 |
class SourceMap { |
1639 | 1639 |
public: |
1640 | 1640 |
|
1641 | 1641 |
typedef typename Digraph::Node Value; |
1642 | 1642 |
typedef typename Digraph::Arc Key; |
1643 | 1643 |
|
1644 | 1644 |
/// \brief Constructor |
1645 | 1645 |
/// |
1646 | 1646 |
/// Constructor |
1647 | 1647 |
/// \param _digraph The digraph that the map belongs to. |
1648 | 1648 |
explicit SourceMap(const Digraph& digraph) : _digraph(digraph) {} |
1649 | 1649 |
|
1650 | 1650 |
/// \brief The subscript operator. |
1651 | 1651 |
/// |
1652 | 1652 |
/// The subscript operator. |
1653 | 1653 |
/// \param arc The arc |
1654 | 1654 |
/// \return The source of the arc |
1655 | 1655 |
Value operator[](const Key& arc) const { |
1656 | 1656 |
return _digraph.source(arc); |
1657 | 1657 |
} |
1658 | 1658 |
|
1659 | 1659 |
private: |
1660 | 1660 |
const Digraph& _digraph; |
1661 | 1661 |
}; |
1662 | 1662 |
|
1663 | 1663 |
/// \brief Returns a \ref SourceMap class. |
1664 | 1664 |
/// |
1665 | 1665 |
/// This function just returns an \ref SourceMap class. |
1666 | 1666 |
/// \relates SourceMap |
1667 | 1667 |
template <typename Digraph> |
1668 | 1668 |
inline SourceMap<Digraph> sourceMap(const Digraph& digraph) { |
1669 | 1669 |
return SourceMap<Digraph>(digraph); |
1670 | 1670 |
} |
1671 | 1671 |
|
1672 | 1672 |
/// \brief Returns the target of the given arc. |
1673 | 1673 |
/// |
1674 | 1674 |
/// The TargetMap gives back the target Node of the given arc. |
1675 | 1675 |
/// \see SourceMap |
1676 | 1676 |
template <typename Digraph> |
1677 | 1677 |
class TargetMap { |
1678 | 1678 |
public: |
1679 | 1679 |
|
1680 | 1680 |
typedef typename Digraph::Node Value; |
1681 | 1681 |
typedef typename Digraph::Arc Key; |
1682 | 1682 |
|
1683 | 1683 |
/// \brief Constructor |
1684 | 1684 |
/// |
1685 | 1685 |
/// Constructor |
1686 | 1686 |
/// \param _digraph The digraph that the map belongs to. |
1687 | 1687 |
explicit TargetMap(const Digraph& digraph) : _digraph(digraph) {} |
1688 | 1688 |
|
1689 | 1689 |
/// \brief The subscript operator. |
1690 | 1690 |
/// |
1691 | 1691 |
/// The subscript operator. |
1692 | 1692 |
/// \param e The arc |
1693 | 1693 |
/// \return The target of the arc |
1694 | 1694 |
Value operator[](const Key& e) const { |
1695 | 1695 |
return _digraph.target(e); |
1696 | 1696 |
} |
1697 | 1697 |
|
1698 | 1698 |
private: |
1699 | 1699 |
const Digraph& _digraph; |
1700 | 1700 |
}; |
1701 | 1701 |
|
1702 | 1702 |
/// \brief Returns a \ref TargetMap class. |
1703 | 1703 |
/// |
1704 | 1704 |
/// This function just returns a \ref TargetMap class. |
1705 | 1705 |
/// \relates TargetMap |
1706 | 1706 |
template <typename Digraph> |
1707 | 1707 |
inline TargetMap<Digraph> targetMap(const Digraph& digraph) { |
1708 | 1708 |
return TargetMap<Digraph>(digraph); |
1709 | 1709 |
} |
1710 | 1710 |
|
1711 | 1711 |
/// \brief Returns the "forward" directed arc view of an edge. |
1712 | 1712 |
/// |
1713 | 1713 |
/// Returns the "forward" directed arc view of an edge. |
1714 | 1714 |
/// \see BackwardMap |
1715 | 1715 |
template <typename Graph> |
1716 | 1716 |
class ForwardMap { |
1717 | 1717 |
public: |
1718 | 1718 |
|
1719 | 1719 |
typedef typename Graph::Arc Value; |
1720 | 1720 |
typedef typename Graph::Edge Key; |
1721 | 1721 |
|
1722 | 1722 |
/// \brief Constructor |
1723 | 1723 |
/// |
1724 | 1724 |
/// Constructor |
1725 | 1725 |
/// \param _graph The graph that the map belongs to. |
1726 | 1726 |
explicit ForwardMap(const Graph& graph) : _graph(graph) {} |
1727 | 1727 |
|
1728 | 1728 |
/// \brief The subscript operator. |
1729 | 1729 |
/// |
1730 | 1730 |
/// The subscript operator. |
1731 | 1731 |
/// \param key An edge |
1732 | 1732 |
/// \return The "forward" directed arc view of edge |
1733 | 1733 |
Value operator[](const Key& key) const { |
1734 | 1734 |
return _graph.direct(key, true); |
1735 | 1735 |
} |
1736 | 1736 |
|
1737 | 1737 |
private: |
1738 | 1738 |
const Graph& _graph; |
1739 | 1739 |
}; |
1740 | 1740 |
|
1741 | 1741 |
/// \brief Returns a \ref ForwardMap class. |
1742 | 1742 |
/// |
1743 | 1743 |
/// This function just returns an \ref ForwardMap class. |
1744 | 1744 |
/// \relates ForwardMap |
1745 | 1745 |
template <typename Graph> |
1746 | 1746 |
inline ForwardMap<Graph> forwardMap(const Graph& graph) { |
1747 | 1747 |
return ForwardMap<Graph>(graph); |
1748 | 1748 |
} |
1749 | 1749 |
|
1750 | 1750 |
/// \brief Returns the "backward" directed arc view of an edge. |
1751 | 1751 |
/// |
1752 | 1752 |
/// Returns the "backward" directed arc view of an edge. |
1753 | 1753 |
/// \see ForwardMap |
1754 | 1754 |
template <typename Graph> |
1755 | 1755 |
class BackwardMap { |
1756 | 1756 |
public: |
1757 | 1757 |
|
1758 | 1758 |
typedef typename Graph::Arc Value; |
1759 | 1759 |
typedef typename Graph::Edge Key; |
1760 | 1760 |
|
1761 | 1761 |
/// \brief Constructor |
1762 | 1762 |
/// |
1763 | 1763 |
/// Constructor |
1764 | 1764 |
/// \param _graph The graph that the map belongs to. |
1765 | 1765 |
explicit BackwardMap(const Graph& graph) : _graph(graph) {} |
1766 | 1766 |
|
1767 | 1767 |
/// \brief The subscript operator. |
1768 | 1768 |
/// |
1769 | 1769 |
/// The subscript operator. |
1770 | 1770 |
/// \param key An edge |
1771 | 1771 |
/// \return The "backward" directed arc view of edge |
1772 | 1772 |
Value operator[](const Key& key) const { |
1773 | 1773 |
return _graph.direct(key, false); |
1774 | 1774 |
} |
1775 | 1775 |
|
1776 | 1776 |
private: |
1777 | 1777 |
const Graph& _graph; |
1778 | 1778 |
}; |
1779 | 1779 |
|
1780 | 1780 |
/// \brief Returns a \ref BackwardMap class |
1781 | 1781 |
|
1782 | 1782 |
/// This function just returns a \ref BackwardMap class. |
1783 | 1783 |
/// \relates BackwardMap |
1784 | 1784 |
template <typename Graph> |
1785 | 1785 |
inline BackwardMap<Graph> backwardMap(const Graph& graph) { |
1786 | 1786 |
return BackwardMap<Graph>(graph); |
1787 | 1787 |
} |
1788 | 1788 |
|
1789 | 1789 |
/// \brief Potential difference map |
1790 | 1790 |
/// |
1791 | 1791 |
/// If there is an potential map on the nodes then we |
1792 | 1792 |
/// can get an arc map as we get the substraction of the |
1793 | 1793 |
/// values of the target and source. |
1794 | 1794 |
template <typename Digraph, typename NodeMap> |
1795 | 1795 |
class PotentialDifferenceMap { |
1796 | 1796 |
public: |
1797 | 1797 |
typedef typename Digraph::Arc Key; |
1798 | 1798 |
typedef typename NodeMap::Value Value; |
1799 | 1799 |
|
1800 | 1800 |
/// \brief Constructor |
1801 | 1801 |
/// |
1802 | 1802 |
/// Contructor of the map |
1803 | 1803 |
explicit PotentialDifferenceMap(const Digraph& digraph, |
1804 | 1804 |
const NodeMap& potential) |
1805 | 1805 |
: _digraph(digraph), _potential(potential) {} |
1806 | 1806 |
|
1807 | 1807 |
/// \brief Const subscription operator |
1808 | 1808 |
/// |
1809 | 1809 |
/// Const subscription operator |
1810 | 1810 |
Value operator[](const Key& arc) const { |
1811 | 1811 |
return _potential[_digraph.target(arc)] - |
1812 | 1812 |
_potential[_digraph.source(arc)]; |
1813 | 1813 |
} |
1814 | 1814 |
|
1815 | 1815 |
private: |
1816 | 1816 |
const Digraph& _digraph; |
1817 | 1817 |
const NodeMap& _potential; |
1818 | 1818 |
}; |
1819 | 1819 |
|
1820 | 1820 |
/// \brief Returns a PotentialDifferenceMap. |
1821 | 1821 |
/// |
1822 | 1822 |
/// This function just returns a PotentialDifferenceMap. |
1823 | 1823 |
/// \relates PotentialDifferenceMap |
1824 | 1824 |
template <typename Digraph, typename NodeMap> |
1825 | 1825 |
PotentialDifferenceMap<Digraph, NodeMap> |
1826 | 1826 |
potentialDifferenceMap(const Digraph& digraph, const NodeMap& potential) { |
1827 | 1827 |
return PotentialDifferenceMap<Digraph, NodeMap>(digraph, potential); |
1828 | 1828 |
} |
1829 | 1829 |
|
1830 | 1830 |
/// \brief Map of the node in-degrees. |
1831 | 1831 |
/// |
1832 | 1832 |
/// This map returns the in-degree of a node. Once it is constructed, |
1833 | 1833 |
/// the degrees are stored in a standard NodeMap, so each query is done |
1834 | 1834 |
/// in constant time. On the other hand, the values are updated automatically |
1835 | 1835 |
/// whenever the digraph changes. |
1836 | 1836 |
/// |
1837 | 1837 |
/// \warning Besides addNode() and addArc(), a digraph structure may provide |
1838 | 1838 |
/// alternative ways to modify the digraph. The correct behavior of InDegMap |
1839 | 1839 |
/// is not guarantied if these additional features are used. For example |
1840 | 1840 |
/// the functions \ref ListDigraph::changeSource() "changeSource()", |
1841 | 1841 |
/// \ref ListDigraph::changeTarget() "changeTarget()" and |
1842 | 1842 |
/// \ref ListDigraph::reverseArc() "reverseArc()" |
1843 | 1843 |
/// of \ref ListDigraph will \e not update the degree values correctly. |
1844 | 1844 |
/// |
1845 | 1845 |
/// \sa OutDegMap |
1846 | 1846 |
|
1847 | 1847 |
template <typename _Digraph> |
1848 | 1848 |
class InDegMap |
1849 | 1849 |
: protected ItemSetTraits<_Digraph, typename _Digraph::Arc> |
1850 | 1850 |
::ItemNotifier::ObserverBase { |
1851 | 1851 |
|
1852 | 1852 |
public: |
1853 | 1853 |
|
1854 | 1854 |
typedef _Digraph Digraph; |
1855 | 1855 |
typedef int Value; |
1856 | 1856 |
typedef typename Digraph::Node Key; |
1857 | 1857 |
|
1858 | 1858 |
typedef typename ItemSetTraits<Digraph, typename Digraph::Arc> |
1859 | 1859 |
::ItemNotifier::ObserverBase Parent; |
1860 | 1860 |
|
1861 | 1861 |
private: |
1862 | 1862 |
|
1863 | 1863 |
class AutoNodeMap : public DefaultMap<Digraph, Key, int> { |
1864 | 1864 |
public: |
1865 | 1865 |
|
1866 | 1866 |
typedef DefaultMap<Digraph, Key, int> Parent; |
1867 | 1867 |
|
1868 | 1868 |
AutoNodeMap(const Digraph& digraph) : Parent(digraph, 0) {} |
1869 | 1869 |
|
1870 | 1870 |
virtual void add(const Key& key) { |
1871 | 1871 |
Parent::add(key); |
1872 | 1872 |
Parent::set(key, 0); |
1873 | 1873 |
} |
1874 | 1874 |
|
1875 | 1875 |
virtual void add(const std::vector<Key>& keys) { |
1876 | 1876 |
Parent::add(keys); |
1877 | 1877 |
for (int i = 0; i < int(keys.size()); ++i) { |
1878 | 1878 |
Parent::set(keys[i], 0); |
1879 | 1879 |
} |
1880 | 1880 |
} |
1881 | 1881 |
|
1882 | 1882 |
virtual void build() { |
1883 | 1883 |
Parent::build(); |
1884 | 1884 |
Key it; |
1885 | 1885 |
typename Parent::Notifier* nf = Parent::notifier(); |
1886 | 1886 |
for (nf->first(it); it != INVALID; nf->next(it)) { |
1887 | 1887 |
Parent::set(it, 0); |
1888 | 1888 |
} |
1889 | 1889 |
} |
1890 | 1890 |
}; |
1891 | 1891 |
|
1892 | 1892 |
public: |
1893 | 1893 |
|
1894 | 1894 |
/// \brief Constructor. |
1895 | 1895 |
/// |
1896 | 1896 |
/// Constructor for creating in-degree map. |
1897 | 1897 |
explicit InDegMap(const Digraph& digraph) |
1898 | 1898 |
: _digraph(digraph), _deg(digraph) { |
1899 | 1899 |
Parent::attach(_digraph.notifier(typename Digraph::Arc())); |
1900 | 1900 |
|
1901 | 1901 |
for(typename Digraph::NodeIt it(_digraph); it != INVALID; ++it) { |
1902 | 1902 |
_deg[it] = countInArcs(_digraph, it); |
1903 | 1903 |
} |
1904 | 1904 |
} |
1905 | 1905 |
|
1906 | 1906 |
/// Gives back the in-degree of a Node. |
1907 | 1907 |
int operator[](const Key& key) const { |
1908 | 1908 |
return _deg[key]; |
1909 | 1909 |
} |
1910 | 1910 |
|
1911 | 1911 |
protected: |
1912 | 1912 |
|
1913 | 1913 |
typedef typename Digraph::Arc Arc; |
1914 | 1914 |
|
1915 | 1915 |
virtual void add(const Arc& arc) { |
1916 | 1916 |
++_deg[_digraph.target(arc)]; |
1917 | 1917 |
} |
1918 | 1918 |
|
1919 | 1919 |
virtual void add(const std::vector<Arc>& arcs) { |
1920 | 1920 |
for (int i = 0; i < int(arcs.size()); ++i) { |
1921 | 1921 |
++_deg[_digraph.target(arcs[i])]; |
1922 | 1922 |
} |
1923 | 1923 |
} |
1924 | 1924 |
|
1925 | 1925 |
virtual void erase(const Arc& arc) { |
1926 | 1926 |
--_deg[_digraph.target(arc)]; |
1927 | 1927 |
} |
1928 | 1928 |
|
1929 | 1929 |
virtual void erase(const std::vector<Arc>& arcs) { |
1930 | 1930 |
for (int i = 0; i < int(arcs.size()); ++i) { |
1931 | 1931 |
--_deg[_digraph.target(arcs[i])]; |
1932 | 1932 |
} |
1933 | 1933 |
} |
1934 | 1934 |
|
1935 | 1935 |
virtual void build() { |
1936 | 1936 |
for(typename Digraph::NodeIt it(_digraph); it != INVALID; ++it) { |
1937 | 1937 |
_deg[it] = countInArcs(_digraph, it); |
1938 | 1938 |
} |
1939 | 1939 |
} |
1940 | 1940 |
|
1941 | 1941 |
virtual void clear() { |
1942 | 1942 |
for(typename Digraph::NodeIt it(_digraph); it != INVALID; ++it) { |
1943 | 1943 |
_deg[it] = 0; |
1944 | 1944 |
} |
1945 | 1945 |
} |
1946 | 1946 |
private: |
1947 | 1947 |
|
1948 | 1948 |
const Digraph& _digraph; |
1949 | 1949 |
AutoNodeMap _deg; |
1950 | 1950 |
}; |
1951 | 1951 |
|
1952 | 1952 |
/// \brief Map of the node out-degrees. |
1953 | 1953 |
/// |
1954 | 1954 |
/// This map returns the out-degree of a node. Once it is constructed, |
1955 | 1955 |
/// the degrees are stored in a standard NodeMap, so each query is done |
1956 | 1956 |
/// in constant time. On the other hand, the values are updated automatically |
1957 | 1957 |
/// whenever the digraph changes. |
1958 | 1958 |
/// |
1959 | 1959 |
/// \warning Besides addNode() and addArc(), a digraph structure may provide |
1960 | 1960 |
/// alternative ways to modify the digraph. The correct behavior of OutDegMap |
1961 | 1961 |
/// is not guarantied if these additional features are used. For example |
1962 | 1962 |
/// the functions \ref ListDigraph::changeSource() "changeSource()", |
1963 | 1963 |
/// \ref ListDigraph::changeTarget() "changeTarget()" and |
1964 | 1964 |
/// \ref ListDigraph::reverseArc() "reverseArc()" |
1965 | 1965 |
/// of \ref ListDigraph will \e not update the degree values correctly. |
1966 | 1966 |
/// |
1967 | 1967 |
/// \sa InDegMap |
1968 | 1968 |
|
1969 | 1969 |
template <typename _Digraph> |
1970 | 1970 |
class OutDegMap |
1971 | 1971 |
: protected ItemSetTraits<_Digraph, typename _Digraph::Arc> |
1972 | 1972 |
::ItemNotifier::ObserverBase { |
1973 | 1973 |
|
1974 | 1974 |
public: |
1975 | 1975 |
|
1976 | 1976 |
typedef _Digraph Digraph; |
1977 | 1977 |
typedef int Value; |
1978 | 1978 |
typedef typename Digraph::Node Key; |
1979 | 1979 |
|
1980 | 1980 |
typedef typename ItemSetTraits<Digraph, typename Digraph::Arc> |
1981 | 1981 |
::ItemNotifier::ObserverBase Parent; |
1982 | 1982 |
|
1983 | 1983 |
private: |
1984 | 1984 |
|
1985 | 1985 |
class AutoNodeMap : public DefaultMap<Digraph, Key, int> { |
1986 | 1986 |
public: |
1987 | 1987 |
|
1988 | 1988 |
typedef DefaultMap<Digraph, Key, int> Parent; |
1989 | 1989 |
|
1990 | 1990 |
AutoNodeMap(const Digraph& digraph) : Parent(digraph, 0) {} |
1991 | 1991 |
|
1992 | 1992 |
virtual void add(const Key& key) { |
1993 | 1993 |
Parent::add(key); |
1994 | 1994 |
Parent::set(key, 0); |
1995 | 1995 |
} |
1996 | 1996 |
virtual void add(const std::vector<Key>& keys) { |
1997 | 1997 |
Parent::add(keys); |
1998 | 1998 |
for (int i = 0; i < int(keys.size()); ++i) { |
1999 | 1999 |
Parent::set(keys[i], 0); |
2000 | 2000 |
} |
2001 | 2001 |
} |
2002 | 2002 |
virtual void build() { |
2003 | 2003 |
Parent::build(); |
2004 | 2004 |
Key it; |
2005 | 2005 |
typename Parent::Notifier* nf = Parent::notifier(); |
2006 | 2006 |
for (nf->first(it); it != INVALID; nf->next(it)) { |
2007 | 2007 |
Parent::set(it, 0); |
2008 | 2008 |
} |
2009 | 2009 |
} |
2010 | 2010 |
}; |
2011 | 2011 |
|
2012 | 2012 |
public: |
2013 | 2013 |
|
2014 | 2014 |
/// \brief Constructor. |
2015 | 2015 |
/// |
2016 | 2016 |
/// Constructor for creating out-degree map. |
2017 | 2017 |
explicit OutDegMap(const Digraph& digraph) |
2018 | 2018 |
: _digraph(digraph), _deg(digraph) { |
2019 | 2019 |
Parent::attach(_digraph.notifier(typename Digraph::Arc())); |
2020 | 2020 |
|
2021 | 2021 |
for(typename Digraph::NodeIt it(_digraph); it != INVALID; ++it) { |
2022 | 2022 |
_deg[it] = countOutArcs(_digraph, it); |
2023 | 2023 |
} |
2024 | 2024 |
} |
2025 | 2025 |
|
2026 | 2026 |
/// Gives back the out-degree of a Node. |
2027 | 2027 |
int operator[](const Key& key) const { |
2028 | 2028 |
return _deg[key]; |
2029 | 2029 |
} |
2030 | 2030 |
|
2031 | 2031 |
protected: |
2032 | 2032 |
|
2033 | 2033 |
typedef typename Digraph::Arc Arc; |
2034 | 2034 |
|
2035 | 2035 |
virtual void add(const Arc& arc) { |
2036 | 2036 |
++_deg[_digraph.source(arc)]; |
2037 | 2037 |
} |
2038 | 2038 |
|
2039 | 2039 |
virtual void add(const std::vector<Arc>& arcs) { |
2040 | 2040 |
for (int i = 0; i < int(arcs.size()); ++i) { |
2041 | 2041 |
++_deg[_digraph.source(arcs[i])]; |
2042 | 2042 |
} |
2043 | 2043 |
} |
2044 | 2044 |
|
2045 | 2045 |
virtual void erase(const Arc& arc) { |
2046 | 2046 |
--_deg[_digraph.source(arc)]; |
2047 | 2047 |
} |
2048 | 2048 |
|
2049 | 2049 |
virtual void erase(const std::vector<Arc>& arcs) { |
2050 | 2050 |
for (int i = 0; i < int(arcs.size()); ++i) { |
2051 | 2051 |
--_deg[_digraph.source(arcs[i])]; |
2052 | 2052 |
} |
2053 | 2053 |
} |
2054 | 2054 |
|
2055 | 2055 |
virtual void build() { |
2056 | 2056 |
for(typename Digraph::NodeIt it(_digraph); it != INVALID; ++it) { |
2057 | 2057 |
_deg[it] = countOutArcs(_digraph, it); |
2058 | 2058 |
} |
2059 | 2059 |
} |
2060 | 2060 |
|
2061 | 2061 |
virtual void clear() { |
2062 | 2062 |
for(typename Digraph::NodeIt it(_digraph); it != INVALID; ++it) { |
2063 | 2063 |
_deg[it] = 0; |
2064 | 2064 |
} |
2065 | 2065 |
} |
2066 | 2066 |
private: |
2067 | 2067 |
|
2068 | 2068 |
const Digraph& _digraph; |
2069 | 2069 |
AutoNodeMap _deg; |
2070 | 2070 |
}; |
2071 | 2071 |
|
2072 | 2072 |
|
2073 | 2073 |
///Dynamic arc look up between given endpoints. |
2074 | 2074 |
|
2075 | 2075 |
///\ingroup gutils |
2076 | 2076 |
///Using this class, you can find an arc in a digraph from a given |
2077 | 2077 |
///source to a given target in amortized time <em>O(log d)</em>, |
2078 | 2078 |
///where <em>d</em> is the out-degree of the source node. |
2079 | 2079 |
/// |
2080 | 2080 |
///It is possible to find \e all parallel arcs between two nodes with |
2081 | 2081 |
///the \c findFirst() and \c findNext() members. |
2082 | 2082 |
/// |
2083 | 2083 |
///See the \ref ArcLookUp and \ref AllArcLookUp classes if your |
2084 | 2084 |
///digraph is not changed so frequently. |
2085 | 2085 |
/// |
2086 | 2086 |
///This class uses a self-adjusting binary search tree, Sleator's |
2087 | 2087 |
///and Tarjan's Splay tree for guarantee the logarithmic amortized |
2088 | 2088 |
///time bound for arc lookups. This class also guarantees the |
2089 | 2089 |
///optimal time bound in a constant factor for any distribution of |
2090 | 2090 |
///queries. |
2091 | 2091 |
/// |
2092 | 2092 |
///\tparam G The type of the underlying digraph. |
2093 | 2093 |
/// |
2094 | 2094 |
///\sa ArcLookUp |
2095 | 2095 |
///\sa AllArcLookUp |
2096 | 2096 |
template<class G> |
2097 | 2097 |
class DynArcLookUp |
2098 | 2098 |
: protected ItemSetTraits<G, typename G::Arc>::ItemNotifier::ObserverBase |
2099 | 2099 |
{ |
2100 | 2100 |
public: |
2101 | 2101 |
typedef typename ItemSetTraits<G, typename G::Arc> |
2102 | 2102 |
::ItemNotifier::ObserverBase Parent; |
2103 | 2103 |
|
2104 | 2104 |
TEMPLATE_DIGRAPH_TYPEDEFS(G); |
2105 | 2105 |
typedef G Digraph; |
2106 | 2106 |
|
2107 | 2107 |
protected: |
2108 | 2108 |
|
2109 | 2109 |
class AutoNodeMap : public DefaultMap<G, Node, Arc> { |
2110 | 2110 |
public: |
2111 | 2111 |
|
2112 | 2112 |
typedef DefaultMap<G, Node, Arc> Parent; |
2113 | 2113 |
|
2114 | 2114 |
AutoNodeMap(const G& digraph) : Parent(digraph, INVALID) {} |
2115 | 2115 |
|
2116 | 2116 |
virtual void add(const Node& node) { |
2117 | 2117 |
Parent::add(node); |
2118 | 2118 |
Parent::set(node, INVALID); |
2119 | 2119 |
} |
2120 | 2120 |
|
2121 | 2121 |
virtual void add(const std::vector<Node>& nodes) { |
2122 | 2122 |
Parent::add(nodes); |
2123 | 2123 |
for (int i = 0; i < int(nodes.size()); ++i) { |
2124 | 2124 |
Parent::set(nodes[i], INVALID); |
2125 | 2125 |
} |
2126 | 2126 |
} |
2127 | 2127 |
|
2128 | 2128 |
virtual void build() { |
2129 | 2129 |
Parent::build(); |
2130 | 2130 |
Node it; |
2131 | 2131 |
typename Parent::Notifier* nf = Parent::notifier(); |
2132 | 2132 |
for (nf->first(it); it != INVALID; nf->next(it)) { |
2133 | 2133 |
Parent::set(it, INVALID); |
2134 | 2134 |
} |
2135 | 2135 |
} |
2136 | 2136 |
}; |
2137 | 2137 |
|
2138 | 2138 |
const Digraph &_g; |
2139 | 2139 |
AutoNodeMap _head; |
2140 | 2140 |
typename Digraph::template ArcMap<Arc> _parent; |
2141 | 2141 |
typename Digraph::template ArcMap<Arc> _left; |
2142 | 2142 |
typename Digraph::template ArcMap<Arc> _right; |
2143 | 2143 |
|
2144 | 2144 |
class ArcLess { |
2145 | 2145 |
const Digraph &g; |
2146 | 2146 |
public: |
2147 | 2147 |
ArcLess(const Digraph &_g) : g(_g) {} |
2148 | 2148 |
bool operator()(Arc a,Arc b) const |
2149 | 2149 |
{ |
2150 | 2150 |
return g.target(a)<g.target(b); |
2151 | 2151 |
} |
2152 | 2152 |
}; |
2153 | 2153 |
|
2154 | 2154 |
public: |
2155 | 2155 |
|
2156 | 2156 |
///Constructor |
2157 | 2157 |
|
2158 | 2158 |
///Constructor. |
2159 | 2159 |
/// |
2160 | 2160 |
///It builds up the search database. |
2161 | 2161 |
DynArcLookUp(const Digraph &g) |
2162 | 2162 |
: _g(g),_head(g),_parent(g),_left(g),_right(g) |
2163 | 2163 |
{ |
2164 | 2164 |
Parent::attach(_g.notifier(typename Digraph::Arc())); |
2165 | 2165 |
refresh(); |
2166 | 2166 |
} |
2167 | 2167 |
|
2168 | 2168 |
protected: |
2169 | 2169 |
|
2170 | 2170 |
virtual void add(const Arc& arc) { |
2171 | 2171 |
insert(arc); |
2172 | 2172 |
} |
2173 | 2173 |
|
2174 | 2174 |
virtual void add(const std::vector<Arc>& arcs) { |
2175 | 2175 |
for (int i = 0; i < int(arcs.size()); ++i) { |
2176 | 2176 |
insert(arcs[i]); |
2177 | 2177 |
} |
2178 | 2178 |
} |
2179 | 2179 |
|
2180 | 2180 |
virtual void erase(const Arc& arc) { |
2181 | 2181 |
remove(arc); |
2182 | 2182 |
} |
2183 | 2183 |
|
2184 | 2184 |
virtual void erase(const std::vector<Arc>& arcs) { |
2185 | 2185 |
for (int i = 0; i < int(arcs.size()); ++i) { |
2186 | 2186 |
remove(arcs[i]); |
2187 | 2187 |
} |
2188 | 2188 |
} |
2189 | 2189 |
|
2190 | 2190 |
virtual void build() { |
2191 | 2191 |
refresh(); |
2192 | 2192 |
} |
2193 | 2193 |
|
2194 | 2194 |
virtual void clear() { |
2195 | 2195 |
for(NodeIt n(_g);n!=INVALID;++n) { |
2196 | 2196 |
_head.set(n, INVALID); |
2197 | 2197 |
} |
2198 | 2198 |
} |
2199 | 2199 |
|
2200 | 2200 |
void insert(Arc arc) { |
2201 | 2201 |
Node s = _g.source(arc); |
2202 | 2202 |
Node t = _g.target(arc); |
2203 | 2203 |
_left.set(arc, INVALID); |
2204 | 2204 |
_right.set(arc, INVALID); |
2205 | 2205 |
|
2206 | 2206 |
Arc e = _head[s]; |
2207 | 2207 |
if (e == INVALID) { |
2208 | 2208 |
_head.set(s, arc); |
2209 | 2209 |
_parent.set(arc, INVALID); |
2210 | 2210 |
return; |
2211 | 2211 |
} |
2212 | 2212 |
while (true) { |
2213 | 2213 |
if (t < _g.target(e)) { |
2214 | 2214 |
if (_left[e] == INVALID) { |
2215 | 2215 |
_left.set(e, arc); |
2216 | 2216 |
_parent.set(arc, e); |
2217 | 2217 |
splay(arc); |
2218 | 2218 |
return; |
2219 | 2219 |
} else { |
2220 | 2220 |
e = _left[e]; |
2221 | 2221 |
} |
2222 | 2222 |
} else { |
2223 | 2223 |
if (_right[e] == INVALID) { |
2224 | 2224 |
_right.set(e, arc); |
2225 | 2225 |
_parent.set(arc, e); |
2226 | 2226 |
splay(arc); |
2227 | 2227 |
return; |
2228 | 2228 |
} else { |
2229 | 2229 |
e = _right[e]; |
2230 | 2230 |
} |
2231 | 2231 |
} |
2232 | 2232 |
} |
2233 | 2233 |
} |
2234 | 2234 |
|
2235 | 2235 |
void remove(Arc arc) { |
2236 | 2236 |
if (_left[arc] == INVALID) { |
2237 | 2237 |
if (_right[arc] != INVALID) { |
2238 | 2238 |
_parent.set(_right[arc], _parent[arc]); |
2239 | 2239 |
} |
2240 | 2240 |
if (_parent[arc] != INVALID) { |
2241 | 2241 |
if (_left[_parent[arc]] == arc) { |
2242 | 2242 |
_left.set(_parent[arc], _right[arc]); |
2243 | 2243 |
} else { |
2244 | 2244 |
_right.set(_parent[arc], _right[arc]); |
2245 | 2245 |
} |
2246 | 2246 |
} else { |
2247 | 2247 |
_head.set(_g.source(arc), _right[arc]); |
2248 | 2248 |
} |
2249 | 2249 |
} else if (_right[arc] == INVALID) { |
2250 | 2250 |
_parent.set(_left[arc], _parent[arc]); |
2251 | 2251 |
if (_parent[arc] != INVALID) { |
2252 | 2252 |
if (_left[_parent[arc]] == arc) { |
2253 | 2253 |
_left.set(_parent[arc], _left[arc]); |
2254 | 2254 |
} else { |
2255 | 2255 |
_right.set(_parent[arc], _left[arc]); |
2256 | 2256 |
} |
2257 | 2257 |
} else { |
2258 | 2258 |
_head.set(_g.source(arc), _left[arc]); |
2259 | 2259 |
} |
2260 | 2260 |
} else { |
2261 | 2261 |
Arc e = _left[arc]; |
2262 | 2262 |
if (_right[e] != INVALID) { |
2263 | 2263 |
e = _right[e]; |
2264 | 2264 |
while (_right[e] != INVALID) { |
2265 | 2265 |
e = _right[e]; |
2266 | 2266 |
} |
2267 | 2267 |
Arc s = _parent[e]; |
2268 | 2268 |
_right.set(_parent[e], _left[e]); |
2269 | 2269 |
if (_left[e] != INVALID) { |
2270 | 2270 |
_parent.set(_left[e], _parent[e]); |
2271 | 2271 |
} |
2272 | 2272 |
|
2273 | 2273 |
_left.set(e, _left[arc]); |
2274 | 2274 |
_parent.set(_left[arc], e); |
2275 | 2275 |
_right.set(e, _right[arc]); |
2276 | 2276 |
_parent.set(_right[arc], e); |
2277 | 2277 |
|
2278 | 2278 |
_parent.set(e, _parent[arc]); |
2279 | 2279 |
if (_parent[arc] != INVALID) { |
2280 | 2280 |
if (_left[_parent[arc]] == arc) { |
2281 | 2281 |
_left.set(_parent[arc], e); |
2282 | 2282 |
} else { |
2283 | 2283 |
_right.set(_parent[arc], e); |
2284 | 2284 |
} |
2285 | 2285 |
} |
2286 | 2286 |
splay(s); |
2287 | 2287 |
} else { |
2288 | 2288 |
_right.set(e, _right[arc]); |
2289 | 2289 |
_parent.set(_right[arc], e); |
2290 | 2290 |
|
2291 | 2291 |
if (_parent[arc] != INVALID) { |
2292 | 2292 |
if (_left[_parent[arc]] == arc) { |
2293 | 2293 |
_left.set(_parent[arc], e); |
2294 | 2294 |
} else { |
2295 | 2295 |
_right.set(_parent[arc], e); |
2296 | 2296 |
} |
2297 | 2297 |
} else { |
2298 | 2298 |
_head.set(_g.source(arc), e); |
2299 | 2299 |
} |
2300 | 2300 |
} |
2301 | 2301 |
} |
2302 | 2302 |
} |
2303 | 2303 |
|
2304 | 2304 |
Arc refreshRec(std::vector<Arc> &v,int a,int b) |
2305 | 2305 |
{ |
2306 | 2306 |
int m=(a+b)/2; |
2307 | 2307 |
Arc me=v[m]; |
2308 | 2308 |
if (a < m) { |
2309 | 2309 |
Arc left = refreshRec(v,a,m-1); |
2310 | 2310 |
_left.set(me, left); |
2311 | 2311 |
_parent.set(left, me); |
2312 | 2312 |
} else { |
2313 | 2313 |
_left.set(me, INVALID); |
2314 | 2314 |
} |
2315 | 2315 |
if (m < b) { |
2316 | 2316 |
Arc right = refreshRec(v,m+1,b); |
2317 | 2317 |
_right.set(me, right); |
2318 | 2318 |
_parent.set(right, me); |
2319 | 2319 |
} else { |
2320 | 2320 |
_right.set(me, INVALID); |
2321 | 2321 |
} |
2322 | 2322 |
return me; |
2323 | 2323 |
} |
2324 | 2324 |
|
2325 | 2325 |
void refresh() { |
2326 | 2326 |
for(NodeIt n(_g);n!=INVALID;++n) { |
2327 | 2327 |
std::vector<Arc> v; |
2328 | 2328 |
for(OutArcIt e(_g,n);e!=INVALID;++e) v.push_back(e); |
2329 | 2329 |
if(v.size()) { |
2330 | 2330 |
std::sort(v.begin(),v.end(),ArcLess(_g)); |
2331 | 2331 |
Arc head = refreshRec(v,0,v.size()-1); |
2332 | 2332 |
_head.set(n, head); |
2333 | 2333 |
_parent.set(head, INVALID); |
2334 | 2334 |
} |
2335 | 2335 |
else _head.set(n, INVALID); |
2336 | 2336 |
} |
2337 | 2337 |
} |
2338 | 2338 |
|
2339 | 2339 |
void zig(Arc v) { |
2340 | 2340 |
Arc w = _parent[v]; |
2341 | 2341 |
_parent.set(v, _parent[w]); |
2342 | 2342 |
_parent.set(w, v); |
2343 | 2343 |
_left.set(w, _right[v]); |
2344 | 2344 |
_right.set(v, w); |
2345 | 2345 |
if (_parent[v] != INVALID) { |
2346 | 2346 |
if (_right[_parent[v]] == w) { |
2347 | 2347 |
_right.set(_parent[v], v); |
2348 | 2348 |
} else { |
2349 | 2349 |
_left.set(_parent[v], v); |
2350 | 2350 |
} |
2351 | 2351 |
} |
2352 | 2352 |
if (_left[w] != INVALID){ |
2353 | 2353 |
_parent.set(_left[w], w); |
2354 | 2354 |
} |
2355 | 2355 |
} |
2356 | 2356 |
|
2357 | 2357 |
void zag(Arc v) { |
2358 | 2358 |
Arc w = _parent[v]; |
2359 | 2359 |
_parent.set(v, _parent[w]); |
2360 | 2360 |
_parent.set(w, v); |
2361 | 2361 |
_right.set(w, _left[v]); |
2362 | 2362 |
_left.set(v, w); |
2363 | 2363 |
if (_parent[v] != INVALID){ |
2364 | 2364 |
if (_left[_parent[v]] == w) { |
2365 | 2365 |
_left.set(_parent[v], v); |
2366 | 2366 |
} else { |
2367 | 2367 |
_right.set(_parent[v], v); |
2368 | 2368 |
} |
2369 | 2369 |
} |
2370 | 2370 |
if (_right[w] != INVALID){ |
2371 | 2371 |
_parent.set(_right[w], w); |
2372 | 2372 |
} |
2373 | 2373 |
} |
2374 | 2374 |
|
2375 | 2375 |
void splay(Arc v) { |
2376 | 2376 |
while (_parent[v] != INVALID) { |
2377 | 2377 |
if (v == _left[_parent[v]]) { |
2378 | 2378 |
if (_parent[_parent[v]] == INVALID) { |
2379 | 2379 |
zig(v); |
2380 | 2380 |
} else { |
2381 | 2381 |
if (_parent[v] == _left[_parent[_parent[v]]]) { |
2382 | 2382 |
zig(_parent[v]); |
2383 | 2383 |
zig(v); |
2384 | 2384 |
} else { |
2385 | 2385 |
zig(v); |
2386 | 2386 |
zag(v); |
2387 | 2387 |
} |
2388 | 2388 |
} |
2389 | 2389 |
} else { |
2390 | 2390 |
if (_parent[_parent[v]] == INVALID) { |
2391 | 2391 |
zag(v); |
2392 | 2392 |
} else { |
2393 | 2393 |
if (_parent[v] == _left[_parent[_parent[v]]]) { |
2394 | 2394 |
zag(v); |
2395 | 2395 |
zig(v); |
2396 | 2396 |
} else { |
2397 | 2397 |
zag(_parent[v]); |
2398 | 2398 |
zag(v); |
2399 | 2399 |
} |
2400 | 2400 |
} |
2401 | 2401 |
} |
2402 | 2402 |
} |
2403 | 2403 |
_head[_g.source(v)] = v; |
2404 | 2404 |
} |
2405 | 2405 |
|
2406 | 2406 |
|
2407 | 2407 |
public: |
2408 | 2408 |
|
2409 | 2409 |
///Find an arc between two nodes. |
2410 | 2410 |
|
2411 | 2411 |
///Find an arc between two nodes in time <em>O(</em>log<em>d)</em>, where |
2412 | 2412 |
/// <em>d</em> is the number of outgoing arcs of \c s. |
2413 | 2413 |
///\param s The source node |
2414 | 2414 |
///\param t The target node |
2415 | 2415 |
///\return An arc from \c s to \c t if there exists, |
2416 | 2416 |
///\ref INVALID otherwise. |
2417 | 2417 |
Arc operator()(Node s, Node t) const |
2418 | 2418 |
{ |
2419 | 2419 |
Arc a = _head[s]; |
2420 | 2420 |
while (true) { |
2421 | 2421 |
if (_g.target(a) == t) { |
2422 | 2422 |
const_cast<DynArcLookUp&>(*this).splay(a); |
2423 | 2423 |
return a; |
2424 | 2424 |
} else if (t < _g.target(a)) { |
2425 | 2425 |
if (_left[a] == INVALID) { |
2426 | 2426 |
const_cast<DynArcLookUp&>(*this).splay(a); |
2427 | 2427 |
return INVALID; |
2428 | 2428 |
} else { |
2429 | 2429 |
a = _left[a]; |
2430 | 2430 |
} |
2431 | 2431 |
} else { |
2432 | 2432 |
if (_right[a] == INVALID) { |
2433 | 2433 |
const_cast<DynArcLookUp&>(*this).splay(a); |
2434 | 2434 |
return INVALID; |
2435 | 2435 |
} else { |
2436 | 2436 |
a = _right[a]; |
2437 | 2437 |
} |
2438 | 2438 |
} |
2439 | 2439 |
} |
2440 | 2440 |
} |
2441 | 2441 |
|
2442 | 2442 |
///Find the first arc between two nodes. |
2443 | 2443 |
|
2444 | 2444 |
///Find the first arc between two nodes in time |
2445 | 2445 |
/// <em>O(</em>log<em>d)</em>, where <em>d</em> is the number of |
2446 | 2446 |
/// outgoing arcs of \c s. |
2447 | 2447 |
///\param s The source node |
2448 | 2448 |
///\param t The target node |
2449 | 2449 |
///\return An arc from \c s to \c t if there exists, \ref INVALID |
2450 | 2450 |
/// otherwise. |
2451 | 2451 |
Arc findFirst(Node s, Node t) const |
2452 | 2452 |
{ |
2453 | 2453 |
Arc a = _head[s]; |
2454 | 2454 |
Arc r = INVALID; |
2455 | 2455 |
while (true) { |
2456 | 2456 |
if (_g.target(a) < t) { |
2457 | 2457 |
if (_right[a] == INVALID) { |
2458 | 2458 |
const_cast<DynArcLookUp&>(*this).splay(a); |
2459 | 2459 |
return r; |
2460 | 2460 |
} else { |
2461 | 2461 |
a = _right[a]; |
2462 | 2462 |
} |
2463 | 2463 |
} else { |
2464 | 2464 |
if (_g.target(a) == t) { |
2465 | 2465 |
r = a; |
2466 | 2466 |
} |
2467 | 2467 |
if (_left[a] == INVALID) { |
2468 | 2468 |
const_cast<DynArcLookUp&>(*this).splay(a); |
2469 | 2469 |
return r; |
2470 | 2470 |
} else { |
2471 | 2471 |
a = _left[a]; |
2472 | 2472 |
} |
2473 | 2473 |
} |
2474 | 2474 |
} |
2475 | 2475 |
} |
2476 | 2476 |
|
2477 | 2477 |
///Find the next arc between two nodes. |
2478 | 2478 |
|
2479 | 2479 |
///Find the next arc between two nodes in time |
2480 | 2480 |
/// <em>O(</em>log<em>d)</em>, where <em>d</em> is the number of |
2481 | 2481 |
/// outgoing arcs of \c s. |
2482 | 2482 |
///\param s The source node |
2483 | 2483 |
///\param t The target node |
2484 | 2484 |
///\return An arc from \c s to \c t if there exists, \ref INVALID |
2485 | 2485 |
/// otherwise. |
2486 | 2486 |
|
2487 | 2487 |
///\note If \c e is not the result of the previous \c findFirst() |
2488 | 2488 |
///operation then the amorized time bound can not be guaranteed. |
2489 | 2489 |
#ifdef DOXYGEN |
2490 | 2490 |
Arc findNext(Node s, Node t, Arc a) const |
2491 | 2491 |
#else |
2492 | 2492 |
Arc findNext(Node, Node t, Arc a) const |
2493 | 2493 |
#endif |
2494 | 2494 |
{ |
2495 | 2495 |
if (_right[a] != INVALID) { |
2496 | 2496 |
a = _right[a]; |
2497 | 2497 |
while (_left[a] != INVALID) { |
2498 | 2498 |
a = _left[a]; |
2499 | 2499 |
} |
2500 | 2500 |
const_cast<DynArcLookUp&>(*this).splay(a); |
2501 | 2501 |
} else { |
2502 | 2502 |
while (_parent[a] != INVALID && _right[_parent[a]] == a) { |
2503 | 2503 |
a = _parent[a]; |
2504 | 2504 |
} |
2505 | 2505 |
if (_parent[a] == INVALID) { |
2506 | 2506 |
return INVALID; |
2507 | 2507 |
} else { |
2508 | 2508 |
a = _parent[a]; |
2509 | 2509 |
const_cast<DynArcLookUp&>(*this).splay(a); |
2510 | 2510 |
} |
2511 | 2511 |
} |
2512 | 2512 |
if (_g.target(a) == t) return a; |
2513 | 2513 |
else return INVALID; |
2514 | 2514 |
} |
2515 | 2515 |
|
2516 | 2516 |
}; |
2517 | 2517 |
|
2518 | 2518 |
///Fast arc look up between given endpoints. |
2519 | 2519 |
|
2520 | 2520 |
///\ingroup gutils |
2521 | 2521 |
///Using this class, you can find an arc in a digraph from a given |
2522 | 2522 |
///source to a given target in time <em>O(log d)</em>, |
2523 | 2523 |
///where <em>d</em> is the out-degree of the source node. |
2524 | 2524 |
/// |
2525 | 2525 |
///It is not possible to find \e all parallel arcs between two nodes. |
2526 | 2526 |
///Use \ref AllArcLookUp for this purpose. |
2527 | 2527 |
/// |
2528 | 2528 |
///\warning This class is static, so you should refresh() (or at least |
2529 | 2529 |
///refresh(Node)) this data structure |
2530 | 2530 |
///whenever the digraph changes. This is a time consuming (superlinearly |
2531 | 2531 |
///proportional (<em>O(m</em>log<em>m)</em>) to the number of arcs). |
2532 | 2532 |
/// |
2533 | 2533 |
///\tparam G The type of the underlying digraph. |
2534 | 2534 |
/// |
2535 | 2535 |
///\sa DynArcLookUp |
2536 | 2536 |
///\sa AllArcLookUp |
2537 | 2537 |
template<class G> |
2538 | 2538 |
class ArcLookUp |
2539 | 2539 |
{ |
2540 | 2540 |
public: |
2541 | 2541 |
TEMPLATE_DIGRAPH_TYPEDEFS(G); |
2542 | 2542 |
typedef G Digraph; |
2543 | 2543 |
|
2544 | 2544 |
protected: |
2545 | 2545 |
const Digraph &_g; |
2546 | 2546 |
typename Digraph::template NodeMap<Arc> _head; |
2547 | 2547 |
typename Digraph::template ArcMap<Arc> _left; |
2548 | 2548 |
typename Digraph::template ArcMap<Arc> _right; |
2549 | 2549 |
|
2550 | 2550 |
class ArcLess { |
2551 | 2551 |
const Digraph &g; |
2552 | 2552 |
public: |
2553 | 2553 |
ArcLess(const Digraph &_g) : g(_g) {} |
2554 | 2554 |
bool operator()(Arc a,Arc b) const |
2555 | 2555 |
{ |
2556 | 2556 |
return g.target(a)<g.target(b); |
2557 | 2557 |
} |
2558 | 2558 |
}; |
2559 | 2559 |
|
2560 | 2560 |
public: |
2561 | 2561 |
|
2562 | 2562 |
///Constructor |
2563 | 2563 |
|
2564 | 2564 |
///Constructor. |
2565 | 2565 |
/// |
2566 | 2566 |
///It builds up the search database, which remains valid until the digraph |
2567 | 2567 |
///changes. |
2568 | 2568 |
ArcLookUp(const Digraph &g) :_g(g),_head(g),_left(g),_right(g) {refresh();} |
2569 | 2569 |
|
2570 | 2570 |
private: |
2571 | 2571 |
Arc refreshRec(std::vector<Arc> &v,int a,int b) |
2572 | 2572 |
{ |
2573 | 2573 |
int m=(a+b)/2; |
2574 | 2574 |
Arc me=v[m]; |
2575 | 2575 |
_left[me] = a<m?refreshRec(v,a,m-1):INVALID; |
2576 | 2576 |
_right[me] = m<b?refreshRec(v,m+1,b):INVALID; |
2577 | 2577 |
return me; |
2578 | 2578 |
} |
2579 | 2579 |
public: |
2580 | 2580 |
///Refresh the data structure at a node. |
2581 | 2581 |
|
2582 | 2582 |
///Build up the search database of node \c n. |
2583 | 2583 |
/// |
2584 | 2584 |
///It runs in time <em>O(d</em>log<em>d)</em>, where <em>d</em> is |
2585 | 2585 |
///the number of the outgoing arcs of \c n. |
2586 | 2586 |
void refresh(Node n) |
2587 | 2587 |
{ |
2588 | 2588 |
std::vector<Arc> v; |
2589 | 2589 |
for(OutArcIt e(_g,n);e!=INVALID;++e) v.push_back(e); |
2590 | 2590 |
if(v.size()) { |
2591 | 2591 |
std::sort(v.begin(),v.end(),ArcLess(_g)); |
2592 | 2592 |
_head[n]=refreshRec(v,0,v.size()-1); |
2593 | 2593 |
} |
2594 | 2594 |
else _head[n]=INVALID; |
2595 | 2595 |
} |
2596 | 2596 |
///Refresh the full data structure. |
2597 | 2597 |
|
2598 | 2598 |
///Build up the full search database. In fact, it simply calls |
2599 | 2599 |
///\ref refresh(Node) "refresh(n)" for each node \c n. |
2600 | 2600 |
/// |
2601 | 2601 |
///It runs in time <em>O(m</em>log<em>D)</em>, where <em>m</em> is |
2602 | 2602 |
///the number of the arcs of \c n and <em>D</em> is the maximum |
2603 | 2603 |
///out-degree of the digraph. |
2604 | 2604 |
|
2605 | 2605 |
void refresh() |
2606 | 2606 |
{ |
2607 | 2607 |
for(NodeIt n(_g);n!=INVALID;++n) refresh(n); |
2608 | 2608 |
} |
2609 | 2609 |
|
2610 | 2610 |
///Find an arc between two nodes. |
2611 | 2611 |
|
2612 | 2612 |
///Find an arc between two nodes in time <em>O(</em>log<em>d)</em>, where |
2613 | 2613 |
/// <em>d</em> is the number of outgoing arcs of \c s. |
2614 | 2614 |
///\param s The source node |
2615 | 2615 |
///\param t The target node |
2616 | 2616 |
///\return An arc from \c s to \c t if there exists, |
2617 | 2617 |
///\ref INVALID otherwise. |
2618 | 2618 |
/// |
2619 | 2619 |
///\warning If you change the digraph, refresh() must be called before using |
2620 | 2620 |
///this operator. If you change the outgoing arcs of |
2621 | 2621 |
///a single node \c n, then |
2622 | 2622 |
///\ref refresh(Node) "refresh(n)" is enough. |
2623 | 2623 |
/// |
2624 | 2624 |
Arc operator()(Node s, Node t) const |
2625 | 2625 |
{ |
2626 | 2626 |
Arc e; |
2627 | 2627 |
for(e=_head[s]; |
2628 | 2628 |
e!=INVALID&&_g.target(e)!=t; |
2629 | 2629 |
e = t < _g.target(e)?_left[e]:_right[e]) ; |
2630 | 2630 |
return e; |
2631 | 2631 |
} |
2632 | 2632 |
|
2633 | 2633 |
}; |
2634 | 2634 |
|
2635 | 2635 |
///Fast look up of all arcs between given endpoints. |
2636 | 2636 |
|
2637 | 2637 |
///\ingroup gutils |
2638 | 2638 |
///This class is the same as \ref ArcLookUp, with the addition |
2639 | 2639 |
///that it makes it possible to find all arcs between given endpoints. |
2640 | 2640 |
/// |
2641 | 2641 |
///\warning This class is static, so you should refresh() (or at least |
2642 | 2642 |
///refresh(Node)) this data structure |
2643 | 2643 |
///whenever the digraph changes. This is a time consuming (superlinearly |
2644 | 2644 |
///proportional (<em>O(m</em>log<em>m)</em>) to the number of arcs). |
2645 | 2645 |
/// |
2646 | 2646 |
///\tparam G The type of the underlying digraph. |
2647 | 2647 |
/// |
2648 | 2648 |
///\sa DynArcLookUp |
2649 | 2649 |
///\sa ArcLookUp |
2650 | 2650 |
template<class G> |
2651 | 2651 |
class AllArcLookUp : public ArcLookUp<G> |
2652 | 2652 |
{ |
2653 | 2653 |
using ArcLookUp<G>::_g; |
2654 | 2654 |
using ArcLookUp<G>::_right; |
2655 | 2655 |
using ArcLookUp<G>::_left; |
2656 | 2656 |
using ArcLookUp<G>::_head; |
2657 | 2657 |
|
2658 | 2658 |
TEMPLATE_DIGRAPH_TYPEDEFS(G); |
2659 | 2659 |
typedef G Digraph; |
2660 | 2660 |
|
2661 | 2661 |
typename Digraph::template ArcMap<Arc> _next; |
2662 | 2662 |
|
2663 | 2663 |
Arc refreshNext(Arc head,Arc next=INVALID) |
2664 | 2664 |
{ |
2665 | 2665 |
if(head==INVALID) return next; |
2666 | 2666 |
else { |
2667 | 2667 |
next=refreshNext(_right[head],next); |
2668 | 2668 |
// _next[head]=next; |
2669 | 2669 |
_next[head]=( next!=INVALID && _g.target(next)==_g.target(head)) |
2670 | 2670 |
? next : INVALID; |
2671 | 2671 |
return refreshNext(_left[head],head); |
2672 | 2672 |
} |
2673 | 2673 |
} |
2674 | 2674 |
|
2675 | 2675 |
void refreshNext() |
2676 | 2676 |
{ |
2677 | 2677 |
for(NodeIt n(_g);n!=INVALID;++n) refreshNext(_head[n]); |
2678 | 2678 |
} |
2679 | 2679 |
|
2680 | 2680 |
public: |
2681 | 2681 |
///Constructor |
2682 | 2682 |
|
2683 | 2683 |
///Constructor. |
2684 | 2684 |
/// |
2685 | 2685 |
///It builds up the search database, which remains valid until the digraph |
2686 | 2686 |
///changes. |
2687 | 2687 |
AllArcLookUp(const Digraph &g) : ArcLookUp<G>(g), _next(g) {refreshNext();} |
2688 | 2688 |
|
2689 | 2689 |
///Refresh the data structure at a node. |
2690 | 2690 |
|
2691 | 2691 |
///Build up the search database of node \c n. |
2692 | 2692 |
/// |
2693 | 2693 |
///It runs in time <em>O(d</em>log<em>d)</em>, where <em>d</em> is |
2694 | 2694 |
///the number of the outgoing arcs of \c n. |
2695 | 2695 |
|
2696 | 2696 |
void refresh(Node n) |
2697 | 2697 |
{ |
2698 | 2698 |
ArcLookUp<G>::refresh(n); |
2699 | 2699 |
refreshNext(_head[n]); |
2700 | 2700 |
} |
2701 | 2701 |
|
2702 | 2702 |
///Refresh the full data structure. |
2703 | 2703 |
|
2704 | 2704 |
///Build up the full search database. In fact, it simply calls |
2705 | 2705 |
///\ref refresh(Node) "refresh(n)" for each node \c n. |
2706 | 2706 |
/// |
2707 | 2707 |
///It runs in time <em>O(m</em>log<em>D)</em>, where <em>m</em> is |
2708 | 2708 |
///the number of the arcs of \c n and <em>D</em> is the maximum |
2709 | 2709 |
///out-degree of the digraph. |
2710 | 2710 |
|
2711 | 2711 |
void refresh() |
2712 | 2712 |
{ |
2713 | 2713 |
for(NodeIt n(_g);n!=INVALID;++n) refresh(_head[n]); |
2714 | 2714 |
} |
2715 | 2715 |
|
2716 | 2716 |
///Find an arc between two nodes. |
2717 | 2717 |
|
2718 | 2718 |
///Find an arc between two nodes. |
2719 | 2719 |
///\param s The source node |
2720 | 2720 |
///\param t The target node |
2721 | 2721 |
///\param prev The previous arc between \c s and \c t. It it is INVALID or |
2722 | 2722 |
///not given, the operator finds the first appropriate arc. |
2723 | 2723 |
///\return An arc from \c s to \c t after \c prev or |
2724 | 2724 |
///\ref INVALID if there is no more. |
2725 | 2725 |
/// |
2726 | 2726 |
///For example, you can count the number of arcs from \c u to \c v in the |
2727 | 2727 |
///following way. |
2728 | 2728 |
///\code |
2729 | 2729 |
///AllArcLookUp<ListDigraph> ae(g); |
2730 | 2730 |
///... |
2731 | 2731 |
///int n=0; |
2732 | 2732 |
///for(Arc e=ae(u,v);e!=INVALID;e=ae(u,v,e)) n++; |
2733 | 2733 |
///\endcode |
2734 | 2734 |
/// |
2735 | 2735 |
///Finding the first arc take <em>O(</em>log<em>d)</em> time, where |
2736 | 2736 |
/// <em>d</em> is the number of outgoing arcs of \c s. Then, the |
2737 | 2737 |
///consecutive arcs are found in constant time. |
2738 | 2738 |
/// |
2739 | 2739 |
///\warning If you change the digraph, refresh() must be called before using |
2740 | 2740 |
///this operator. If you change the outgoing arcs of |
2741 | 2741 |
///a single node \c n, then |
2742 | 2742 |
///\ref refresh(Node) "refresh(n)" is enough. |
2743 | 2743 |
/// |
2744 | 2744 |
#ifdef DOXYGEN |
2745 | 2745 |
Arc operator()(Node s, Node t, Arc prev=INVALID) const {} |
2746 | 2746 |
#else |
2747 | 2747 |
using ArcLookUp<G>::operator() ; |
2748 | 2748 |
Arc operator()(Node s, Node t, Arc prev) const |
2749 | 2749 |
{ |
2750 | 2750 |
return prev==INVALID?(*this)(s,t):_next[prev]; |
2751 | 2751 |
} |
2752 | 2752 |
#endif |
2753 | 2753 |
|
2754 | 2754 |
}; |
2755 | 2755 |
|
2756 | 2756 |
/// @} |
2757 | 2757 |
|
2758 | 2758 |
} //END OF NAMESPACE LEMON |
2759 | 2759 |
|
2760 | 2760 |
#endif |
Changeset was too big and was cut off... Show full diff
0 comments (0 inline)