1 /* -*- C++ -*- |
1 /* -*- C++ -*- |
2 * src/hugo/graph_wrapper.h - Part of HUGOlib, a generic C++ optimization library |
2 * src/lemon/graph_wrapper.h - Part of LEMON, a generic C++ optimization library |
3 * |
3 * |
4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
5 * (Egervary Combinatorial Optimization Research Group, EGRES). |
5 * (Egervary Combinatorial Optimization Research Group, EGRES). |
6 * |
6 * |
7 * Permission to use, modify and distribute this software is granted |
7 * Permission to use, modify and distribute this software is granted |
12 * express or implied, and with no claim as to its suitability for any |
12 * express or implied, and with no claim as to its suitability for any |
13 * purpose. |
13 * purpose. |
14 * |
14 * |
15 */ |
15 */ |
16 |
16 |
17 #ifndef HUGO_GRAPH_WRAPPER_H |
17 #ifndef LEMON_GRAPH_WRAPPER_H |
18 #define HUGO_GRAPH_WRAPPER_H |
18 #define LEMON_GRAPH_WRAPPER_H |
19 |
19 |
20 ///\ingroup gwrappers |
20 ///\ingroup gwrappers |
21 ///\file |
21 ///\file |
22 ///\brief Several graph wrappers. |
22 ///\brief Several graph wrappers. |
23 /// |
23 /// |
24 ///This file contains several useful graph wrapper functions. |
24 ///This file contains several useful graph wrapper functions. |
25 /// |
25 /// |
26 ///\author Marton Makai |
26 ///\author Marton Makai |
27 |
27 |
28 #include <hugo/invalid.h> |
28 #include <lemon/invalid.h> |
29 #include <hugo/maps.h> |
29 #include <lemon/maps.h> |
30 #include <hugo/map_defines.h> |
30 #include <lemon/map_defines.h> |
31 #include <iostream> |
31 #include <iostream> |
32 |
32 |
33 namespace hugo { |
33 namespace lemon { |
34 |
34 |
35 // Graph wrappers |
35 // Graph wrappers |
36 |
36 |
37 /// \addtogroup gwrappers |
37 /// \addtogroup gwrappers |
38 /// A main parts of HUGOlib are the different graph structures, |
38 /// A main parts of LEMON are the different graph structures, |
39 /// generic graph algorithms, graph concepts which couple these, and |
39 /// generic graph algorithms, graph concepts which couple these, and |
40 /// graph wrappers. While the previous ones are more or less clear, the |
40 /// graph wrappers. While the previous ones are more or less clear, the |
41 /// latter notion needs further explanation. |
41 /// latter notion needs further explanation. |
42 /// Graph wrappers are graph classes which serve for considering graph |
42 /// Graph wrappers are graph classes which serve for considering graph |
43 /// structures in different ways. A short example makes the notion much |
43 /// structures in different ways. A short example makes the notion much |