0
9
0
... | ... |
@@ -13,14 +13,14 @@ |
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 |
#ifndef LEMON_BITS_PRED_MAP_PATH_H |
|
20 |
#define LEMON_BITS_PRED_MAP_PATH_H |
|
19 |
#ifndef LEMON_BITS_PATH_DUMP_H |
|
20 |
#define LEMON_BITS_PATH_DUMP_H |
|
21 | 21 |
|
22 | 22 |
#include <lemon/core.h> |
23 | 23 |
#include <lemon/concept_check.h> |
24 | 24 |
|
25 | 25 |
namespace lemon { |
26 | 26 |
... | ... |
@@ -13,14 +13,14 @@ |
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 |
#ifndef LEMON_WINDOWS_H |
|
20 |
#define LEMON_WINDOWS_H |
|
19 |
#ifndef LEMON_BITS_WINDOWS_H |
|
20 |
#define LEMON_BITS_WINDOWS_H |
|
21 | 21 |
|
22 | 22 |
#include <string> |
23 | 23 |
|
24 | 24 |
namespace lemon { |
25 | 25 |
namespace bits { |
26 | 26 |
void getWinProcTimes(double &rtime, |
... | ... |
@@ -13,14 +13,14 @@ |
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 |
#ifndef LEMON_CONCEPT_DIGRAPH_H |
|
20 |
#define LEMON_CONCEPT_DIGRAPH_H |
|
19 |
#ifndef LEMON_CONCEPTS_DIGRAPH_H |
|
20 |
#define LEMON_CONCEPTS_DIGRAPH_H |
|
21 | 21 |
|
22 | 22 |
///\ingroup graph_concepts |
23 | 23 |
///\file |
24 | 24 |
///\brief The concept of directed graphs. |
25 | 25 |
|
26 | 26 |
#include <lemon/core.h> |
... | ... |
@@ -481,7 +481,7 @@ |
481 | 481 |
|
482 | 482 |
} //namespace concepts |
483 | 483 |
} //namespace lemon |
484 | 484 |
|
485 | 485 |
|
486 | 486 |
|
487 |
#endif |
|
487 |
#endif |
... | ... |
@@ -17,17 +17,16 @@ |
17 | 17 |
*/ |
18 | 18 |
|
19 | 19 |
///\ingroup graph_concepts |
20 | 20 |
///\file |
21 | 21 |
///\brief The concept of Undirected Graphs. |
22 | 22 |
|
23 |
#ifndef LEMON_CONCEPT_GRAPH_H |
|
24 |
#define LEMON_CONCEPT_GRAPH_H |
|
23 |
#ifndef LEMON_CONCEPTS_GRAPH_H |
|
24 |
#define LEMON_CONCEPTS_GRAPH_H |
|
25 | 25 |
|
26 | 26 |
#include <lemon/concepts/graph_components.h> |
27 |
#include <lemon/concepts/graph.h> |
|
28 | 27 |
#include <lemon/core.h> |
29 | 28 |
|
30 | 29 |
namespace lemon { |
31 | 30 |
namespace concepts { |
32 | 31 |
|
33 | 32 |
/// \ingroup graph_concepts |
... | ... |
@@ -18,14 +18,14 @@ |
18 | 18 |
|
19 | 19 |
///\ingroup graph_concepts |
20 | 20 |
///\file |
21 | 21 |
///\brief The concept of graph components. |
22 | 22 |
|
23 | 23 |
|
24 |
#ifndef LEMON_CONCEPT_GRAPH_COMPONENTS_H |
|
25 |
#define LEMON_CONCEPT_GRAPH_COMPONENTS_H |
|
24 |
#ifndef LEMON_CONCEPTS_GRAPH_COMPONENTS_H |
|
25 |
#define LEMON_CONCEPTS_GRAPH_COMPONENTS_H |
|
26 | 26 |
|
27 | 27 |
#include <lemon/core.h> |
28 | 28 |
#include <lemon/concepts/maps.h> |
29 | 29 |
|
30 | 30 |
#include <lemon/bits/alteration_notifier.h> |
31 | 31 |
... | ... |
@@ -17,14 +17,14 @@ |
17 | 17 |
*/ |
18 | 18 |
|
19 | 19 |
///\ingroup concept |
20 | 20 |
///\file |
21 | 21 |
///\brief The concept of heaps. |
22 | 22 |
|
23 |
#ifndef LEMON_CONCEPT_HEAP_H |
|
24 |
#define LEMON_CONCEPT_HEAP_H |
|
23 |
#ifndef LEMON_CONCEPTS_HEAP_H |
|
24 |
#define LEMON_CONCEPTS_HEAP_H |
|
25 | 25 |
|
26 | 26 |
#include <lemon/core.h> |
27 | 27 |
#include <lemon/concept_check.h> |
28 | 28 |
|
29 | 29 |
namespace lemon { |
30 | 30 |
|
... | ... |
@@ -240,7 +240,7 @@ |
240 | 240 |
}; |
241 | 241 |
}; |
242 | 242 |
|
243 | 243 |
/// @} |
244 | 244 |
} // namespace lemon |
245 | 245 |
} |
246 |
#endif |
|
246 |
#endif |
... | ... |
@@ -13,14 +13,14 @@ |
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 |
#ifndef LEMON_CONCEPT_MAPS_H |
|
20 |
#define LEMON_CONCEPT_MAPS_H |
|
19 |
#ifndef LEMON_CONCEPTS_MAPS_H |
|
20 |
#define LEMON_CONCEPTS_MAPS_H |
|
21 | 21 |
|
22 | 22 |
#include <lemon/core.h> |
23 | 23 |
#include <lemon/concept_check.h> |
24 | 24 |
|
25 | 25 |
///\ingroup map_concepts |
26 | 26 |
///\file |
... | ... |
@@ -210,7 +210,7 @@ |
210 | 210 |
// @} |
211 | 211 |
|
212 | 212 |
} //namespace concepts |
213 | 213 |
|
214 | 214 |
} //namespace lemon |
215 | 215 |
|
216 |
#endif |
|
216 |
#endif |
... | ... |
@@ -18,14 +18,14 @@ |
18 | 18 |
|
19 | 19 |
///\ingroup concept |
20 | 20 |
///\file |
21 | 21 |
///\brief Classes for representing paths in digraphs. |
22 | 22 |
/// |
23 | 23 |
|
24 |
#ifndef LEMON_CONCEPT_PATH_H |
|
25 |
#define LEMON_CONCEPT_PATH_H |
|
24 |
#ifndef LEMON_CONCEPTS_PATH_H |
|
25 |
#define LEMON_CONCEPTS_PATH_H |
|
26 | 26 |
|
27 | 27 |
#include <lemon/core.h> |
28 | 28 |
#include <lemon/concept_check.h> |
29 | 29 |
|
30 | 30 |
namespace lemon { |
31 | 31 |
namespace concepts { |
... | ... |
@@ -302,7 +302,7 @@ |
302 | 302 |
|
303 | 303 |
///@} |
304 | 304 |
} |
305 | 305 |
|
306 | 306 |
} // namespace lemon |
307 | 307 |
|
308 |
#endif |
|
308 |
#endif |
... | ... |
@@ -13,14 +13,14 @@ |
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 |
#ifndef LEMON_LP_SKELETON |
|
20 |
#define LEMON_LP_SKELETON |
|
19 |
#ifndef LEMON_LP_SKELETON_H |
|
20 |
#define LEMON_LP_SKELETON_H |
|
21 | 21 |
|
22 | 22 |
#include <lemon/lp_base.h> |
23 | 23 |
|
24 | 24 |
///\file |
25 | 25 |
///\brief A skeleton file to implement LP solver interfaces |
26 | 26 |
namespace lemon { |
... | ... |
@@ -223,7 +223,7 @@ |
223 | 223 |
virtual const char* _solverName() const; |
224 | 224 |
|
225 | 225 |
}; |
226 | 226 |
|
227 | 227 |
} //namespace lemon |
228 | 228 |
|
229 |
#endif |
|
229 |
#endif |
0 comments (0 inline)