Changeset 921:818510fa3d99 in lemon-0.x for src/lemon
- Timestamp:
- 09/29/04 17:30:04 (20 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1232
- Location:
- src/lemon
- Files:
-
- 1 added
- 37 moved
-
Makefile.am (moved) (moved from src/hugo/Makefile.am)
-
array_map.h (moved) (moved from src/hugo/array_map.h) (4 diffs)
-
attic/debug.h (moved) (moved from src/hugo/attic/debug.h) (3 diffs)
-
attic/error.h (moved) (moved from src/hugo/attic/error.h) (4 diffs)
-
attic/tight_edge_filter_map.h (moved) (moved from src/hugo/attic/tight_edge_filter_map.h) (4 diffs)
-
bfs.h (moved) (moved from src/hugo/bfs.h) (4 diffs)
-
bin_heap.h (moved) (moved from src/hugo/bin_heap.h) (4 diffs)
-
default_map.h (moved) (moved from src/hugo/default_map.h) (3 diffs)
-
dfs.h (moved) (moved from src/hugo/dfs.h) (4 diffs)
-
dijkstra.h (moved) (moved from src/hugo/dijkstra.h) (4 diffs)
-
dimacs.h (moved) (moved from src/hugo/dimacs.h) (4 diffs)
-
extended_pair.h (moved) (moved from src/hugo/extended_pair.h) (2 diffs)
-
fib_heap.h (moved) (moved from src/hugo/fib_heap.h) (4 diffs)
-
full_graph.h (moved) (moved from src/hugo/full_graph.h) (4 diffs)
-
graph_wrapper.h (moved) (moved from src/hugo/graph_wrapper.h) (4 diffs)
-
invalid.h (moved) (moved from src/hugo/invalid.h) (3 diffs)
-
kruskal.h (moved) (moved from src/hugo/kruskal.h) (4 diffs)
-
list_graph.h (moved) (moved from src/hugo/list_graph.h) (5 diffs)
-
map_bits.h (moved) (moved from src/hugo/map_bits.h) (3 diffs)
-
map_defines.h (moved) (moved from src/hugo/map_defines.h) (2 diffs)
-
map_iterator.h (moved) (moved from src/hugo/map_iterator.h) (3 diffs)
-
map_registry.h (moved) (moved from src/hugo/map_registry.h) (3 diffs)
-
maps.h (moved) (moved from src/hugo/maps.h) (4 diffs)
-
min_cost_flow.h (moved) (moved from src/hugo/min_cost_flow.h) (5 diffs)
-
path.h (moved) (moved from src/hugo/path.h) (6 diffs)
-
preflow.h (moved) (moved from src/hugo/preflow.h) (5 diffs)
-
skeletons/graph.h (moved) (moved from src/hugo/skeletons/graph.h) (4 diffs)
-
skeletons/maps.h (moved) (moved from src/hugo/skeletons/maps.h) (4 diffs)
-
skeletons/path.h (moved) (moved from src/hugo/skeletons/path.h) (3 diffs)
-
smart_graph.h (moved) (moved from src/hugo/smart_graph.h) (4 diffs)
-
suurballe.h (moved) (moved from src/hugo/suurballe.h) (6 diffs)
-
sym_map.h (moved) (moved from src/hugo/sym_map.h) (3 diffs)
-
template.h (moved) (moved from src/hugo/template.h) (2 diffs)
-
tight_edge_filter_map.h (added)
-
time_measure.h (moved) (moved from src/hugo/time_measure.h) (5 diffs)
-
unionfind.h (moved) (moved from src/hugo/unionfind.h) (4 diffs)
-
vector_map.h (moved) (moved from src/hugo/vector_map.h) (3 diffs)
-
xy.h (moved) (moved from src/hugo/xy.h) (4 diffs)
Legend:
- Unmodified
- Added
- Removed
-
src/lemon/array_map.h
r906 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/array_map.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/array_map.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_ARRAY_MAP_H18 #define HUGO_ARRAY_MAP_H17 #ifndef LEMON_ARRAY_MAP_H 18 #define LEMON_ARRAY_MAP_H 19 19 20 20 #include <memory> 21 21 22 #include < hugo/map_iterator.h>23 #include < hugo/map_bits.h>22 #include <lemon/map_iterator.h> 23 #include <lemon/map_bits.h> 24 24 25 25 ///\ingroup graphmaps … … 28 28 ///their elements dynamically. 29 29 30 namespace hugo{30 namespace lemon { 31 31 32 32 … … 347 347 } 348 348 349 #endif // HUGO_ARRAY_MAP_H349 #endif //LEMON_ARRAY_MAP_H -
src/lemon/attic/debug.h
r907 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/debug.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/debug.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_DEBUG_H18 #define HUGO_DEBUG_H17 #ifndef LEMON_DEBUG_H 18 #define LEMON_DEBUG_H 19 19 20 20 //! \file 21 21 //! \brief Basic definitions for debug control. 22 22 23 namespace hugo{23 namespace lemon { 24 24 25 25 //! Debug mode for testing/debugging … … 68 68 69 69 } 70 #endif // HUGO_DEBUG_H70 #endif // LEMON_DEBUG_H -
src/lemon/attic/error.h
r907 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/error.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/error.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_ERROR_H18 #define HUGO_ERROR_H17 #ifndef LEMON_ERROR_H 18 #define LEMON_ERROR_H 19 19 20 20 //! \ingroup misc … … 27 27 28 28 29 namespace hugo{29 namespace lemon { 30 30 31 31 /** … … 75 75 76 76 # define FIXME(msg) \ 77 do { throw :: hugo::Exception() << "FIXME: " msg " (in: " \77 do { throw ::lemon::Exception() << "FIXME: " msg " (in: " \ 78 78 __FILE__ ", " << __LINE__ << ")"; \ 79 79 } while(false) 80 80 81 81 } 82 #endif // HUGO_ERROR_H82 #endif // LEMON_ERROR_H -
src/lemon/attic/tight_edge_filter_map.h
r919 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/tight_edge_filter_map.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/tight_edge_filter_map.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_TIGHT_EDGE_FILTER_MAP_H18 #define HUGO_TIGHT_EDGE_FILTER_MAP_H17 #ifndef LEMON_TIGHT_EDGE_FILTER_MAP_H 18 #define LEMON_TIGHT_EDGE_FILTER_MAP_H 19 19 20 #include < hugo/maps.h>20 #include <lemon/maps.h> 21 21 22 22 // /// \file … … 24 24 // /// \ingroup galgs 25 25 26 namespace hugo{26 namespace lemon { 27 27 28 28 /// \brief A map for filtering the edge-set to those edges … … 57 57 }; 58 58 59 } //namespace hugo59 } //namespace lemon 60 60 61 #endif // HUGO_TIGHT_EDGE_FILTER_MAP_H61 #endif //LEMON_TIGHT_EDGE_FILTER_MAP_H 62 62 63 63 -
src/lemon/bfs.h
r911 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/bfs.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/bfs.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_BFS_H18 #define HUGO_BFS_H17 #ifndef LEMON_BFS_H 18 #define LEMON_BFS_H 19 19 20 20 ///\ingroup flowalgs … … 24 24 ///\todo Revise Manual. 25 25 26 #include < hugo/bin_heap.h>27 #include < hugo/invalid.h>28 29 namespace hugo{26 #include <lemon/bin_heap.h> 27 #include <lemon/invalid.h> 28 29 namespace lemon { 30 30 31 31 /// \addtogroup flowalgs … … 280 280 /// @} 281 281 282 } //END OF NAMESPACE HUGO282 } //END OF NAMESPACE LEMON 283 283 284 284 #endif -
src/lemon/bin_heap.h
r906 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/bin_heap.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/bin_heap.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_BIN_HEAP_H18 #define HUGO_BIN_HEAP_H17 #ifndef LEMON_BIN_HEAP_H 18 #define LEMON_BIN_HEAP_H 19 19 20 20 ///\ingroup auxdat … … 27 27 #include <functional> 28 28 29 namespace hugo{29 namespace lemon { 30 30 31 31 /// \addtogroup auxdat … … 199 199 ///@} 200 200 201 } // namespace hugo202 203 #endif // HUGO_BIN_HEAP_H201 } // namespace lemon 202 203 #endif // LEMON_BIN_HEAP_H -
src/lemon/default_map.h
r919 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/default_map.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/default_map.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_DEFAULT_MAP_H18 #define HUGO_DEFAULT_MAP_H17 #ifndef LEMON_DEFAULT_MAP_H 18 #define LEMON_DEFAULT_MAP_H 19 19 20 20 21 #include < hugo/array_map.h>22 #include < hugo/vector_map.h>21 #include <lemon/array_map.h> 22 #include <lemon/vector_map.h> 23 23 24 24 ///\ingroup graphmaps … … 27 27 ///their elements dynamically. 28 28 29 namespace hugo{29 namespace lemon { 30 30 31 31 /// \addtogroup graphmaps -
src/lemon/dfs.h
r911 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/dfs.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/dfs.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_DFS_H18 #define HUGO_DFS_H17 #ifndef LEMON_DFS_H 18 #define LEMON_DFS_H 19 19 20 20 ///\ingroup flowalgs … … 24 24 ///\todo Revise Manual. 25 25 26 #include < hugo/bin_heap.h>27 #include < hugo/invalid.h>28 29 namespace hugo{26 #include <lemon/bin_heap.h> 27 #include <lemon/invalid.h> 28 29 namespace lemon { 30 30 31 31 /// \addtogroup flowalgs … … 284 284 /// @} 285 285 286 } //END OF NAMESPACE HUGO286 } //END OF NAMESPACE LEMON 287 287 288 288 #endif -
src/lemon/dijkstra.h
r911 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/dijkstra.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/dijkstra.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_DIJKSTRA_H18 #define HUGO_DIJKSTRA_H17 #ifndef LEMON_DIJKSTRA_H 18 #define LEMON_DIJKSTRA_H 19 19 20 20 ///\ingroup flowalgs … … 22 22 ///\brief Dijkstra algorithm. 23 23 24 #include < hugo/bin_heap.h>25 #include < hugo/invalid.h>26 27 namespace hugo{24 #include <lemon/bin_heap.h> 25 #include <lemon/invalid.h> 26 27 namespace lemon { 28 28 29 29 /// \addtogroup flowalgs … … 338 338 /// @} 339 339 340 } //END OF NAMESPACE HUGO340 } //END OF NAMESPACE LEMON 341 341 342 342 #endif -
src/lemon/dimacs.h
r906 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/dimacs.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/dimacs.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_DIMACS_H18 #define HUGO_DIMACS_H17 #ifndef LEMON_DIMACS_H 18 #define LEMON_DIMACS_H 19 19 20 20 #include <iostream> 21 21 #include <string> 22 22 #include <vector> 23 #include < hugo/maps.h>23 #include <lemon/maps.h> 24 24 25 25 /// \ingroup misc … … 27 27 /// \brief Dimacs file format reader. 28 28 29 namespace hugo{29 namespace lemon { 30 30 31 31 … … 203 203 /// @} 204 204 205 } //namespace hugo206 207 #endif // HUGO_DIMACS_H205 } //namespace lemon 206 207 #endif //LEMON_DIMACS_H -
src/lemon/extended_pair.h
r906 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/extended_pair.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/extended_pair.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_EXTENDED_PAIR_H18 #define HUGO_EXTENDED_PAIR_H17 #ifndef LEMON_EXTENDED_PAIR_H 18 #define LEMON_EXTENDED_PAIR_H 19 19 20 20 template <typename T1, typename A1, typename T2, typename A2> -
src/lemon/fib_heap.h
r911 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/fib_heap.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/fib_heap.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_FIB_HEAP_H18 #define HUGO_FIB_HEAP_H17 #ifndef LEMON_FIB_HEAP_H 18 #define LEMON_FIB_HEAP_H 19 19 20 20 ///\file … … 26 26 #include <math.h> 27 27 28 namespace hugo{28 namespace lemon { 29 29 30 30 /// \addtogroup auxdat … … 505 505 ///@} 506 506 507 } //namespace hugo508 509 #endif // HUGO_FIB_HEAP_H510 507 } //namespace lemon 508 509 #endif //LEMON_FIB_HEAP_H 510 -
src/lemon/full_graph.h
r906 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/full_graph.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/full_graph.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_FULL_GRAPH_H18 #define HUGO_FULL_GRAPH_H17 #ifndef LEMON_FULL_GRAPH_H 18 #define LEMON_FULL_GRAPH_H 19 19 20 20 ///\ingroup graphs … … 25 25 #include <climits> 26 26 27 #include < hugo/invalid.h>28 29 #include < hugo/map_registry.h>30 #include < hugo/array_map.h>31 32 #include < hugo/map_defines.h>33 34 namespace hugo{27 #include <lemon/invalid.h> 28 29 #include <lemon/map_registry.h> 30 #include <lemon/array_map.h> 31 32 #include <lemon/map_defines.h> 33 34 namespace lemon { 35 35 36 36 /// \addtogroup graphs … … 241 241 /// @} 242 242 243 } //namespace hugo244 245 246 247 248 #endif // HUGO_FULL_GRAPH_H243 } //namespace lemon 244 245 246 247 248 #endif //LEMON_FULL_GRAPH_H -
src/lemon/graph_wrapper.h
r911 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/graph_wrapper.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/graph_wrapper.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_GRAPH_WRAPPER_H18 #define HUGO_GRAPH_WRAPPER_H17 #ifndef LEMON_GRAPH_WRAPPER_H 18 #define LEMON_GRAPH_WRAPPER_H 19 19 20 20 ///\ingroup gwrappers … … 26 26 ///\author Marton Makai 27 27 28 #include < hugo/invalid.h>29 #include < hugo/maps.h>30 #include < hugo/map_defines.h>28 #include <lemon/invalid.h> 29 #include <lemon/maps.h> 30 #include <lemon/map_defines.h> 31 31 #include <iostream> 32 32 33 namespace hugo{33 namespace lemon { 34 34 35 35 // Graph wrappers 36 36 37 37 /// \addtogroup gwrappers 38 /// A main parts of HUGOlibare the different graph structures,38 /// A main parts of LEMON are the different graph structures, 39 39 /// generic graph algorithms, graph concepts which couple these, and 40 40 /// graph wrappers. While the previous ones are more or less clear, the … … 1222 1222 ///@} 1223 1223 1224 } //namespace hugo1225 1226 #endif // HUGO_GRAPH_WRAPPER_H1227 1224 } //namespace lemon 1225 1226 #endif //LEMON_GRAPH_WRAPPER_H 1227 -
src/lemon/invalid.h
r906 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/invalid.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/invalid.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_INVALID_H18 #define HUGO_INVALID_H17 #ifndef LEMON_INVALID_H 18 #define LEMON_INVALID_H 19 19 20 20 ///\file 21 21 ///\brief Definition of INVALID. 22 22 23 namespace hugo{23 namespace lemon { 24 24 25 25 /// Dummy type to make it easier to make invalid iterators. … … 47 47 const Invalid INVALID = Invalid(); 48 48 49 } //namespace hugo49 } //namespace lemon 50 50 51 51 #endif -
src/lemon/kruskal.h
r906 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/kruskal.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/kruskal.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_KRUSKAL_H18 #define HUGO_KRUSKAL_H17 #ifndef LEMON_KRUSKAL_H 18 #define LEMON_KRUSKAL_H 19 19 20 20 #include <algorithm> 21 #include < hugo/unionfind.h>21 #include <lemon/unionfind.h> 22 22 23 23 /** … … 37 37 ///Kruskal's algorithm to compute a minimum cost tree. 38 38 39 namespace hugo{39 namespace lemon { 40 40 41 41 /// \addtogroup spantree … … 344 344 /// @} 345 345 346 } //namespace hugo347 348 #endif // HUGO_KRUSKAL_H346 } //namespace lemon 347 348 #endif //LEMON_KRUSKAL_H -
src/lemon/list_graph.h
r919 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/list_graph.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/list_graph.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_LIST_GRAPH_H18 #define HUGO_LIST_GRAPH_H17 #ifndef LEMON_LIST_GRAPH_H 18 #define LEMON_LIST_GRAPH_H 19 19 20 20 ///\ingroup graphs … … 25 25 #include <climits> 26 26 27 #include < hugo/invalid.h>28 29 #include < hugo/map_registry.h>30 #include < hugo/array_map.h>31 32 #include < hugo/sym_map.h>33 34 #include < hugo/map_defines.h>35 36 37 namespace hugo{27 #include <lemon/invalid.h> 28 29 #include <lemon/map_registry.h> 30 #include <lemon/array_map.h> 31 32 #include <lemon/sym_map.h> 33 34 #include <lemon/map_defines.h> 35 36 37 namespace lemon { 38 38 39 39 /// \addtogroup graphs … … 424 424 ///of oppositely directed edges. 425 425 ///There is a new edge map type called 426 ///\ref hugo::SymListGraph::SymEdgeMap "SymEdgeMap"426 ///\ref lemon::SymListGraph::SymEdgeMap "SymEdgeMap" 427 427 ///that complements this 428 428 ///feature by 429 429 ///storing shared values for the edge pairs. The usual 430 ///\ref hugo::skeleton::StaticGraph::EdgeMap "EdgeMap"430 ///\ref lemon::skeleton::StaticGraph::EdgeMap "EdgeMap" 431 431 ///can be used 432 432 ///as well. 433 433 /// 434 434 ///The oppositely directed edge can also be obtained easily 435 ///using \ref hugo::SymListGraph::opposite() "opposite()" member function.435 ///using \ref lemon::SymListGraph::opposite() "opposite()" member function. 436 436 /// 437 437 ///Here erase(Edge) deletes a pair of edges. … … 1102 1102 /// @} 1103 1103 1104 } //namespace hugo1105 1106 #endif // HUGO_LIST_GRAPH_H1104 } //namespace lemon 1105 1106 #endif //LEMON_LIST_GRAPH_H -
src/lemon/map_bits.h
r919 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/map_bits.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/map_bits.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_MAP_BITS_H18 #define HUGO_MAP_BITS_H17 #ifndef LEMON_MAP_BITS_H 18 #define LEMON_MAP_BITS_H 19 19 20 20 ///\ingroup graphmaps … … 22 22 ///\brief Some utils to help implement maps. 23 23 24 namespace hugo{24 namespace lemon { 25 25 26 26 -
src/lemon/map_defines.h
r919 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/map_defines.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/map_defines.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_MAP_DEFINES_H18 #define HUGO_MAP_DEFINES_H17 #ifndef LEMON_MAP_DEFINES_H 18 #define LEMON_MAP_DEFINES_H 19 19 20 20 ///\ingroup graphmaps -
src/lemon/map_iterator.h
r906 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/map_iterator.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/map_iterator.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_MAP_ITERATOR_H18 #define HUGO_MAP_ITERATOR_H17 #ifndef LEMON_MAP_ITERATOR_H 18 #define LEMON_MAP_ITERATOR_H 19 19 20 20 #include <iterator> 21 21 22 #include < hugo/extended_pair.h>22 #include <lemon/extended_pair.h> 23 23 24 24 ///\ingroup graphmaps … … 26 26 ///\brief Iterators on the maps. 27 27 28 namespace hugo{28 namespace lemon { 29 29 30 30 /// \addtogroup graphmaps -
src/lemon/map_registry.h
r919 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/map_registry.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/map_registry.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_MAP_REGISTRY_H18 #define HUGO_MAP_REGISTRY_H17 #ifndef LEMON_MAP_REGISTRY_H 18 #define LEMON_MAP_REGISTRY_H 19 19 20 20 #include <vector> … … 26 26 using namespace std; 27 27 28 namespace hugo{28 namespace lemon { 29 29 30 30 /// \addtogroup graphmapfactory -
src/lemon/maps.h
r911 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/maps.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/maps.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_MAPS_H18 #define HUGO_MAPS_H17 #ifndef LEMON_MAPS_H 18 #define LEMON_MAPS_H 19 19 20 20 ///\file … … 26 26 #include <map> 27 27 28 namespace hugo{28 namespace lemon { 29 29 30 30 /// Base class of maps. … … 174 174 175 175 } 176 #endif // HUGO_MAPS_H176 #endif // LEMON_MAPS_H -
src/lemon/min_cost_flow.h
r910 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/min_cost_flow.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/min_cost_flow.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_MIN_COST_FLOW_H18 #define HUGO_MIN_COST_FLOW_H17 #ifndef LEMON_MIN_COST_FLOW_H 18 #define LEMON_MIN_COST_FLOW_H 19 19 20 20 ///\ingroup flowalgs … … 23 23 24 24 25 #include < hugo/dijkstra.h>26 #include < hugo/graph_wrapper.h>27 #include < hugo/maps.h>25 #include <lemon/dijkstra.h> 26 #include <lemon/graph_wrapper.h> 27 #include <lemon/maps.h> 28 28 #include <vector> 29 29 30 namespace hugo{30 namespace lemon { 31 31 32 32 /// \addtogroup flowalgs … … 37 37 /// 38 38 /// 39 /// The class \ref hugo::MinCostFlow "MinCostFlow" implements39 /// The class \ref lemon::MinCostFlow "MinCostFlow" implements 40 40 /// an algorithm for finding a flow of value \c k 41 41 /// having minimal total cost … … 252 252 ///@} 253 253 254 } //namespace hugo255 256 #endif // HUGO_MIN_COST_FLOW_H254 } //namespace lemon 255 256 #endif //LEMON_MIN_COST_FLOW_H -
src/lemon/path.h
r906 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/path.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/path.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 18 18 @defgroup paths Path Structures 19 19 @ingroup datas 20 \brief Path structures implemented in Hugo.21 22 Hugolibprovides flexible data structures20 \brief Path structures implemented in LEMON. 21 22 LEMON provides flexible data structures 23 23 to work with paths. 24 24 … … 27 27 algorithm to store its result in any kind of path structure. 28 28 29 \sa hugo::skeleton::Path29 \sa lemon::skeleton::Path 30 30 31 31 */ … … 35 35 ///\brief Classes for representing paths in graphs. 36 36 37 #ifndef HUGO_PATH_H38 #define HUGO_PATH_H37 #ifndef LEMON_PATH_H 38 #define LEMON_PATH_H 39 39 40 40 #include <deque> … … 42 42 #include <algorithm> 43 43 44 #include < hugo/invalid.h>45 46 namespace hugo{44 #include <lemon/invalid.h> 45 46 namespace lemon { 47 47 48 48 /// \addtogroup paths … … 705 705 ///@} 706 706 707 } // namespace hugo708 709 #endif // HUGO_PATH_H707 } // namespace lemon 708 709 #endif // LEMON_PATH_H -
src/lemon/preflow.h
r920 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/preflow.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/preflow.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_PREFLOW_H18 #define HUGO_PREFLOW_H17 #ifndef LEMON_PREFLOW_H 18 #define LEMON_PREFLOW_H 19 19 20 20 #include <vector> 21 21 #include <queue> 22 22 23 #include < hugo/invalid.h>24 #include < hugo/maps.h>23 #include <lemon/invalid.h> 24 #include <lemon/maps.h> 25 25 26 26 /// \file … … 28 28 /// Implementation of the preflow algorithm. 29 29 30 namespace hugo{30 namespace lemon { 31 31 32 32 /// \addtogroup flowalgs … … 45 45 ///setFlow. 46 46 /// 47 ///After running \ref hugo::Preflow::phase1() "phase1()"48 ///or \ref hugo::Preflow::run() "run()", the maximal flow47 ///After running \ref lemon::Preflow::phase1() "phase1()" 48 ///or \ref lemon::Preflow::run() "run()", the maximal flow 49 49 ///value can be obtained by calling \ref flowValue(). The minimum 50 50 ///value cut can be written into a <tt>bool</tt> node map by … … 811 811 812 812 }; 813 } //namespace hugo814 815 #endif // HUGO_PREFLOW_H816 817 818 819 813 } //namespace lemon 814 815 #endif //LEMON_PREFLOW_H 816 817 818 819 -
src/lemon/skeletons/graph.h
r911 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/skeletons/graph.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/skeletons/graph.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_SKELETON_GRAPH_H18 #define HUGO_SKELETON_GRAPH_H17 #ifndef LEMON_SKELETON_GRAPH_H 18 #define LEMON_SKELETON_GRAPH_H 19 19 20 20 ///\ingroup skeletons … … 22 22 ///\brief Declaration of Graph. 23 23 24 #include < hugo/invalid.h>25 #include < hugo/skeletons/maps.h>26 27 namespace hugo{24 #include <lemon/invalid.h> 25 #include <lemon/skeletons/maps.h> 26 27 namespace lemon { 28 28 namespace skeleton { 29 29 … … 504 504 // @} 505 505 } //namespace skeleton 506 } //namespace hugo507 508 509 510 #endif // HUGO_SKELETON_GRAPH_H506 } //namespace lemon 507 508 509 510 #endif // LEMON_SKELETON_GRAPH_H -
src/lemon/skeletons/maps.h
r906 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/skeletons/maps.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/skeletons/maps.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_MAPSKELETON_H18 #define HUGO_MAPSKELETON_H17 #ifndef LEMON_MAPSKELETON_H 18 #define LEMON_MAPSKELETON_H 19 19 20 20 ///\ingroup skeletons … … 22 22 ///\brief Map concepts checking classes for testing and documenting. 23 23 24 namespace hugo{24 namespace lemon { 25 25 26 26 namespace skeleton { … … 117 117 118 118 } //namespace skeleton 119 } //namespace hugo120 #endif // HUGO_MAPSKELETON_H119 } //namespace lemon 120 #endif // LEMON_MAPSKELETON_H -
src/lemon/skeletons/path.h
r906 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/skeletons/path.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/skeletons/path.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 19 19 ///\brief Classes for representing paths in graphs. 20 20 21 #ifndef HUGO_SKELETON_PATH_H22 #define HUGO_SKELETON_PATH_H23 24 #include < hugo/invalid.h>25 26 namespace hugo{21 #ifndef LEMON_SKELETON_PATH_H 22 #define LEMON_SKELETON_PATH_H 23 24 #include <lemon/invalid.h> 25 26 namespace lemon { 27 27 namespace skeleton { 28 28 /// \addtogroup skeletons … … 232 232 } 233 233 234 } // namespace hugo235 236 #endif // HUGO_SKELETON_PATH_H234 } // namespace lemon 235 236 #endif // LEMON_SKELETON_PATH_H -
src/lemon/smart_graph.h
r919 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/smart_graph.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/smart_graph.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_SMART_GRAPH_H18 #define HUGO_SMART_GRAPH_H17 #ifndef LEMON_SMART_GRAPH_H 18 #define LEMON_SMART_GRAPH_H 19 19 20 20 ///\ingroup graphs … … 25 25 #include <climits> 26 26 27 #include < hugo/invalid.h>28 29 #include < hugo/array_map.h>30 #include < hugo/sym_map.h>31 32 #include < hugo/map_registry.h>33 34 #include < hugo/map_defines.h>35 36 namespace hugo{27 #include <lemon/invalid.h> 28 29 #include <lemon/array_map.h> 30 #include <lemon/sym_map.h> 31 32 #include <lemon/map_registry.h> 33 34 #include <lemon/map_defines.h> 35 36 namespace lemon { 37 37 38 38 /// \addtogroup graphs … … 357 357 358 358 /// @} 359 } //namespace hugo360 361 362 363 364 #endif // HUGO_SMART_GRAPH_H359 } //namespace lemon 360 361 362 363 364 #endif //LEMON_SMART_GRAPH_H -
src/lemon/suurballe.h
r906 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/suurballe.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/suurballe.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_SUURBALLE_H18 #define HUGO_SUURBALLE_H17 #ifndef LEMON_SUURBALLE_H 18 #define LEMON_SUURBALLE_H 19 19 20 20 ///\ingroup flowalgs … … 23 23 24 24 25 #include < hugo/maps.h>25 #include <lemon/maps.h> 26 26 #include <vector> 27 #include < hugo/min_cost_flow.h>28 29 namespace hugo{27 #include <lemon/min_cost_flow.h> 28 29 namespace lemon { 30 30 31 31 /// \addtogroup flowalgs … … 35 35 /// of minimal total length 36 36 /// 37 /// The class \ref hugo::Suurballe implements37 /// The class \ref lemon::Suurballe implements 38 38 /// an algorithm for finding k edge-disjoint paths 39 39 /// from a given source node to a given target node in an … … 188 188 ///then the result here will be an empty path (\c j can be 0 as well). 189 189 /// 190 ///\param Path The type of the path structure to put the result to (must meet hugopath concept).190 ///\param Path The type of the path structure to put the result to (must meet lemon path concept). 191 191 ///\param p The path to put the result to 192 192 ///\param j Which path you want to get from the found paths (in a real application you would get the found paths iteratively) … … 211 211 ///@} 212 212 213 } //namespace hugo214 215 #endif // HUGO_SUURBALLE_H213 } //namespace lemon 214 215 #endif //LEMON_SUURBALLE_H -
src/lemon/sym_map.h
r919 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/sym_map.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/sym_map.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_SYM_MAP_H18 #define HUGO_SYM_MAP_H17 #ifndef LEMON_SYM_MAP_H 18 #define LEMON_SYM_MAP_H 19 19 20 20 ///\ingroup graphmaps … … 23 23 ///their elements dynamically. 24 24 25 namespace hugo{25 namespace lemon { 26 26 27 27 /// \addtogroup graphmaps -
src/lemon/template.h
r906 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/template.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/template.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_TEMPLATE_H18 #define HUGO_TEMPLATE_H17 #ifndef LEMON_TEMPLATE_H 18 #define LEMON_TEMPLATE_H 19 19 20 #endif // HUGO_TEMPLATE_H20 #endif // LEMON_TEMPLATE_H -
src/lemon/time_measure.h
r906 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/time_measure.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/time_measure.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_TIME_MEASURE_H18 #define HUGO_TIME_MEASURE_H17 #ifndef LEMON_TIME_MEASURE_H 18 #define LEMON_TIME_MEASURE_H 19 19 20 20 ///\ingroup misc … … 28 28 #include <unistd.h> 29 29 30 namespace hugo{30 namespace lemon { 31 31 32 32 /// \addtogroup misc … … 143 143 ///It is quite easy-to-use, here is a short example. 144 144 ///\code 145 ///#include< hugo/time_measure.h>145 ///#include<lemon/time_measure.h> 146 146 ///#include<iostream> 147 147 /// … … 223 223 /// @} 224 224 225 } //namespace hugo226 227 #endif // HUGO_TIME_MEASURE_H225 } //namespace lemon 226 227 #endif //LEMON_TIME_MEASURE_H -
src/lemon/unionfind.h
r914 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/unionfind.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/unionfind.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_UNION_FIND_H18 #define HUGO_UNION_FIND_H17 #ifndef LEMON_UNION_FIND_H 18 #define LEMON_UNION_FIND_H 19 19 20 20 //!\ingroup auxdat … … 31 31 #include <algorithm> 32 32 33 #include < hugo/invalid.h>34 35 namespace hugo{33 #include <lemon/invalid.h> 34 35 namespace lemon { 36 36 37 37 //! \addtogroup auxdat … … 720 720 //! @} 721 721 722 } //namespace hugo723 724 #endif // HUGO_UNION_FIND_H722 } //namespace lemon 723 724 #endif //LEMON_UNION_FIND_H -
src/lemon/vector_map.h
r906 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/vector_map.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/vector_map.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_VECTOR_MAP_H18 #define HUGO_VECTOR_MAP_H17 #ifndef LEMON_VECTOR_MAP_H 18 #define LEMON_VECTOR_MAP_H 19 19 20 20 #include <vector> 21 21 22 #include < hugo/map_iterator.h>23 #include < hugo/map_bits.h>22 #include <lemon/map_iterator.h> 23 #include <lemon/map_bits.h> 24 24 25 25 ///\ingroup graphmaps … … 27 27 ///\brief Vector based graph maps. 28 28 29 namespace hugo{29 namespace lemon { 30 30 31 31 /// \addtogroup graphmaps -
src/lemon/xy.h
r906 r921 1 1 /* -*- C++ -*- 2 * src/ hugo/xy.h - Part of HUGOlib, a generic C++ optimization library2 * src/lemon/xy.h - Part of LEMON, a generic C++ optimization library 3 3 * 4 4 * Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport … … 15 15 */ 16 16 17 #ifndef HUGO_XY_H18 #define HUGO_XY_H17 #ifndef LEMON_XY_H 18 #define LEMON_XY_H 19 19 20 20 #include <iostream> … … 24 24 ///\brief A simple two dimensional vector and a bounding box implementation 25 25 /// 26 /// The class \ref hugo::xy "xy" implements26 /// The class \ref lemon::xy "xy" implements 27 27 ///a two dimensional vector with the usual 28 28 /// operations. 29 29 /// 30 /// The class \ref hugo::BoundingBox "BoundingBox" can be used to determine31 /// the rectangular bounding box a set of \ref hugo::xy "xy"'s.30 /// The class \ref lemon::BoundingBox "BoundingBox" can be used to determine 31 /// the rectangular bounding box a set of \ref lemon::xy "xy"'s. 32 32 /// 33 33 ///\author Attila Bernath 34 34 35 35 36 namespace hugo{36 namespace lemon { 37 37 38 38 /// \addtogroup misc … … 244 244 245 245 246 } //namespace hugo247 248 #endif // HUGO_XY_H246 } //namespace lemon 247 248 #endif //LEMON_XY_H
Note: See TracChangeset
for help on using the changeset viewer.
