[Lemon-commits] [lemon_svn] alpar: r1232 - in hugo/trunk: . doc src src/benchmark src/demo src/hugo src/lemon src/lemon/attic src/lemon/skeletons src/test src/work src/work/akos src/work/alpar src/work/athos src/work/athos/old src/work/athos/xy src/work/deba src/work/jacint src/work/johanna src/work/klao src/work/marci src/work/marci/experiment src/work/marci/leda src/work/marci/lp src/work/marci/oldies src/work/peter src/work/peter/path
Lemon SVN
svn at lemon.cs.elte.hu
Mon Nov 6 20:44:05 CET 2006
Author: alpar
Date: Wed Sep 29 17:30:04 2004
New Revision: 1232
Added:
hugo/trunk/src/lemon/
- copied from r1229, /hugo/trunk/src/hugo/
hugo/trunk/src/lemon/Makefile.am
- copied unchanged from r1231, /hugo/trunk/src/hugo/Makefile.am
hugo/trunk/src/lemon/array_map.h
- copied, changed from r1231, /hugo/trunk/src/hugo/array_map.h
hugo/trunk/src/lemon/attic/
- copied from r1231, /hugo/trunk/src/hugo/attic/
hugo/trunk/src/lemon/bfs.h
- copied, changed from r1231, /hugo/trunk/src/hugo/bfs.h
hugo/trunk/src/lemon/bin_heap.h
- copied, changed from r1231, /hugo/trunk/src/hugo/bin_heap.h
hugo/trunk/src/lemon/default_map.h
- copied, changed from r1231, /hugo/trunk/src/hugo/default_map.h
hugo/trunk/src/lemon/dfs.h
- copied, changed from r1231, /hugo/trunk/src/hugo/dfs.h
hugo/trunk/src/lemon/dijkstra.h
- copied, changed from r1231, /hugo/trunk/src/hugo/dijkstra.h
hugo/trunk/src/lemon/dimacs.h
- copied, changed from r1231, /hugo/trunk/src/hugo/dimacs.h
hugo/trunk/src/lemon/extended_pair.h
- copied, changed from r1231, /hugo/trunk/src/hugo/extended_pair.h
hugo/trunk/src/lemon/fib_heap.h
- copied, changed from r1231, /hugo/trunk/src/hugo/fib_heap.h
hugo/trunk/src/lemon/full_graph.h
- copied, changed from r1231, /hugo/trunk/src/hugo/full_graph.h
hugo/trunk/src/lemon/graph_wrapper.h
- copied, changed from r1231, /hugo/trunk/src/hugo/graph_wrapper.h
hugo/trunk/src/lemon/invalid.h
- copied, changed from r1231, /hugo/trunk/src/hugo/invalid.h
hugo/trunk/src/lemon/kruskal.h
- copied, changed from r1231, /hugo/trunk/src/hugo/kruskal.h
hugo/trunk/src/lemon/list_graph.h
- copied, changed from r1231, /hugo/trunk/src/hugo/list_graph.h
hugo/trunk/src/lemon/map_bits.h
- copied, changed from r1231, /hugo/trunk/src/hugo/map_bits.h
hugo/trunk/src/lemon/map_defines.h
- copied, changed from r1231, /hugo/trunk/src/hugo/map_defines.h
hugo/trunk/src/lemon/map_iterator.h
- copied, changed from r1231, /hugo/trunk/src/hugo/map_iterator.h
hugo/trunk/src/lemon/map_registry.h
- copied, changed from r1231, /hugo/trunk/src/hugo/map_registry.h
hugo/trunk/src/lemon/maps.h
- copied, changed from r1231, /hugo/trunk/src/hugo/maps.h
hugo/trunk/src/lemon/min_cost_flow.h
- copied, changed from r1231, /hugo/trunk/src/hugo/min_cost_flow.h
hugo/trunk/src/lemon/path.h
- copied, changed from r1231, /hugo/trunk/src/hugo/path.h
hugo/trunk/src/lemon/preflow.h
- copied, changed from r1231, /hugo/trunk/src/hugo/preflow.h
hugo/trunk/src/lemon/skeletons/
- copied from r1231, /hugo/trunk/src/hugo/skeletons/
hugo/trunk/src/lemon/smart_graph.h
- copied, changed from r1231, /hugo/trunk/src/hugo/smart_graph.h
hugo/trunk/src/lemon/suurballe.h
- copied, changed from r1231, /hugo/trunk/src/hugo/suurballe.h
hugo/trunk/src/lemon/sym_map.h
- copied, changed from r1231, /hugo/trunk/src/hugo/sym_map.h
hugo/trunk/src/lemon/template.h
- copied, changed from r1231, /hugo/trunk/src/hugo/template.h
hugo/trunk/src/lemon/time_measure.h
- copied, changed from r1231, /hugo/trunk/src/hugo/time_measure.h
hugo/trunk/src/lemon/unionfind.h
- copied, changed from r1231, /hugo/trunk/src/hugo/unionfind.h
hugo/trunk/src/lemon/vector_map.h
- copied, changed from r1231, /hugo/trunk/src/hugo/vector_map.h
hugo/trunk/src/lemon/xy.h
- copied, changed from r1231, /hugo/trunk/src/hugo/xy.h
Removed:
hugo/trunk/src/hugo/
Modified:
hugo/trunk/Makefile.am
hugo/trunk/configure.ac
hugo/trunk/doc/coding_style.dox
hugo/trunk/doc/graphs.dox
hugo/trunk/doc/groups.dox
hugo/trunk/doc/mainpage.dox
hugo/trunk/doc/maps.dox
hugo/trunk/doc/namespaces.dox
hugo/trunk/src/Makefile.am
hugo/trunk/src/benchmark/bench_tools.h
hugo/trunk/src/benchmark/bfs-bench.cc
hugo/trunk/src/benchmark/graph-bench.cc
hugo/trunk/src/benchmark/hcube.cc
hugo/trunk/src/demo/sub_graph_wrapper_demo.cc
hugo/trunk/src/lemon/attic/debug.h
hugo/trunk/src/lemon/attic/error.h
hugo/trunk/src/lemon/attic/tight_edge_filter_map.h
hugo/trunk/src/lemon/skeletons/graph.h
hugo/trunk/src/lemon/skeletons/maps.h
hugo/trunk/src/lemon/skeletons/path.h
hugo/trunk/src/test/bfs_test.cc
hugo/trunk/src/test/dfs_test.cc
hugo/trunk/src/test/dijkstra_heap_test.cc
hugo/trunk/src/test/dijkstra_test.cc
hugo/trunk/src/test/error_test.cc
hugo/trunk/src/test/graph_test.cc
hugo/trunk/src/test/graph_test.h
hugo/trunk/src/test/graph_wrapper_test.cc
hugo/trunk/src/test/kruskal_test.cc
hugo/trunk/src/test/min_cost_flow_test.cc
hugo/trunk/src/test/path_test.cc
hugo/trunk/src/test/preflow_test.cc
hugo/trunk/src/test/suurballe_test.cc
hugo/trunk/src/test/test_tools.h
hugo/trunk/src/test/test_tools_fail.cc
hugo/trunk/src/test/test_tools_pass.cc
hugo/trunk/src/test/time_measure_test.cc
hugo/trunk/src/test/unionfind_test.cc
hugo/trunk/src/test/xy_test.cc
hugo/trunk/src/work/akos/loader_demo.cc
hugo/trunk/src/work/alpar/bfs-named-param.cc
hugo/trunk/src/work/alpar/boolmap_iter.cc
hugo/trunk/src/work/alpar/f_ed_ka.h
hugo/trunk/src/work/alpar/f_ed_ka_demo.cc
hugo/trunk/src/work/alpar/gwrapper.h
hugo/trunk/src/work/alpar/list_graph_demo.cc
hugo/trunk/src/work/alpar/rw_nonref_map.cc
hugo/trunk/src/work/alpar/smart_graph_demo.cc
hugo/trunk/src/work/athos/bfs_test.cc
hugo/trunk/src/work/athos/dijkstra_at.h
hugo/trunk/src/work/athos/dijkstra_demo.cc
hugo/trunk/src/work/athos/kruskal.h
hugo/trunk/src/work/athos/min_cost_flow.cc
hugo/trunk/src/work/athos/mincostflow.h
hugo/trunk/src/work/athos/minlength_demo.cc
hugo/trunk/src/work/athos/old/minlengthpaths.h
hugo/trunk/src/work/athos/pf_demo.cc
hugo/trunk/src/work/athos/preflow_push_wogw.h
hugo/trunk/src/work/athos/suurballe.cc
hugo/trunk/src/work/athos/uf_demo.cc
hugo/trunk/src/work/athos/union_find.h
hugo/trunk/src/work/athos/xy/boundingbox.cc
hugo/trunk/src/work/athos/xy/xy.cc
hugo/trunk/src/work/bin_heap_demo.cc
hugo/trunk/src/work/deba/array_map_factory.h
hugo/trunk/src/work/deba/bin_heap.h
hugo/trunk/src/work/deba/dijkstra.h
hugo/trunk/src/work/deba/invalid.h
hugo/trunk/src/work/deba/list_graph.h
hugo/trunk/src/work/deba/map_registry.h
hugo/trunk/src/work/deba/pac_map_factory.h
hugo/trunk/src/work/deba/vector_map_factory.h
hugo/trunk/src/work/iterator_bfs_dfs_demo.cc
hugo/trunk/src/work/jacint/graph_gen.h
hugo/trunk/src/work/jacint/ledacomp.cc
hugo/trunk/src/work/jacint/max_flow.h
hugo/trunk/src/work/jacint/max_flow_bug.cc
hugo/trunk/src/work/jacint/max_flow_test.cc
hugo/trunk/src/work/jacint/max_matching.cc
hugo/trunk/src/work/jacint/max_matching.h
hugo/trunk/src/work/jacint/max_save.h
hugo/trunk/src/work/jacint/preflow.cc
hugo/trunk/src/work/jacint/preflow_excess.h
hugo/trunk/src/work/jacint/preflow_excess_test.cc
hugo/trunk/src/work/jacint/preflow_res.h
hugo/trunk/src/work/jacint/prim.cc
hugo/trunk/src/work/jacint/prim.h
hugo/trunk/src/work/johanna/contract_wrapper.h
hugo/trunk/src/work/johanna/ma_order.h
hugo/trunk/src/work/johanna/ma_order_test.cc
hugo/trunk/src/work/klao/debug.h
hugo/trunk/src/work/klao/iter_map.h
hugo/trunk/src/work/klao/iter_map_test.cc
hugo/trunk/src/work/klao/map_test.cc
hugo/trunk/src/work/marci/augmenting_flow.h
hugo/trunk/src/work/marci/bfs_dfs.h
hugo/trunk/src/work/marci/bfs_dfs_misc.h
hugo/trunk/src/work/marci/bfsit_vs_byhand.cc
hugo/trunk/src/work/marci/bipartite_graph_wrapper.h
hugo/trunk/src/work/marci/bipartite_graph_wrapper_test.cc
hugo/trunk/src/work/marci/bipartite_matching_demo.cc
hugo/trunk/src/work/marci/const_map_time.cc
hugo/trunk/src/work/marci/experiment/bfs_iterator.h
hugo/trunk/src/work/marci/experiment/bfs_iterator_1.h
hugo/trunk/src/work/marci/experiment/edmonds_karp.h
hugo/trunk/src/work/marci/experiment/edmonds_karp_1.h
hugo/trunk/src/work/marci/experiment/edmonds_karp_demo.cc
hugo/trunk/src/work/marci/experiment/edmonds_karp_demo_1.cc
hugo/trunk/src/work/marci/experiment/graph_wrapper.h
hugo/trunk/src/work/marci/experiment/graph_wrapper_1.h
hugo/trunk/src/work/marci/experiment/graph_wrapper_st_ostream_op.h
hugo/trunk/src/work/marci/experiment/iterator_bfs_demo.cc
hugo/trunk/src/work/marci/experiment/iterator_bfs_demo_1.cc
hugo/trunk/src/work/marci/experiment/list_graph.h
hugo/trunk/src/work/marci/for_each_macros.h
hugo/trunk/src/work/marci/graph_concept.h
hugo/trunk/src/work/marci/graph_wrapper_time.cc
hugo/trunk/src/work/marci/gw_vs_not.cc
hugo/trunk/src/work/marci/iterator_bfs_demo.cc
hugo/trunk/src/work/marci/leda/bipartite_matching_comparison.cc
hugo/trunk/src/work/marci/leda/bipartite_matching_leda.cc
hugo/trunk/src/work/marci/leda/bipartite_matching_leda_gen.cc
hugo/trunk/src/work/marci/leda/leda_graph_wrapper.h
hugo/trunk/src/work/marci/leda/max_bipartite_matching_demo.cc
hugo/trunk/src/work/marci/leda_bfs_dfs.cc
hugo/trunk/src/work/marci/leda_graph_demo.cc
hugo/trunk/src/work/marci/lg_vs_sg_vs_sg.cc
hugo/trunk/src/work/marci/lp/lp_solver_wrapper.h
hugo/trunk/src/work/marci/lp/max_flow_by_lp.cc
hugo/trunk/src/work/marci/macro_test.cc
hugo/trunk/src/work/marci/max_bipartite_matching.h
hugo/trunk/src/work/marci/max_flow_1.cc
hugo/trunk/src/work/marci/max_flow_demo.cc
hugo/trunk/src/work/marci/merge_node_graph_wrapper.h
hugo/trunk/src/work/marci/merge_node_graph_wrapper_test.cc
hugo/trunk/src/work/marci/oldies/edmonds_karp.h
hugo/trunk/src/work/marci/oldies/marci_graph_demo.cc
hugo/trunk/src/work/marci/preflow_bug.cc
hugo/trunk/src/work/marci/preflow_demo_athos.cc
hugo/trunk/src/work/marci/preflow_demo_jacint.cc
hugo/trunk/src/work/marci/top_sort_test.cc
hugo/trunk/src/work/peter/edgepathgraph.h
hugo/trunk/src/work/peter/edgepathgraph_test.cc
hugo/trunk/src/work/peter/hierarchygraph.h
hugo/trunk/src/work/peter/hierarchygraph_test.cc
hugo/trunk/src/work/peter/path/debug.h
hugo/trunk/src/work/peter/path/path.h
hugo/trunk/src/work/peter/path/path_skeleton.h
hugo/trunk/src/work/peter/path/path_test.cc
hugo/trunk/src/work/sage_graph.h
Log:
hugo -> lemon
Modified: hugo/trunk/Makefile.am
==============================================================================
--- hugo/trunk/Makefile.am (original)
+++ hugo/trunk/Makefile.am Wed Sep 29 17:30:04 2004
@@ -11,7 +11,7 @@
doc/Makefile.in \
doc/doxygen.log \
src/Makefile.in \
- src/hugo/Makefile.in \
+ src/lemon/Makefile.in \
src/test/Makefile.in \
src/benchmark/Makefile.in
Modified: hugo/trunk/configure.ac
==============================================================================
--- hugo/trunk/configure.ac (original)
+++ hugo/trunk/configure.ac Wed Sep 29 17:30:04 2004
@@ -1,8 +1,8 @@
dnl Process this file with autoconf to produce a configure script.
-AC_INIT([HugoLib], [0.2], [etik-ol at cs.elte.hu], [hugo])
+AC_INIT([LEMON], [0.2], [etik-ol at cs.elte.hu], [lemon])
AC_CONFIG_AUX_DIR([config])
AM_INIT_AUTOMAKE(1.7)
-AC_CONFIG_SRCDIR([src/hugo/invalid.h])
+AC_CONFIG_SRCDIR([src/lemon/invalid.h])
AC_PREREQ(2.57)
dnl Checks for programs.
@@ -27,5 +27,5 @@
AC_HEADER_STDC
AC_CHECK_FUNCS(gettimeofday)
-AC_CONFIG_FILES([Makefile doc/Makefile src/Makefile src/hugo/Makefile src/test/Makefile src/benchmark/Makefile])
+AC_CONFIG_FILES([Makefile doc/Makefile src/Makefile src/lemon/Makefile src/test/Makefile src/benchmark/Makefile])
AC_OUTPUT
Modified: hugo/trunk/doc/coding_style.dox
==============================================================================
--- hugo/trunk/doc/coding_style.dox (original)
+++ hugo/trunk/doc/coding_style.dox Wed Sep 29 17:30:04 2004
@@ -1,6 +1,6 @@
/*!
-\page coding_style Hugo Coding Style
+\page coding_style LEMON Coding Style
\section naming_conv Naming Conventions
@@ -9,7 +9,7 @@
functions, variables, constants and exceptions. If these conventions
are met in one's code then it is easier to read and maintain
it. Please comply with these conventions if you want to contribute
-developing Hugo library.
+developing LEMON library.
\subsection cs-class Classes and other types
Modified: hugo/trunk/doc/graphs.dox
==============================================================================
--- hugo/trunk/doc/graphs.dox (original)
+++ hugo/trunk/doc/graphs.dox Wed Sep 29 17:30:04 2004
@@ -2,60 +2,60 @@
\page graphs How to use graphs
-The primary data structures of HugoLib are the graph classes. They all
+The primary data structures of LEMON are the graph classes. They all
provide a node list - edge list interface, i.e. they have
functionalities to list the nodes and the edges of the graph as well
as in incoming and outgoing edges of a given node.
Each graph should meet the
-\ref hugo::skeleton::StaticGraph "StaticGraph" concept.
+\ref lemon::skeleton::StaticGraph "StaticGraph" concept.
This concept does not
makes it possible to change the graph (i.e. it is not possible to add
or delete edges or nodes). Most of the graph algorithms will run on
these graphs.
The graphs meeting the
-\ref hugo::skeleton::ExtendableGraph "ExtendableGraph"
+\ref lemon::skeleton::ExtendableGraph "ExtendableGraph"
concept allow node and
edge addition. You can also "clear" (i.e. erase all edges and nodes)
such a graph.
In case of graphs meeting the full feature
-\ref hugo::skeleton::ErasableGraph "ErasableGraph"
+\ref lemon::skeleton::ErasableGraph "ErasableGraph"
concept
you can also erase individual edges and node in arbitrary order.
The implemented graph structures are the following.
-\li \ref hugo::ListGraph "ListGraph" is the most versatile graph class. It meets
-the \ref hugo::skeleton::ErasableGraph "ErasableGraph" concept
+\li \ref lemon::ListGraph "ListGraph" is the most versatile graph class. It meets
+the \ref lemon::skeleton::ErasableGraph "ErasableGraph" concept
and it also have some convenience features.
-\li \ref hugo::SmartGraph "SmartGraph" is a more memory
-efficient version of \ref hugo::ListGraph "ListGraph". The
+\li \ref lemon::SmartGraph "SmartGraph" is a more memory
+efficient version of \ref lemon::ListGraph "ListGraph". The
price of it is that it only meets the
-\ref hugo::skeleton::ExtendableGraph "ExtendableGraph" concept,
+\ref lemon::skeleton::ExtendableGraph "ExtendableGraph" concept,
so you cannot delete individual edges or nodes.
-\li \ref hugo::SymListGraph "SymListGraph" and
-\ref hugo::SymSmartGraph "SymSmartGraph" classes are very similar to
-\ref hugo::ListGraph "ListGraph" and \ref hugo::SmartGraph "SmartGraph".
+\li \ref lemon::SymListGraph "SymListGraph" and
+\ref lemon::SymSmartGraph "SymSmartGraph" classes are very similar to
+\ref lemon::ListGraph "ListGraph" and \ref lemon::SmartGraph "SmartGraph".
The difference is that whenever you add a
new edge to the graph, it actually adds a pair of oppositely directed edges.
They are linked together so it is possible to access the counterpart of an
edge. An even more important feature is that using these classes you can also
attach data to the edges in such a way that the stored data
are shared by the edge pairs.
-\li \ref hugo::FullGraph "FullGraph"
-implements a full graph. It is a \ref hugo::skeleton::StaticGraph, so you cannot
+\li \ref lemon::FullGraph "FullGraph"
+implements a full graph. It is a \ref lemon::skeleton::StaticGraph, so you cannot
change the number of nodes once it is constructed. It is extremely memory
efficient: it uses constant amount of memory independently from the number of
the nodes of the graph. Of course, the size of the \ref maps "NodeMap"'s and
\ref maps "EdgeMap"'s will depend on the number of nodes.
-\li \ref hugo::NodeSet "NodeSet" implements a graph with no edges. This class
-can be used as a base class of \ref hugo::EdgeSet "EdgeSet".
-\li \ref hugo::EdgeSet "EdgeSet" can be used to create a new graph on
+\li \ref lemon::NodeSet "NodeSet" implements a graph with no edges. This class
+can be used as a base class of \ref lemon::EdgeSet "EdgeSet".
+\li \ref lemon::EdgeSet "EdgeSet" can be used to create a new graph on
the node set of another graph. The base graph can be an arbitrary graph and it
-is possible to attach several \ref hugo::EdgeSet "EdgeSet"'s to a base graph.
+is possible to attach several \ref lemon::EdgeSet "EdgeSet"'s to a base graph.
\todo Don't we need SmartNodeSet and SmartEdgeSet?
\todo Some cross-refs are wrong.
@@ -65,21 +65,21 @@
\ref maps "map classes"
to dynamically attach data the to graph components.
-The following program demonstrates the basic features of HugoLib's graph
+The following program demonstrates the basic features of LEMON's graph
structures.
\code
#include <iostream>
-#include <hugo/list_graph.h>
+#include <lemon/list_graph.h>
-using namespace hugo;
+using namespace lemon;
int main()
{
typedef ListGraph Graph;
\endcode
-ListGraph is one of HugoLib's graph classes. It is based on linked lists,
+ListGraph is one of LEMON's graph classes. It is based on linked lists,
therefore iterating throuh its edges and nodes is fast.
\code
@@ -114,7 +114,7 @@
node iterator to initialize it to the first node. The operator++ is used to
step to the next node. Using operator++ on the iterator pointing to the last
node invalidates the iterator i.e. sets its value to
-\ref hugo::INVALID "INVALID". This is what we exploit in the stop condition.
+\ref lemon::INVALID "INVALID". This is what we exploit in the stop condition.
The previous code fragment prints out the following:
@@ -181,7 +181,7 @@
\endcode
As we mentioned above, graphs are not containers rather
-incidence structures which are iterable in many ways. HugoLib introduces
+incidence structures which are iterable in many ways. LEMON introduces
concepts that allow us to attach containers to graphs. These containers are
called maps.
Modified: hugo/trunk/doc/groups.dox
==============================================================================
--- hugo/trunk/doc/groups.dox (original)
+++ hugo/trunk/doc/groups.dox Wed Sep 29 17:30:04 2004
@@ -1,23 +1,23 @@
/**
@defgroup datas Data Structures
-This group describes the several graph structures implemented in HugoLib.
+This group describes the several graph structures implemented in LEMON.
*/
/**
@defgroup graphs Graph Structures
@ingroup datas
-\brief Graph structures implemented in Hugo.
+\brief Graph structures implemented in LEMON.
-Hugolib provides several data structures to meet the diverging requirements
+LEMON provides several data structures to meet the diverging requirements
of the possible users.
In order to save on running time or on memory usage, some structures may
fail to provide
some graph features like edge or node deletion.
-Hugolib also offers special graphs that cannot be used alone but only
+LEMON also offers special graphs that cannot be used alone but only
in conjunction with other graph representation. The examples for this are
-\ref hugo::EdgeSet "EdgeSet", \ref hugo::NodeSet "NodeSet"
+\ref lemon::EdgeSet "EdgeSet", \ref lemon::NodeSet "NodeSet"
and the large variety of \ref gwrappers "graph wrappers".
You are free to use the graph structure that fit your requirements
@@ -28,9 +28,9 @@
/**
@defgroup auxdat Auxiliary Data Structures
@ingroup datas
-\brief Some data structures implemented in HugoLib.
+\brief Some data structures implemented in LEMON.
-This group describes the data structures implemented in HugoLib in
+This group describes the data structures implemented in LEMON in
order to make it easier to implement combinatorial algorithms.
*/
@@ -52,7 +52,7 @@
/**
@defgroup galgs Graph Algorithms
\brief This group describes the several graph algorithms
-implemented in HugoLib.
+implemented in LEMON.
*/
/**
@@ -72,7 +72,7 @@
@defgroup skeletons Skeletons
\brief Skeletons (a.k.a. concept checking classes)
-This group describes the data/algorithm skeletons implemented in HugoLib in
+This group describes the data/algorithm skeletons implemented in LEMON in
order to make it easier to check if a certain template class or
template function is correctly implemented.
*/
Modified: hugo/trunk/doc/mainpage.dox
==============================================================================
--- hugo/trunk/doc/mainpage.dox (original)
+++ hugo/trunk/doc/mainpage.dox Wed Sep 29 17:30:04 2004
@@ -3,9 +3,11 @@
\section intro Introduction
-\subsection whatis What is HugoLib
+\subsection whatis What is LEMON
-HugoLib stands for Hungarian Graph Optimization Library.
+LEMON stands for
+<it>L</it>ibrary of <it>E</it>fficient <it>M</it>odels
+and <it>O</it>ptimization in <it>N</it>etworks.
It is a C++ template
library aimed at combinatorial optimization tasks which
often involve in working
@@ -14,7 +16,7 @@
\subsection howtoread How to read this document
-Graph structures play central role in HugoLib, so if you are new to it,
+Graph structures play central role in LEMON, so if you are new to it,
you probably should start \ref graphs "here".
You can also find this page along with others under
<a href="pages.html"> Related Pages </a>
Modified: hugo/trunk/doc/maps.dox
==============================================================================
--- hugo/trunk/doc/maps.dox (original)
+++ hugo/trunk/doc/maps.dox Wed Sep 29 17:30:04 2004
@@ -4,7 +4,7 @@
\page maps Maps
-Maps play central role in HUGOlib. As their name suggests, they map a
+Maps play central role in LEMON. As their name suggests, they map a
certain range of \e keys to certain \e values. Each map has two
<tt>typedef</tt>'s to determine the types of keys and values, like this:
@@ -21,7 +21,7 @@
value belonging to a key, so you have a direct access to the memory address
where it is stored.
-Each graph structure in HUGOlib provides two standard map templates called
+Each graph structure in LEMON provides two standard map templates called
\c EdgeMap and \c NodeMap. Both are reference maps and you can easily
assign data to the nodes and to the edges of the graph. For example if you
have a graph \c G defined as
@@ -69,7 +69,7 @@
The readable maps are very frequently used as the input of the
algorithms. For this purpose the most straightforward way is the use of the
-default maps provided by Hugo's graph structures.
+default maps provided by LEMON's graph structures.
Very often however, it is more
convenient and/or more efficient to write your own readable map.
Modified: hugo/trunk/doc/namespaces.dox
==============================================================================
--- hugo/trunk/doc/namespaces.dox (original)
+++ hugo/trunk/doc/namespaces.dox Wed Sep 29 17:30:04 2004
@@ -1,10 +1,10 @@
-/// The namespace of HugoLib
+/// The namespace of LEMON
/// \todo Some more detailed description would be nice here.
///
-namespace hugo {
+namespace lemon {
- /// The namespace of HUGOlib concepts and concept checking classes
+ /// The namespace of LEMON concepts and concept checking classes
/// \todo Some more detailed description would be nice here.
///
Modified: hugo/trunk/src/Makefile.am
==============================================================================
--- hugo/trunk/src/Makefile.am (original)
+++ hugo/trunk/src/Makefile.am Wed Sep 29 17:30:04 2004
@@ -1 +1 @@
-SUBDIRS = hugo benchmark test
+SUBDIRS = lemon benchmark test
Modified: hugo/trunk/src/benchmark/bench_tools.h
==============================================================================
--- hugo/trunk/src/benchmark/bench_tools.h (original)
+++ hugo/trunk/src/benchmark/bench_tools.h Wed Sep 29 17:30:04 2004
@@ -1,11 +1,11 @@
// -*- mode:C++ -*-
-#ifndef HUGO_BENCH_TEST_H
-#define HUGO_BENCH_TEST_H
+#ifndef LEMON_BENCH_TEST_H
+#define LEMON_BENCH_TEST_H
#include<vector>
#include<iostream>
-#include<hugo/time_measure.h>
+#include<lemon/time_measure.h>
///An experimental typedef factory
#define GRAPH_TYPEDEF_FACTORY(Graph) \
@@ -74,9 +74,9 @@
}
};
-inline void PrintTime(char *ID,hugo::Timer &T)
+inline void PrintTime(char *ID,lemon::Timer &T)
{
- hugo::TimeStamp S(T);
+ lemon::TimeStamp S(T);
std::cout << ID << ' ' << S.getUserTime() << ' '
<< S.getSystemTime() << ' ' << S.getRealTime() << std::endl;
}
Modified: hugo/trunk/src/benchmark/bfs-bench.cc
==============================================================================
--- hugo/trunk/src/benchmark/bfs-bench.cc (original)
+++ hugo/trunk/src/benchmark/bfs-bench.cc Wed Sep 29 17:30:04 2004
@@ -2,11 +2,11 @@
#include <queue>
#include<math.h>
-#include<hugo/smart_graph.h>
+#include<lemon/smart_graph.h>
#include"bench_tools.h"
using namespace std;
-using namespace hugo;
+using namespace lemon;
inline int numOfOnes(int n,int dim)
{
Modified: hugo/trunk/src/benchmark/graph-bench.cc
==============================================================================
--- hugo/trunk/src/benchmark/graph-bench.cc (original)
+++ hugo/trunk/src/benchmark/graph-bench.cc Wed Sep 29 17:30:04 2004
@@ -1,9 +1,9 @@
#include<math.h>
-#include<hugo/list_graph.h>
+#include<lemon/list_graph.h>
#include"bench_tools.h"
-using namespace hugo;
+using namespace lemon;
///Makes a full graph by adding and deleting a lot of edges;
@@ -45,7 +45,7 @@
int main()
{
- hugo::Timer T;
+ lemon::Timer T;
makeFullGraph<ListGraph>(nextPrim(1000),nextPrim(300),nextPrim(100));
PrintTime("BIG",T);
Modified: hugo/trunk/src/benchmark/hcube.cc
==============================================================================
--- hugo/trunk/src/benchmark/hcube.cc (original)
+++ hugo/trunk/src/benchmark/hcube.cc Wed Sep 29 17:30:04 2004
@@ -1,15 +1,15 @@
// -*- mode:C++ -*-
#include<math.h>
-#include<hugo/list_graph.h>
-#include<hugo/smart_graph.h>
-#include<hugo/dijkstra.h>
-#include<hugo/preflow.h>
+#include<lemon/list_graph.h>
+#include<lemon/smart_graph.h>
+#include<lemon/dijkstra.h>
+#include<lemon/preflow.h>
#include"bench_tools.h"
using namespace std;
-using namespace hugo;
+using namespace lemon;
inline int numOfOnes(int n,int dim)
{
Modified: hugo/trunk/src/demo/sub_graph_wrapper_demo.cc
==============================================================================
--- hugo/trunk/src/demo/sub_graph_wrapper_demo.cc (original)
+++ hugo/trunk/src/demo/sub_graph_wrapper_demo.cc Wed Sep 29 17:30:04 2004
@@ -8,15 +8,15 @@
#include <iostream>
#include <fstream>
-#include <hugo/smart_graph.h>
-#include <hugo/dijkstra.h>
-#include <hugo/maps.h>
-#include <hugo/graph_wrapper.h>
-#include <hugo/dimacs.h>
-#include <hugo/preflow.h>
-#include <hugo/tight_edge_filter_map.h>
+#include <lemon/smart_graph.h>
+#include <lemon/dijkstra.h>
+#include <lemon/maps.h>
+#include <lemon/graph_wrapper.h>
+#include <lemon/dimacs.h>
+#include <lemon/preflow.h>
+#include <lemon/tight_edge_filter_map.h>
-using namespace hugo;
+using namespace lemon;
using std::cout;
using std::endl;
Copied: hugo/trunk/src/lemon/array_map.h (from r1231, /hugo/trunk/src/hugo/array_map.h)
==============================================================================
--- /hugo/trunk/src/hugo/array_map.h (original)
+++ hugo/trunk/src/lemon/array_map.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/array_map.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/array_map.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,20 +14,20 @@
*
*/
-#ifndef HUGO_ARRAY_MAP_H
-#define HUGO_ARRAY_MAP_H
+#ifndef LEMON_ARRAY_MAP_H
+#define LEMON_ARRAY_MAP_H
#include <memory>
-#include <hugo/map_iterator.h>
-#include <hugo/map_bits.h>
+#include <lemon/map_iterator.h>
+#include <lemon/map_bits.h>
///\ingroup graphmaps
///\file
///\brief Graph maps that construates and destruates
///their elements dynamically.
-namespace hugo {
+namespace lemon {
/// \addtogroup graphmaps
@@ -346,4 +346,4 @@
}
-#endif //HUGO_ARRAY_MAP_H
+#endif //LEMON_ARRAY_MAP_H
Modified: hugo/trunk/src/lemon/attic/debug.h
==============================================================================
--- /hugo/trunk/src/hugo/attic/debug.h (original)
+++ hugo/trunk/src/lemon/attic/debug.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/debug.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/debug.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,13 +14,13 @@
*
*/
-#ifndef HUGO_DEBUG_H
-#define HUGO_DEBUG_H
+#ifndef LEMON_DEBUG_H
+#define LEMON_DEBUG_H
//! \file
//! \brief Basic definitions for debug control.
-namespace hugo {
+namespace lemon {
//! Debug mode for testing/debugging
@@ -67,4 +67,4 @@
#endif
}
-#endif // HUGO_DEBUG_H
+#endif // LEMON_DEBUG_H
Modified: hugo/trunk/src/lemon/attic/error.h
==============================================================================
--- /hugo/trunk/src/hugo/attic/error.h (original)
+++ hugo/trunk/src/lemon/attic/error.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/error.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/error.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,8 +14,8 @@
*
*/
-#ifndef HUGO_ERROR_H
-#define HUGO_ERROR_H
+#ifndef LEMON_ERROR_H
+#define LEMON_ERROR_H
//! \ingroup misc
//! \file
@@ -26,7 +26,7 @@
#include <sstream>
-namespace hugo {
+namespace lemon {
/**
* \brief Generic exception class.
@@ -74,9 +74,9 @@
*/
# define FIXME(msg) \
- do { throw ::hugo::Exception() << "FIXME: " msg " (in: " \
+ do { throw ::lemon::Exception() << "FIXME: " msg " (in: " \
__FILE__ ", " << __LINE__ << ")"; \
} while(false)
}
-#endif // HUGO_ERROR_H
+#endif // LEMON_ERROR_H
Modified: hugo/trunk/src/lemon/attic/tight_edge_filter_map.h
==============================================================================
--- /hugo/trunk/src/hugo/attic/tight_edge_filter_map.h (original)
+++ hugo/trunk/src/lemon/attic/tight_edge_filter_map.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/tight_edge_filter_map.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/tight_edge_filter_map.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,16 +14,16 @@
*
*/
-#ifndef HUGO_TIGHT_EDGE_FILTER_MAP_H
-#define HUGO_TIGHT_EDGE_FILTER_MAP_H
+#ifndef LEMON_TIGHT_EDGE_FILTER_MAP_H
+#define LEMON_TIGHT_EDGE_FILTER_MAP_H
-#include <hugo/maps.h>
+#include <lemon/maps.h>
// /// \file
// /// \brief Maximum flow algorithms.
// /// \ingroup galgs
-namespace hugo {
+namespace lemon {
/// \brief A map for filtering the edge-set to those edges
/// which are tight w.r.t. some node_potential map and
@@ -56,8 +56,8 @@
}
};
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_TIGHT_EDGE_FILTER_MAP_H
+#endif //LEMON_TIGHT_EDGE_FILTER_MAP_H
Copied: hugo/trunk/src/lemon/bfs.h (from r1231, /hugo/trunk/src/hugo/bfs.h)
==============================================================================
--- /hugo/trunk/src/hugo/bfs.h (original)
+++ hugo/trunk/src/lemon/bfs.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/bfs.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/bfs.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,8 +14,8 @@
*
*/
-#ifndef HUGO_BFS_H
-#define HUGO_BFS_H
+#ifndef LEMON_BFS_H
+#define LEMON_BFS_H
///\ingroup flowalgs
///\file
@@ -23,10 +23,10 @@
///
///\todo Revise Manual.
-#include <hugo/bin_heap.h>
-#include <hugo/invalid.h>
+#include <lemon/bin_heap.h>
+#include <lemon/invalid.h>
-namespace hugo {
+namespace lemon {
/// \addtogroup flowalgs
/// @{
@@ -279,7 +279,7 @@
/// @}
-} //END OF NAMESPACE HUGO
+} //END OF NAMESPACE LEMON
#endif
Copied: hugo/trunk/src/lemon/bin_heap.h (from r1231, /hugo/trunk/src/hugo/bin_heap.h)
==============================================================================
--- /hugo/trunk/src/hugo/bin_heap.h (original)
+++ hugo/trunk/src/lemon/bin_heap.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/bin_heap.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/bin_heap.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,8 +14,8 @@
*
*/
-#ifndef HUGO_BIN_HEAP_H
-#define HUGO_BIN_HEAP_H
+#ifndef LEMON_BIN_HEAP_H
+#define LEMON_BIN_HEAP_H
///\ingroup auxdat
///\file
@@ -26,7 +26,7 @@
#include <utility>
#include <functional>
-namespace hugo {
+namespace lemon {
/// \addtogroup auxdat
/// @{
@@ -198,6 +198,6 @@
///@}
-} // namespace hugo
+} // namespace lemon
-#endif // HUGO_BIN_HEAP_H
+#endif // LEMON_BIN_HEAP_H
Copied: hugo/trunk/src/lemon/default_map.h (from r1231, /hugo/trunk/src/hugo/default_map.h)
==============================================================================
--- /hugo/trunk/src/hugo/default_map.h (original)
+++ hugo/trunk/src/lemon/default_map.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/default_map.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/default_map.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,19 +14,19 @@
*
*/
-#ifndef HUGO_DEFAULT_MAP_H
-#define HUGO_DEFAULT_MAP_H
+#ifndef LEMON_DEFAULT_MAP_H
+#define LEMON_DEFAULT_MAP_H
-#include <hugo/array_map.h>
-#include <hugo/vector_map.h>
+#include <lemon/array_map.h>
+#include <lemon/vector_map.h>
///\ingroup graphmaps
///\file
///\brief Graph maps that construates and destruates
///their elements dynamically.
-namespace hugo {
+namespace lemon {
/// \addtogroup graphmaps
/// @{
Copied: hugo/trunk/src/lemon/dfs.h (from r1231, /hugo/trunk/src/hugo/dfs.h)
==============================================================================
--- /hugo/trunk/src/hugo/dfs.h (original)
+++ hugo/trunk/src/lemon/dfs.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/dfs.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/dfs.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,8 +14,8 @@
*
*/
-#ifndef HUGO_DFS_H
-#define HUGO_DFS_H
+#ifndef LEMON_DFS_H
+#define LEMON_DFS_H
///\ingroup flowalgs
///\file
@@ -23,10 +23,10 @@
///
///\todo Revise Manual.
-#include <hugo/bin_heap.h>
-#include <hugo/invalid.h>
+#include <lemon/bin_heap.h>
+#include <lemon/invalid.h>
-namespace hugo {
+namespace lemon {
/// \addtogroup flowalgs
/// @{
@@ -283,7 +283,7 @@
/// @}
-} //END OF NAMESPACE HUGO
+} //END OF NAMESPACE LEMON
#endif
Copied: hugo/trunk/src/lemon/dijkstra.h (from r1231, /hugo/trunk/src/hugo/dijkstra.h)
==============================================================================
--- /hugo/trunk/src/hugo/dijkstra.h (original)
+++ hugo/trunk/src/lemon/dijkstra.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/dijkstra.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/dijkstra.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,17 +14,17 @@
*
*/
-#ifndef HUGO_DIJKSTRA_H
-#define HUGO_DIJKSTRA_H
+#ifndef LEMON_DIJKSTRA_H
+#define LEMON_DIJKSTRA_H
///\ingroup flowalgs
///\file
///\brief Dijkstra algorithm.
-#include <hugo/bin_heap.h>
-#include <hugo/invalid.h>
+#include <lemon/bin_heap.h>
+#include <lemon/invalid.h>
-namespace hugo {
+namespace lemon {
/// \addtogroup flowalgs
/// @{
@@ -337,7 +337,7 @@
/// @}
-} //END OF NAMESPACE HUGO
+} //END OF NAMESPACE LEMON
#endif
Copied: hugo/trunk/src/lemon/dimacs.h (from r1231, /hugo/trunk/src/hugo/dimacs.h)
==============================================================================
--- /hugo/trunk/src/hugo/dimacs.h (original)
+++ hugo/trunk/src/lemon/dimacs.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/dimacs.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/dimacs.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,19 +14,19 @@
*
*/
-#ifndef HUGO_DIMACS_H
-#define HUGO_DIMACS_H
+#ifndef LEMON_DIMACS_H
+#define LEMON_DIMACS_H
#include <iostream>
#include <string>
#include <vector>
-#include <hugo/maps.h>
+#include <lemon/maps.h>
/// \ingroup misc
/// \file
/// \brief Dimacs file format reader.
-namespace hugo {
+namespace lemon {
/// \addtogroup misc
@@ -202,6 +202,6 @@
/// @}
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_DIMACS_H
+#endif //LEMON_DIMACS_H
Copied: hugo/trunk/src/lemon/extended_pair.h (from r1231, /hugo/trunk/src/hugo/extended_pair.h)
==============================================================================
--- /hugo/trunk/src/hugo/extended_pair.h (original)
+++ hugo/trunk/src/lemon/extended_pair.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/extended_pair.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/extended_pair.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,8 +14,8 @@
*
*/
-#ifndef HUGO_EXTENDED_PAIR_H
-#define HUGO_EXTENDED_PAIR_H
+#ifndef LEMON_EXTENDED_PAIR_H
+#define LEMON_EXTENDED_PAIR_H
template <typename T1, typename A1, typename T2, typename A2>
struct extended_pair {
Copied: hugo/trunk/src/lemon/fib_heap.h (from r1231, /hugo/trunk/src/hugo/fib_heap.h)
==============================================================================
--- /hugo/trunk/src/hugo/fib_heap.h (original)
+++ hugo/trunk/src/lemon/fib_heap.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/fib_heap.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/fib_heap.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,8 +14,8 @@
*
*/
-#ifndef HUGO_FIB_HEAP_H
-#define HUGO_FIB_HEAP_H
+#ifndef LEMON_FIB_HEAP_H
+#define LEMON_FIB_HEAP_H
///\file
///\ingroup auxdat
@@ -25,7 +25,7 @@
#include <functional>
#include <math.h>
-namespace hugo {
+namespace lemon {
/// \addtogroup auxdat
/// @{
@@ -504,7 +504,7 @@
///@}
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_FIB_HEAP_H
+#endif //LEMON_FIB_HEAP_H
Copied: hugo/trunk/src/lemon/full_graph.h (from r1231, /hugo/trunk/src/hugo/full_graph.h)
==============================================================================
--- /hugo/trunk/src/hugo/full_graph.h (original)
+++ hugo/trunk/src/lemon/full_graph.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/full_graph.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/full_graph.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,8 +14,8 @@
*
*/
-#ifndef HUGO_FULL_GRAPH_H
-#define HUGO_FULL_GRAPH_H
+#ifndef LEMON_FULL_GRAPH_H
+#define LEMON_FULL_GRAPH_H
///\ingroup graphs
///\file
@@ -24,14 +24,14 @@
#include <vector>
#include <climits>
-#include <hugo/invalid.h>
+#include <lemon/invalid.h>
-#include <hugo/map_registry.h>
-#include <hugo/array_map.h>
+#include <lemon/map_registry.h>
+#include <lemon/array_map.h>
-#include <hugo/map_defines.h>
+#include <lemon/map_defines.h>
-namespace hugo {
+namespace lemon {
/// \addtogroup graphs
/// @{
@@ -240,9 +240,9 @@
/// @}
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_FULL_GRAPH_H
+#endif //LEMON_FULL_GRAPH_H
Copied: hugo/trunk/src/lemon/graph_wrapper.h (from r1231, /hugo/trunk/src/hugo/graph_wrapper.h)
==============================================================================
--- /hugo/trunk/src/hugo/graph_wrapper.h (original)
+++ hugo/trunk/src/lemon/graph_wrapper.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/graph_wrapper.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/graph_wrapper.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,8 +14,8 @@
*
*/
-#ifndef HUGO_GRAPH_WRAPPER_H
-#define HUGO_GRAPH_WRAPPER_H
+#ifndef LEMON_GRAPH_WRAPPER_H
+#define LEMON_GRAPH_WRAPPER_H
///\ingroup gwrappers
///\file
@@ -25,17 +25,17 @@
///
///\author Marton Makai
-#include <hugo/invalid.h>
-#include <hugo/maps.h>
-#include <hugo/map_defines.h>
+#include <lemon/invalid.h>
+#include <lemon/maps.h>
+#include <lemon/map_defines.h>
#include <iostream>
-namespace hugo {
+namespace lemon {
// Graph wrappers
/// \addtogroup gwrappers
- /// A main parts of HUGOlib are the different graph structures,
+ /// A main parts of LEMON are the different graph structures,
/// generic graph algorithms, graph concepts which couple these, and
/// graph wrappers. While the previous ones are more or less clear, the
/// latter notion needs further explanation.
@@ -1221,7 +1221,7 @@
///@}
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_GRAPH_WRAPPER_H
+#endif //LEMON_GRAPH_WRAPPER_H
Copied: hugo/trunk/src/lemon/invalid.h (from r1231, /hugo/trunk/src/hugo/invalid.h)
==============================================================================
--- /hugo/trunk/src/hugo/invalid.h (original)
+++ hugo/trunk/src/lemon/invalid.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/invalid.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/invalid.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,13 +14,13 @@
*
*/
-#ifndef HUGO_INVALID_H
-#define HUGO_INVALID_H
+#ifndef LEMON_INVALID_H
+#define LEMON_INVALID_H
///\file
///\brief Definition of INVALID.
-namespace hugo {
+namespace lemon {
/// Dummy type to make it easier to make invalid iterators.
@@ -46,7 +46,7 @@
//const Invalid &INVALID = *(Invalid *)0;
const Invalid INVALID = Invalid();
-} //namespace hugo
+} //namespace lemon
#endif
Copied: hugo/trunk/src/lemon/kruskal.h (from r1231, /hugo/trunk/src/hugo/kruskal.h)
==============================================================================
--- /hugo/trunk/src/hugo/kruskal.h (original)
+++ hugo/trunk/src/lemon/kruskal.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/kruskal.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/kruskal.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,11 +14,11 @@
*
*/
-#ifndef HUGO_KRUSKAL_H
-#define HUGO_KRUSKAL_H
+#ifndef LEMON_KRUSKAL_H
+#define LEMON_KRUSKAL_H
#include <algorithm>
-#include <hugo/unionfind.h>
+#include <lemon/unionfind.h>
/**
@defgroup spantree Minimum Cost Spanning Tree Algorithms
@@ -36,7 +36,7 @@
///
///Kruskal's algorithm to compute a minimum cost tree.
-namespace hugo {
+namespace lemon {
/// \addtogroup spantree
/// @{
@@ -343,6 +343,6 @@
/// @}
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_KRUSKAL_H
+#endif //LEMON_KRUSKAL_H
Copied: hugo/trunk/src/lemon/list_graph.h (from r1231, /hugo/trunk/src/hugo/list_graph.h)
==============================================================================
--- /hugo/trunk/src/hugo/list_graph.h (original)
+++ hugo/trunk/src/lemon/list_graph.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/list_graph.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/list_graph.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,8 +14,8 @@
*
*/
-#ifndef HUGO_LIST_GRAPH_H
-#define HUGO_LIST_GRAPH_H
+#ifndef LEMON_LIST_GRAPH_H
+#define LEMON_LIST_GRAPH_H
///\ingroup graphs
///\file
@@ -24,17 +24,17 @@
#include <vector>
#include <climits>
-#include <hugo/invalid.h>
+#include <lemon/invalid.h>
-#include <hugo/map_registry.h>
-#include <hugo/array_map.h>
+#include <lemon/map_registry.h>
+#include <lemon/array_map.h>
-#include <hugo/sym_map.h>
+#include <lemon/sym_map.h>
-#include <hugo/map_defines.h>
+#include <lemon/map_defines.h>
-namespace hugo {
+namespace lemon {
/// \addtogroup graphs
/// @{
@@ -423,16 +423,16 @@
///having bidirectional edges. Here the function \c addEdge(u,v) adds a pair
///of oppositely directed edges.
///There is a new edge map type called
- ///\ref hugo::SymListGraph::SymEdgeMap "SymEdgeMap"
+ ///\ref lemon::SymListGraph::SymEdgeMap "SymEdgeMap"
///that complements this
///feature by
///storing shared values for the edge pairs. The usual
- ///\ref hugo::skeleton::StaticGraph::EdgeMap "EdgeMap"
+ ///\ref lemon::skeleton::StaticGraph::EdgeMap "EdgeMap"
///can be used
///as well.
///
///The oppositely directed edge can also be obtained easily
- ///using \ref hugo::SymListGraph::opposite() "opposite()" member function.
+ ///using \ref lemon::SymListGraph::opposite() "opposite()" member function.
///
///Here erase(Edge) deletes a pair of edges.
///
@@ -1101,6 +1101,6 @@
/// @}
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_LIST_GRAPH_H
+#endif //LEMON_LIST_GRAPH_H
Copied: hugo/trunk/src/lemon/map_bits.h (from r1231, /hugo/trunk/src/hugo/map_bits.h)
==============================================================================
--- /hugo/trunk/src/hugo/map_bits.h (original)
+++ hugo/trunk/src/lemon/map_bits.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/map_bits.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/map_bits.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,14 +14,14 @@
*
*/
-#ifndef HUGO_MAP_BITS_H
-#define HUGO_MAP_BITS_H
+#ifndef LEMON_MAP_BITS_H
+#define LEMON_MAP_BITS_H
///\ingroup graphmaps
///\file
///\brief Some utils to help implement maps.
-namespace hugo {
+namespace lemon {
/// \addtogroup graphmaps
Copied: hugo/trunk/src/lemon/map_defines.h (from r1231, /hugo/trunk/src/hugo/map_defines.h)
==============================================================================
--- /hugo/trunk/src/hugo/map_defines.h (original)
+++ hugo/trunk/src/lemon/map_defines.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/map_defines.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/map_defines.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,8 +14,8 @@
*
*/
-#ifndef HUGO_MAP_DEFINES_H
-#define HUGO_MAP_DEFINES_H
+#ifndef LEMON_MAP_DEFINES_H
+#define LEMON_MAP_DEFINES_H
///\ingroup graphmaps
///\file
Copied: hugo/trunk/src/lemon/map_iterator.h (from r1231, /hugo/trunk/src/hugo/map_iterator.h)
==============================================================================
--- /hugo/trunk/src/hugo/map_iterator.h (original)
+++ hugo/trunk/src/lemon/map_iterator.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/map_iterator.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/map_iterator.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,18 +14,18 @@
*
*/
-#ifndef HUGO_MAP_ITERATOR_H
-#define HUGO_MAP_ITERATOR_H
+#ifndef LEMON_MAP_ITERATOR_H
+#define LEMON_MAP_ITERATOR_H
#include <iterator>
-#include <hugo/extended_pair.h>
+#include <lemon/extended_pair.h>
///\ingroup graphmaps
///\file
///\brief Iterators on the maps.
-namespace hugo {
+namespace lemon {
/// \addtogroup graphmaps
/// @{
Copied: hugo/trunk/src/lemon/map_registry.h (from r1231, /hugo/trunk/src/hugo/map_registry.h)
==============================================================================
--- /hugo/trunk/src/hugo/map_registry.h (original)
+++ hugo/trunk/src/lemon/map_registry.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/map_registry.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/map_registry.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,8 +14,8 @@
*
*/
-#ifndef HUGO_MAP_REGISTRY_H
-#define HUGO_MAP_REGISTRY_H
+#ifndef LEMON_MAP_REGISTRY_H
+#define LEMON_MAP_REGISTRY_H
#include <vector>
@@ -25,7 +25,7 @@
using namespace std;
-namespace hugo {
+namespace lemon {
/// \addtogroup graphmapfactory
/// @{
Copied: hugo/trunk/src/lemon/maps.h (from r1231, /hugo/trunk/src/hugo/maps.h)
==============================================================================
--- /hugo/trunk/src/hugo/maps.h (original)
+++ hugo/trunk/src/lemon/maps.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/maps.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/maps.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,8 +14,8 @@
*
*/
-#ifndef HUGO_MAPS_H
-#define HUGO_MAPS_H
+#ifndef LEMON_MAPS_H
+#define LEMON_MAPS_H
///\file
///\brief Miscellaneous property maps
@@ -25,7 +25,7 @@
#include <map>
-namespace hugo {
+namespace lemon {
/// Base class of maps.
@@ -173,4 +173,4 @@
};
}
-#endif // HUGO_MAPS_H
+#endif // LEMON_MAPS_H
Copied: hugo/trunk/src/lemon/min_cost_flow.h (from r1231, /hugo/trunk/src/hugo/min_cost_flow.h)
==============================================================================
--- /hugo/trunk/src/hugo/min_cost_flow.h (original)
+++ hugo/trunk/src/lemon/min_cost_flow.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/min_cost_flow.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/min_cost_flow.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,20 +14,20 @@
*
*/
-#ifndef HUGO_MIN_COST_FLOW_H
-#define HUGO_MIN_COST_FLOW_H
+#ifndef LEMON_MIN_COST_FLOW_H
+#define LEMON_MIN_COST_FLOW_H
///\ingroup flowalgs
///\file
///\brief An algorithm for finding a flow of value \c k (for small values of \c k) having minimal total cost
-#include <hugo/dijkstra.h>
-#include <hugo/graph_wrapper.h>
-#include <hugo/maps.h>
+#include <lemon/dijkstra.h>
+#include <lemon/graph_wrapper.h>
+#include <lemon/maps.h>
#include <vector>
-namespace hugo {
+namespace lemon {
/// \addtogroup flowalgs
/// @{
@@ -36,7 +36,7 @@
///(for small values of \c k) having minimal total cost between 2 nodes
///
///
- /// The class \ref hugo::MinCostFlow "MinCostFlow" implements
+ /// The class \ref lemon::MinCostFlow "MinCostFlow" implements
/// an algorithm for finding a flow of value \c k
/// having minimal total cost
/// from a given source node to a given target node in an
@@ -251,6 +251,6 @@
///@}
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_MIN_COST_FLOW_H
+#endif //LEMON_MIN_COST_FLOW_H
Copied: hugo/trunk/src/lemon/path.h (from r1231, /hugo/trunk/src/hugo/path.h)
==============================================================================
--- /hugo/trunk/src/hugo/path.h (original)
+++ hugo/trunk/src/lemon/path.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/path.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/path.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -17,16 +17,16 @@
/**
@defgroup paths Path Structures
@ingroup datas
-\brief Path structures implemented in Hugo.
+\brief Path structures implemented in LEMON.
-Hugolib provides flexible data structures
+LEMON provides flexible data structures
to work with paths.
All of them have the same interface, especially they can be built or extended
using a standard Builder subclass. This make is easy to have e.g. the Dijkstra
algorithm to store its result in any kind of path structure.
-\sa hugo::skeleton::Path
+\sa lemon::skeleton::Path
*/
@@ -34,16 +34,16 @@
///\file
///\brief Classes for representing paths in graphs.
-#ifndef HUGO_PATH_H
-#define HUGO_PATH_H
+#ifndef LEMON_PATH_H
+#define LEMON_PATH_H
#include <deque>
#include <vector>
#include <algorithm>
-#include <hugo/invalid.h>
+#include <lemon/invalid.h>
-namespace hugo {
+namespace lemon {
/// \addtogroup paths
/// @{
@@ -704,6 +704,6 @@
///@}
-} // namespace hugo
+} // namespace lemon
-#endif // HUGO_PATH_H
+#endif // LEMON_PATH_H
Copied: hugo/trunk/src/lemon/preflow.h (from r1231, /hugo/trunk/src/hugo/preflow.h)
==============================================================================
--- /hugo/trunk/src/hugo/preflow.h (original)
+++ hugo/trunk/src/lemon/preflow.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/preflow.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/preflow.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,20 +14,20 @@
*
*/
-#ifndef HUGO_PREFLOW_H
-#define HUGO_PREFLOW_H
+#ifndef LEMON_PREFLOW_H
+#define LEMON_PREFLOW_H
#include <vector>
#include <queue>
-#include <hugo/invalid.h>
-#include <hugo/maps.h>
+#include <lemon/invalid.h>
+#include <lemon/maps.h>
/// \file
/// \ingroup flowalgs
/// Implementation of the preflow algorithm.
-namespace hugo {
+namespace lemon {
/// \addtogroup flowalgs
/// @{
@@ -44,8 +44,8 @@
///functions \ref setSource, \ref setTarget, \ref setCap and \ref
///setFlow.
///
- ///After running \ref hugo::Preflow::phase1() "phase1()"
- ///or \ref hugo::Preflow::run() "run()", the maximal flow
+ ///After running \ref lemon::Preflow::phase1() "phase1()"
+ ///or \ref lemon::Preflow::run() "run()", the maximal flow
///value can be obtained by calling \ref flowValue(). The minimum
///value cut can be written into a <tt>bool</tt> node map by
///calling \ref minCut(). (\ref minMinCut() and \ref maxMinCut() writes
@@ -810,9 +810,9 @@
} //relabel
};
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_PREFLOW_H
+#endif //LEMON_PREFLOW_H
Modified: hugo/trunk/src/lemon/skeletons/graph.h
==============================================================================
--- /hugo/trunk/src/hugo/skeletons/graph.h (original)
+++ hugo/trunk/src/lemon/skeletons/graph.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/skeletons/graph.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/skeletons/graph.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,17 +14,17 @@
*
*/
-#ifndef HUGO_SKELETON_GRAPH_H
-#define HUGO_SKELETON_GRAPH_H
+#ifndef LEMON_SKELETON_GRAPH_H
+#define LEMON_SKELETON_GRAPH_H
///\ingroup skeletons
///\file
///\brief Declaration of Graph.
-#include <hugo/invalid.h>
-#include <hugo/skeletons/maps.h>
+#include <lemon/invalid.h>
+#include <lemon/skeletons/maps.h>
-namespace hugo {
+namespace lemon {
namespace skeleton {
/// \addtogroup skeletons
@@ -503,8 +503,8 @@
// @}
} //namespace skeleton
-} //namespace hugo
+} //namespace lemon
-#endif // HUGO_SKELETON_GRAPH_H
+#endif // LEMON_SKELETON_GRAPH_H
Modified: hugo/trunk/src/lemon/skeletons/maps.h
==============================================================================
--- /hugo/trunk/src/hugo/skeletons/maps.h (original)
+++ hugo/trunk/src/lemon/skeletons/maps.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/skeletons/maps.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/skeletons/maps.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,14 +14,14 @@
*
*/
-#ifndef HUGO_MAPSKELETON_H
-#define HUGO_MAPSKELETON_H
+#ifndef LEMON_MAPSKELETON_H
+#define LEMON_MAPSKELETON_H
///\ingroup skeletons
///\file
///\brief Map concepts checking classes for testing and documenting.
-namespace hugo {
+namespace lemon {
namespace skeleton {
@@ -116,5 +116,5 @@
// @}
} //namespace skeleton
-} //namespace hugo
-#endif // HUGO_MAPSKELETON_H
+} //namespace lemon
+#endif // LEMON_MAPSKELETON_H
Modified: hugo/trunk/src/lemon/skeletons/path.h
==============================================================================
--- /hugo/trunk/src/hugo/skeletons/path.h (original)
+++ hugo/trunk/src/lemon/skeletons/path.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/skeletons/path.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/skeletons/path.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -18,12 +18,12 @@
///\file
///\brief Classes for representing paths in graphs.
-#ifndef HUGO_SKELETON_PATH_H
-#define HUGO_SKELETON_PATH_H
+#ifndef LEMON_SKELETON_PATH_H
+#define LEMON_SKELETON_PATH_H
-#include <hugo/invalid.h>
+#include <lemon/invalid.h>
-namespace hugo {
+namespace lemon {
namespace skeleton {
/// \addtogroup skeletons
/// @{
@@ -231,6 +231,6 @@
///@}
}
-} // namespace hugo
+} // namespace lemon
-#endif // HUGO_SKELETON_PATH_H
+#endif // LEMON_SKELETON_PATH_H
Copied: hugo/trunk/src/lemon/smart_graph.h (from r1231, /hugo/trunk/src/hugo/smart_graph.h)
==============================================================================
--- /hugo/trunk/src/hugo/smart_graph.h (original)
+++ hugo/trunk/src/lemon/smart_graph.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/smart_graph.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/smart_graph.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,8 +14,8 @@
*
*/
-#ifndef HUGO_SMART_GRAPH_H
-#define HUGO_SMART_GRAPH_H
+#ifndef LEMON_SMART_GRAPH_H
+#define LEMON_SMART_GRAPH_H
///\ingroup graphs
///\file
@@ -24,16 +24,16 @@
#include <vector>
#include <climits>
-#include <hugo/invalid.h>
+#include <lemon/invalid.h>
-#include <hugo/array_map.h>
-#include <hugo/sym_map.h>
+#include <lemon/array_map.h>
+#include <lemon/sym_map.h>
-#include <hugo/map_registry.h>
+#include <lemon/map_registry.h>
-#include <hugo/map_defines.h>
+#include <lemon/map_defines.h>
-namespace hugo {
+namespace lemon {
/// \addtogroup graphs
/// @{
@@ -356,9 +356,9 @@
};
/// @}
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_SMART_GRAPH_H
+#endif //LEMON_SMART_GRAPH_H
Copied: hugo/trunk/src/lemon/suurballe.h (from r1231, /hugo/trunk/src/hugo/suurballe.h)
==============================================================================
--- /hugo/trunk/src/hugo/suurballe.h (original)
+++ hugo/trunk/src/lemon/suurballe.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/suurballe.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/suurballe.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,19 +14,19 @@
*
*/
-#ifndef HUGO_SUURBALLE_H
-#define HUGO_SUURBALLE_H
+#ifndef LEMON_SUURBALLE_H
+#define LEMON_SUURBALLE_H
///\ingroup flowalgs
///\file
///\brief An algorithm for finding k paths of minimal total length.
-#include <hugo/maps.h>
+#include <lemon/maps.h>
#include <vector>
-#include <hugo/min_cost_flow.h>
+#include <lemon/min_cost_flow.h>
-namespace hugo {
+namespace lemon {
/// \addtogroup flowalgs
/// @{
@@ -34,7 +34,7 @@
///\brief Implementation of an algorithm for finding k edge-disjoint paths between 2 nodes
/// of minimal total length
///
- /// The class \ref hugo::Suurballe implements
+ /// The class \ref lemon::Suurballe implements
/// an algorithm for finding k edge-disjoint paths
/// from a given source node to a given target node in an
/// edge-weighted directed graph having minimal total weight (length).
@@ -187,7 +187,7 @@
///If \c j is not less than the result of previous \c run,
///then the result here will be an empty path (\c j can be 0 as well).
///
- ///\param Path The type of the path structure to put the result to (must meet hugo path concept).
+ ///\param Path The type of the path structure to put the result to (must meet lemon path concept).
///\param p The path to put the result to
///\param j Which path you want to get from the found paths (in a real application you would get the found paths iteratively)
template<typename Path>
@@ -210,6 +210,6 @@
///@}
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_SUURBALLE_H
+#endif //LEMON_SUURBALLE_H
Copied: hugo/trunk/src/lemon/sym_map.h (from r1231, /hugo/trunk/src/hugo/sym_map.h)
==============================================================================
--- /hugo/trunk/src/hugo/sym_map.h (original)
+++ hugo/trunk/src/lemon/sym_map.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/sym_map.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/sym_map.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,15 +14,15 @@
*
*/
-#ifndef HUGO_SYM_MAP_H
-#define HUGO_SYM_MAP_H
+#ifndef LEMON_SYM_MAP_H
+#define LEMON_SYM_MAP_H
///\ingroup graphmaps
///\file
///\brief Graph maps that construates and destruates
///their elements dynamically.
-namespace hugo {
+namespace lemon {
/// \addtogroup graphmaps
/// @{
Copied: hugo/trunk/src/lemon/template.h (from r1231, /hugo/trunk/src/hugo/template.h)
==============================================================================
--- /hugo/trunk/src/hugo/template.h (original)
+++ hugo/trunk/src/lemon/template.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/template.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/template.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,7 +14,7 @@
*
*/
-#ifndef HUGO_TEMPLATE_H
-#define HUGO_TEMPLATE_H
+#ifndef LEMON_TEMPLATE_H
+#define LEMON_TEMPLATE_H
-#endif // HUGO_TEMPLATE_H
+#endif // LEMON_TEMPLATE_H
Copied: hugo/trunk/src/lemon/time_measure.h (from r1231, /hugo/trunk/src/hugo/time_measure.h)
==============================================================================
--- /hugo/trunk/src/hugo/time_measure.h (original)
+++ hugo/trunk/src/lemon/time_measure.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/time_measure.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/time_measure.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,8 +14,8 @@
*
*/
-#ifndef HUGO_TIME_MEASURE_H
-#define HUGO_TIME_MEASURE_H
+#ifndef LEMON_TIME_MEASURE_H
+#define LEMON_TIME_MEASURE_H
///\ingroup misc
///\file
@@ -27,7 +27,7 @@
#include <iostream>
#include <unistd.h>
-namespace hugo {
+namespace lemon {
/// \addtogroup misc
/// @{
@@ -142,7 +142,7 @@
///Class measuring the cpu time and real time usage of the process.
///It is quite easy-to-use, here is a short example.
///\code
- ///#include<hugo/time_measure.h>
+ ///#include<lemon/time_measure.h>
///#include<iostream>
///
///int main()
@@ -222,6 +222,6 @@
/// @}
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_TIME_MEASURE_H
+#endif //LEMON_TIME_MEASURE_H
Copied: hugo/trunk/src/lemon/unionfind.h (from r1231, /hugo/trunk/src/hugo/unionfind.h)
==============================================================================
--- /hugo/trunk/src/hugo/unionfind.h (original)
+++ hugo/trunk/src/lemon/unionfind.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/unionfind.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/unionfind.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,8 +14,8 @@
*
*/
-#ifndef HUGO_UNION_FIND_H
-#define HUGO_UNION_FIND_H
+#ifndef LEMON_UNION_FIND_H
+#define LEMON_UNION_FIND_H
//!\ingroup auxdat
//!\file
@@ -30,9 +30,9 @@
#include <utility>
#include <algorithm>
-#include <hugo/invalid.h>
+#include <lemon/invalid.h>
-namespace hugo {
+namespace lemon {
//! \addtogroup auxdat
//! @{
@@ -719,6 +719,6 @@
//! @}
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_UNION_FIND_H
+#endif //LEMON_UNION_FIND_H
Copied: hugo/trunk/src/lemon/vector_map.h (from r1231, /hugo/trunk/src/hugo/vector_map.h)
==============================================================================
--- /hugo/trunk/src/hugo/vector_map.h (original)
+++ hugo/trunk/src/lemon/vector_map.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/vector_map.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/vector_map.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,19 +14,19 @@
*
*/
-#ifndef HUGO_VECTOR_MAP_H
-#define HUGO_VECTOR_MAP_H
+#ifndef LEMON_VECTOR_MAP_H
+#define LEMON_VECTOR_MAP_H
#include <vector>
-#include <hugo/map_iterator.h>
-#include <hugo/map_bits.h>
+#include <lemon/map_iterator.h>
+#include <lemon/map_bits.h>
///\ingroup graphmaps
///\file
///\brief Vector based graph maps.
-namespace hugo {
+namespace lemon {
/// \addtogroup graphmaps
/// @{
Copied: hugo/trunk/src/lemon/xy.h (from r1231, /hugo/trunk/src/hugo/xy.h)
==============================================================================
--- /hugo/trunk/src/hugo/xy.h (original)
+++ hugo/trunk/src/lemon/xy.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/xy.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/xy.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,8 +14,8 @@
*
*/
-#ifndef HUGO_XY_H
-#define HUGO_XY_H
+#ifndef LEMON_XY_H
+#define LEMON_XY_H
#include <iostream>
@@ -23,17 +23,17 @@
///\file
///\brief A simple two dimensional vector and a bounding box implementation
///
-/// The class \ref hugo::xy "xy" implements
+/// The class \ref lemon::xy "xy" implements
///a two dimensional vector with the usual
/// operations.
///
-/// The class \ref hugo::BoundingBox "BoundingBox" can be used to determine
-/// the rectangular bounding box a set of \ref hugo::xy "xy"'s.
+/// The class \ref lemon::BoundingBox "BoundingBox" can be used to determine
+/// the rectangular bounding box a set of \ref lemon::xy "xy"'s.
///
///\author Attila Bernath
-namespace hugo {
+namespace lemon {
/// \addtogroup misc
/// @{
@@ -243,6 +243,6 @@
/// @}
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_XY_H
+#endif //LEMON_XY_H
Modified: hugo/trunk/src/test/bfs_test.cc
==============================================================================
--- hugo/trunk/src/test/bfs_test.cc (original)
+++ hugo/trunk/src/test/bfs_test.cc Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/test/bfs_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/bfs_test.cc - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -15,11 +15,11 @@
*/
#include "test_tools.h"
-#include <hugo/smart_graph.h>
-#include <hugo/bfs.h>
-#include<hugo/skeletons/graph.h>
+#include <lemon/smart_graph.h>
+#include <lemon/bfs.h>
+#include<lemon/skeletons/graph.h>
-using namespace hugo;
+using namespace lemon;
const int PET_SIZE =5;
Modified: hugo/trunk/src/test/dfs_test.cc
==============================================================================
--- hugo/trunk/src/test/dfs_test.cc (original)
+++ hugo/trunk/src/test/dfs_test.cc Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/test/dfs_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/dfs_test.cc - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -15,11 +15,11 @@
*/
#include "test_tools.h"
-#include <hugo/smart_graph.h>
-#include <hugo/dfs.h>
-#include<hugo/skeletons/graph.h>
+#include <lemon/smart_graph.h>
+#include <lemon/dfs.h>
+#include<lemon/skeletons/graph.h>
-using namespace hugo;
+using namespace lemon;
const int PET_SIZE =5;
Modified: hugo/trunk/src/test/dijkstra_heap_test.cc
==============================================================================
--- hugo/trunk/src/test/dijkstra_heap_test.cc (original)
+++ hugo/trunk/src/test/dijkstra_heap_test.cc Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/test/dijkstra_heap_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/dijkstra_heap_test.cc - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -19,7 +19,7 @@
//Fibonacci heap of fib_heap.h.
//The input is a graph in standard dimacs format from the standard input (like
-//in /hugo_loc/testfiles/dimacs). It runs dijkstra.h on this graph with both
+//in /lemon_loc/testfiles/dimacs). It runs dijkstra.h on this graph with both
//heaps, checking two postconditions:
//- if the edges e=uv of the shortest path tree reported by dijkstra.h have
@@ -30,14 +30,14 @@
#include <iostream>
#include <math.h>
-#include <hugo/smart_graph.h>
-#include <hugo/dimacs.h>
-#include <hugo/dijkstra.h>
-#include <hugo/time_measure.h>
-#include <hugo/bin_heap.h>
-#include <hugo/fib_heap.h>
+#include <lemon/smart_graph.h>
+#include <lemon/dimacs.h>
+#include <lemon/dijkstra.h>
+#include <lemon/time_measure.h>
+#include <lemon/bin_heap.h>
+#include <lemon/fib_heap.h>
-using namespace hugo;
+using namespace lemon;
int main(int, char **) {
Modified: hugo/trunk/src/test/dijkstra_test.cc
==============================================================================
--- hugo/trunk/src/test/dijkstra_test.cc (original)
+++ hugo/trunk/src/test/dijkstra_test.cc Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/test/dijkstra_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/dijkstra_test.cc - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -15,11 +15,11 @@
*/
#include "test_tools.h"
-#include <hugo/smart_graph.h>
-#include <hugo/dijkstra.h>
-#include<hugo/skeletons/graph.h>
-#include<hugo/skeletons/maps.h>
-using namespace hugo;
+#include <lemon/smart_graph.h>
+#include <lemon/dijkstra.h>
+#include<lemon/skeletons/graph.h>
+#include<lemon/skeletons/maps.h>
+using namespace lemon;
const int PET_SIZE =5;
Modified: hugo/trunk/src/test/error_test.cc
==============================================================================
--- hugo/trunk/src/test/error_test.cc (original)
+++ hugo/trunk/src/test/error_test.cc Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/test/error_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/error_test.cc - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -16,9 +16,9 @@
#include <iostream>
-#include <hugo/error.h>
+#include <lemon/error.h>
#include "test_tools.h"
-using namespace hugo;
+using namespace lemon;
using std::cout;
using std::endl;
Modified: hugo/trunk/src/test/graph_test.cc
==============================================================================
--- hugo/trunk/src/test/graph_test.cc (original)
+++ hugo/trunk/src/test/graph_test.cc Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/test/graph_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/graph_test.cc - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -15,10 +15,10 @@
*/
#include<iostream>
-#include<hugo/smart_graph.h>
-#include<hugo/skeletons/graph.h>
-#include<hugo/list_graph.h>
-#include<hugo/full_graph.h>
+#include<lemon/smart_graph.h>
+#include<lemon/skeletons/graph.h>
+#include<lemon/list_graph.h>
+#include<lemon/full_graph.h>
#include"test_tools.h"
#include"graph_test.h"
@@ -33,7 +33,7 @@
conversion.
*/
-using namespace hugo;
+using namespace lemon;
template<class Graph> void bidirPetersen(Graph &G)
{
@@ -68,51 +68,51 @@
}
//Compile Graph
-template void hugo::checkCompileStaticGraph<skeleton::StaticGraph>
+template void lemon::checkCompileStaticGraph<skeleton::StaticGraph>
(skeleton::StaticGraph &);
-template void hugo::checkCompileGraph<skeleton::ExtendableGraph>
+template void lemon::checkCompileGraph<skeleton::ExtendableGraph>
(skeleton::ExtendableGraph &);
-template void hugo::checkCompileErasableGraph<skeleton::ErasableGraph>
+template void lemon::checkCompileErasableGraph<skeleton::ErasableGraph>
(skeleton::ErasableGraph &);
//Compile SmartGraph
-template void hugo::checkCompileGraph<SmartGraph>(SmartGraph &);
-template void hugo::checkCompileGraphFindEdge<SmartGraph>(SmartGraph &);
+template void lemon::checkCompileGraph<SmartGraph>(SmartGraph &);
+template void lemon::checkCompileGraphFindEdge<SmartGraph>(SmartGraph &);
//Compile SymSmartGraph
-template void hugo::checkCompileGraph<SymSmartGraph>(SymSmartGraph &);
-template void hugo::checkCompileGraphFindEdge<SymSmartGraph>(SymSmartGraph &);
+template void lemon::checkCompileGraph<SymSmartGraph>(SymSmartGraph &);
+template void lemon::checkCompileGraphFindEdge<SymSmartGraph>(SymSmartGraph &);
//Compile ListGraph
-template void hugo::checkCompileGraph<ListGraph>(ListGraph &);
-template void hugo::checkCompileErasableGraph<ListGraph>(ListGraph &);
-template void hugo::checkCompileGraphFindEdge<ListGraph>(ListGraph &);
+template void lemon::checkCompileGraph<ListGraph>(ListGraph &);
+template void lemon::checkCompileErasableGraph<ListGraph>(ListGraph &);
+template void lemon::checkCompileGraphFindEdge<ListGraph>(ListGraph &);
//Compile SymListGraph
-template void hugo::checkCompileGraph<SymListGraph>(SymListGraph &);
-template void hugo::checkCompileErasableGraph<SymListGraph>(SymListGraph &);
-template void hugo::checkCompileGraphFindEdge<SymListGraph>(SymListGraph &);
+template void lemon::checkCompileGraph<SymListGraph>(SymListGraph &);
+template void lemon::checkCompileErasableGraph<SymListGraph>(SymListGraph &);
+template void lemon::checkCompileGraphFindEdge<SymListGraph>(SymListGraph &);
//Compile FullGraph
-template void hugo::checkCompileStaticGraph<FullGraph>(FullGraph &);
-template void hugo::checkCompileGraphFindEdge<FullGraph>(FullGraph &);
+template void lemon::checkCompileStaticGraph<FullGraph>(FullGraph &);
+template void lemon::checkCompileGraphFindEdge<FullGraph>(FullGraph &);
//Compile EdgeSet <ListGraph>
-template void hugo::checkCompileGraph<EdgeSet <ListGraph> >
+template void lemon::checkCompileGraph<EdgeSet <ListGraph> >
(EdgeSet <ListGraph> &);
-template void hugo::checkCompileGraphEraseEdge<EdgeSet <ListGraph> >
+template void lemon::checkCompileGraphEraseEdge<EdgeSet <ListGraph> >
(EdgeSet <ListGraph> &);
-template void hugo::checkCompileGraphFindEdge<EdgeSet <ListGraph> >
+template void lemon::checkCompileGraphFindEdge<EdgeSet <ListGraph> >
(EdgeSet <ListGraph> &);
//Compile EdgeSet <NodeSet>
-template void hugo::checkCompileGraph<EdgeSet <NodeSet> >(EdgeSet <NodeSet> &);
-template void hugo::checkCompileGraphEraseEdge<EdgeSet <NodeSet> >
+template void lemon::checkCompileGraph<EdgeSet <NodeSet> >(EdgeSet <NodeSet> &);
+template void lemon::checkCompileGraphEraseEdge<EdgeSet <NodeSet> >
(EdgeSet <NodeSet> &);
-template void hugo::checkCompileGraphFindEdge<EdgeSet <NodeSet> >
+template void lemon::checkCompileGraphFindEdge<EdgeSet <NodeSet> >
(EdgeSet <NodeSet> &);
Modified: hugo/trunk/src/test/graph_test.h
==============================================================================
--- hugo/trunk/src/test/graph_test.h (original)
+++ hugo/trunk/src/test/graph_test.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/test/graph_test.h - Part of HUGOlib, a generic C++ optimization library
+ * src/test/graph_test.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -13,8 +13,8 @@
* purpose.
*
*/
-#ifndef HUGO_TEST_GRAPH_TEST_H
-#define HUGO_TEST_GRAPH_TEST_H
+#ifndef LEMON_TEST_GRAPH_TEST_H
+#define LEMON_TEST_GRAPH_TEST_H
#include "test_tools.h"
@@ -22,7 +22,7 @@
//! \ingroup misc
//! \file
//! \brief Some utility to test graph classes.
-namespace hugo {
+namespace lemon {
struct DummyType {
int value;
@@ -319,7 +319,7 @@
///\todo Check head(), tail() as well;
-} //namespace hugo
+} //namespace lemon
#endif
Modified: hugo/trunk/src/test/graph_wrapper_test.cc
==============================================================================
--- hugo/trunk/src/test/graph_wrapper_test.cc (original)
+++ hugo/trunk/src/test/graph_wrapper_test.cc Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/test/graph_wrapper_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/graph_wrapper_test.cc - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -15,11 +15,11 @@
*/
#include<iostream>
-#include<hugo/smart_graph.h>
-#include<hugo/skeletons/graph.h>
-#include<hugo/list_graph.h>
-#include<hugo/full_graph.h>
-#include<hugo/graph_wrapper.h>
+#include<lemon/smart_graph.h>
+#include<lemon/skeletons/graph.h>
+#include<lemon/list_graph.h>
+#include<lemon/full_graph.h>
+#include<lemon/graph_wrapper.h>
#include"test/test_tools.h"
#include"test/graph_test.h"
@@ -31,7 +31,7 @@
\todo More extensive tests are needed
*/
-using namespace hugo;
+using namespace lemon;
typedef SmartGraph Graph;
Modified: hugo/trunk/src/test/kruskal_test.cc
==============================================================================
--- hugo/trunk/src/test/kruskal_test.cc (original)
+++ hugo/trunk/src/test/kruskal_test.cc Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/test/kruskal_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/kruskal_test.cc - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -18,15 +18,15 @@
#include <vector>
#include "test_tools.h"
-#include <hugo/maps.h>
-#include <hugo/kruskal.h>
-#include <hugo/list_graph.h>
-#include <hugo/skeletons/maps.h>
-#include <hugo/skeletons/graph.h>
+#include <lemon/maps.h>
+#include <lemon/kruskal.h>
+#include <lemon/list_graph.h>
+#include <lemon/skeletons/maps.h>
+#include <lemon/skeletons/graph.h>
using namespace std;
-using namespace hugo;
+using namespace lemon;
void checkCompileKruskal()
{
Modified: hugo/trunk/src/test/min_cost_flow_test.cc
==============================================================================
--- hugo/trunk/src/test/min_cost_flow_test.cc (original)
+++ hugo/trunk/src/test/min_cost_flow_test.cc Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/test/min_cost_flow_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/min_cost_flow_test.cc - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -16,13 +16,13 @@
#include <iostream>
#include "test_tools.h"
-#include <hugo/list_graph.h>
-#include <hugo/min_cost_flow.h>
+#include <lemon/list_graph.h>
+#include <lemon/min_cost_flow.h>
//#include <path.h>
//#include <maps.h>
using namespace std;
-using namespace hugo;
+using namespace lemon;
Modified: hugo/trunk/src/test/path_test.cc
==============================================================================
--- hugo/trunk/src/test/path_test.cc (original)
+++ hugo/trunk/src/test/path_test.cc Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/test/path_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/path_test.cc - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -16,12 +16,12 @@
#include <string>
#include <iostream>
-#include <hugo/skeletons/path.h>
-#include <hugo/path.h>
-#include <hugo/list_graph.h>
+#include <lemon/skeletons/path.h>
+#include <lemon/path.h>
+#include <lemon/list_graph.h>
using namespace std;
-using namespace hugo;
+using namespace lemon;
using namespace skeleton;
template<class Path> void checkCompilePath(Path &P)
Modified: hugo/trunk/src/test/preflow_test.cc
==============================================================================
--- hugo/trunk/src/test/preflow_test.cc (original)
+++ hugo/trunk/src/test/preflow_test.cc Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/test/preflow_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/preflow_test.cc - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -18,13 +18,13 @@
#include <string>
#include "test_tools.h"
-#include <hugo/smart_graph.h>
-#include <hugo/dimacs.h>
-#include <hugo/preflow.h>
-#include <hugo/skeletons/graph.h>
-#include <hugo/skeletons/maps.h>
+#include <lemon/smart_graph.h>
+#include <lemon/dimacs.h>
+#include <lemon/preflow.h>
+#include <lemon/skeletons/graph.h>
+#include <lemon/skeletons/maps.h>
-using namespace hugo;
+using namespace lemon;
void check_Preflow()
{
Modified: hugo/trunk/src/test/suurballe_test.cc
==============================================================================
--- hugo/trunk/src/test/suurballe_test.cc (original)
+++ hugo/trunk/src/test/suurballe_test.cc Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/test/suurballe_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/suurballe_test.cc - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -15,13 +15,13 @@
*/
#include <iostream>
-#include <hugo/list_graph.h>
-#include <hugo/suurballe.h>
+#include <lemon/list_graph.h>
+#include <lemon/suurballe.h>
//#include <path.h>
#include "test_tools.h"
using namespace std;
-using namespace hugo;
+using namespace lemon;
Modified: hugo/trunk/src/test/test_tools.h
==============================================================================
--- hugo/trunk/src/test/test_tools.h (original)
+++ hugo/trunk/src/test/test_tools.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/test/test_tools.h - Part of HUGOlib, a generic C++ optimization library
+ * src/test/test_tools.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,8 +14,8 @@
*
*/
-#ifndef HUGO_TEST_TEST_TOOLS_H
-#define HUGO_TEST_TEST_TOOLS_H
+#ifndef LEMON_TEST_TEST_TOOLS_H
+#define LEMON_TEST_TEST_TOOLS_H
//! \ingroup misc
//! \file
Modified: hugo/trunk/src/test/test_tools_fail.cc
==============================================================================
--- hugo/trunk/src/test/test_tools_fail.cc (original)
+++ hugo/trunk/src/test/test_tools_fail.cc Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/test/test_tools_fail.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/test_tools_fail.cc - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
Modified: hugo/trunk/src/test/test_tools_pass.cc
==============================================================================
--- hugo/trunk/src/test/test_tools_pass.cc (original)
+++ hugo/trunk/src/test/test_tools_pass.cc Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/test/test_tools_pass.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/test_tools_pass.cc - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
Modified: hugo/trunk/src/test/time_measure_test.cc
==============================================================================
--- hugo/trunk/src/test/time_measure_test.cc (original)
+++ hugo/trunk/src/test/time_measure_test.cc Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/test/time_measure_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/time_measure_test.cc - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,14 +14,14 @@
*
*/
-#include <hugo/time_measure.h>
+#include <lemon/time_measure.h>
///\file \brief Test cases for time_measure.h
///
///\todo To be extended
-using namespace hugo;
+using namespace lemon;
int main()
{
Modified: hugo/trunk/src/test/unionfind_test.cc
==============================================================================
--- hugo/trunk/src/test/unionfind_test.cc (original)
+++ hugo/trunk/src/test/unionfind_test.cc Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/test/unionfind_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/unionfind_test.cc - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -16,11 +16,11 @@
#include <iostream>
-#include <hugo/maps.h>
-#include <hugo/unionfind.h>
+#include <lemon/maps.h>
+#include <lemon/unionfind.h>
#include "test_tools.h"
-using namespace hugo;
+using namespace lemon;
using namespace std;
template <typename T>
Modified: hugo/trunk/src/test/xy_test.cc
==============================================================================
--- hugo/trunk/src/test/xy_test.cc (original)
+++ hugo/trunk/src/test/xy_test.cc Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/test/xy_test.cc - Part of HUGOlib, a generic C++ optimization library
+ * src/test/xy_test.cc - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,12 +14,12 @@
*
*/
-#include <hugo/xy.h>
+#include <lemon/xy.h>
#include <iostream>
#include "test_tools.h"
using namespace std;
-using namespace hugo;
+using namespace lemon;
int main()
{
Modified: hugo/trunk/src/work/akos/loader_demo.cc
==============================================================================
--- hugo/trunk/src/work/akos/loader_demo.cc (original)
+++ hugo/trunk/src/work/akos/loader_demo.cc Wed Sep 29 17:30:04 2004
@@ -4,7 +4,7 @@
#include <bfs_iterator.hh>
#include <loader.h>
-using namespace hugo;
+using namespace lemon;
int main(int, char **) {
typedef ListGraph::NodeIt NodeIt;
Modified: hugo/trunk/src/work/alpar/bfs-named-param.cc
==============================================================================
--- hugo/trunk/src/work/alpar/bfs-named-param.cc (original)
+++ hugo/trunk/src/work/alpar/bfs-named-param.cc Wed Sep 29 17:30:04 2004
@@ -1,11 +1,11 @@
// -*- mode:C++ -*-
-#include <hugo/smart_graph.h>
-#include <hugo/maps.h>
+#include <lemon/smart_graph.h>
+#include <lemon/maps.h>
#include <vector>
#include <iostream>
-using namespace hugo;
+using namespace lemon;
struct _BFS_DEFAULT_VIS {};
struct _BFS_CUSTOM_VIS {};
Modified: hugo/trunk/src/work/alpar/boolmap_iter.cc
==============================================================================
--- hugo/trunk/src/work/alpar/boolmap_iter.cc (original)
+++ hugo/trunk/src/work/alpar/boolmap_iter.cc Wed Sep 29 17:30:04 2004
@@ -2,7 +2,7 @@
#include <vector>
#include <smart_graph.h>
-using namespace hugo;
+using namespace lemon;
///\todo This is only a static map!
///
Modified: hugo/trunk/src/work/alpar/f_ed_ka.h
==============================================================================
--- hugo/trunk/src/work/alpar/f_ed_ka.h (original)
+++ hugo/trunk/src/work/alpar/f_ed_ka.h Wed Sep 29 17:30:04 2004
@@ -11,7 +11,7 @@
//#include <bfs_iterator.hh>
-namespace hugo {
+namespace lemon {
template <typename Graph, typename FlowMap, typename CapacityMap>
typename FlowMap::ValueType maxFlow(Graph &G,
FlowMap &f,
@@ -114,6 +114,6 @@
goto augment; // Vivat goto forever!
}
-} // namespace hugo
+} // namespace lemon
#endif //EDMONDS_KARP_HH
Modified: hugo/trunk/src/work/alpar/f_ed_ka_demo.cc
==============================================================================
--- hugo/trunk/src/work/alpar/f_ed_ka_demo.cc (original)
+++ hugo/trunk/src/work/alpar/f_ed_ka_demo.cc Wed Sep 29 17:30:04 2004
@@ -8,7 +8,7 @@
#include "f_ed_ka.h"
#include "../marci/time_measure.h"
-using namespace hugo;
+using namespace lemon;
// Use a DIMACS max flow file as stdin.
// read_dimacs_demo < dimacs_max_flow_file
Modified: hugo/trunk/src/work/alpar/gwrapper.h
==============================================================================
--- hugo/trunk/src/work/alpar/gwrapper.h (original)
+++ hugo/trunk/src/work/alpar/gwrapper.h Wed Sep 29 17:30:04 2004
@@ -2,7 +2,7 @@
#ifndef GRAPH_WRAPPER_H
#define GRAPH_WRAPPER_H
-namespace hugo {
+namespace lemon {
template<typename G>
class TrivGraphWrapper
Modified: hugo/trunk/src/work/alpar/list_graph_demo.cc
==============================================================================
--- hugo/trunk/src/work/alpar/list_graph_demo.cc (original)
+++ hugo/trunk/src/work/alpar/list_graph_demo.cc Wed Sep 29 17:30:04 2004
@@ -4,7 +4,7 @@
#include <iostream>
#include <vector>
-using namespace hugo;
+using namespace lemon;
typedef ListGraph Graph;
//typedef Graph Graph;
Modified: hugo/trunk/src/work/alpar/rw_nonref_map.cc
==============================================================================
--- hugo/trunk/src/work/alpar/rw_nonref_map.cc (original)
+++ hugo/trunk/src/work/alpar/rw_nonref_map.cc Wed Sep 29 17:30:04 2004
@@ -1,7 +1,7 @@
#include <iostream>
#include <smart_graph.h>
-using namespace hugo;
+using namespace lemon;
template<class GG,class TT>
class CinCoutMap
Modified: hugo/trunk/src/work/alpar/smart_graph_demo.cc
==============================================================================
--- hugo/trunk/src/work/alpar/smart_graph_demo.cc (original)
+++ hugo/trunk/src/work/alpar/smart_graph_demo.cc Wed Sep 29 17:30:04 2004
@@ -4,7 +4,7 @@
#include <iostream>
#include <vector>
-using namespace hugo;
+using namespace lemon;
typedef SmartGraph Graph;
//typedef Graph Graph;
Modified: hugo/trunk/src/work/athos/bfs_test.cc
==============================================================================
--- hugo/trunk/src/work/athos/bfs_test.cc (original)
+++ hugo/trunk/src/work/athos/bfs_test.cc Wed Sep 29 17:30:04 2004
@@ -4,12 +4,12 @@
#include <sage_graph.h>
//#include <smart_graph.h>
-#include <hugo/dimacs.h>
-#include <hugo/time_measure.h>
-#include <hugo/for_each_macros.h>
+#include <lemon/dimacs.h>
+#include <lemon/time_measure.h>
+#include <lemon/for_each_macros.h>
#include <bfs_dfs.h>
-using namespace hugo;
+using namespace lemon;
int main() {
typedef SageGraph Graph;
Modified: hugo/trunk/src/work/athos/dijkstra_at.h
==============================================================================
--- hugo/trunk/src/work/athos/dijkstra_at.h (original)
+++ hugo/trunk/src/work/athos/dijkstra_at.h Wed Sep 29 17:30:04 2004
@@ -24,7 +24,7 @@
using namespace std;
-namespace hugo {
+namespace lemon {
template <typename graph_type, typename T>
class dijkstra_at {
@@ -118,6 +118,6 @@
}; //class dijkstra_at
-}//namespace hugo
+}//namespace lemon
#endif //DIJKSTRA_AT
Modified: hugo/trunk/src/work/athos/dijkstra_demo.cc
==============================================================================
--- hugo/trunk/src/work/athos/dijkstra_demo.cc (original)
+++ hugo/trunk/src/work/athos/dijkstra_demo.cc Wed Sep 29 17:30:04 2004
@@ -5,7 +5,7 @@
//#include "marci_property_vector.hh"
#include <dijkstra_at.h>
-using namespace hugo;
+using namespace lemon;
int main (int, char*[])
Modified: hugo/trunk/src/work/athos/kruskal.h
==============================================================================
--- hugo/trunk/src/work/athos/kruskal.h (original)
+++ hugo/trunk/src/work/athos/kruskal.h Wed Sep 29 17:30:04 2004
@@ -7,7 +7,7 @@
#include <union_find.h>
-namespace hugo {
+namespace lemon {
template <typename graph_type, typename T>
class Kruskal {
@@ -56,6 +56,6 @@
}
-}//namespacc hugo
+}//namespacc lemon
#endif
Modified: hugo/trunk/src/work/athos/min_cost_flow.cc
==============================================================================
--- hugo/trunk/src/work/athos/min_cost_flow.cc (original)
+++ hugo/trunk/src/work/athos/min_cost_flow.cc Wed Sep 29 17:30:04 2004
@@ -1,12 +1,12 @@
#include <iostream>
//#include "test_tools.h"
-#include <hugo/list_graph.h>
+#include <lemon/list_graph.h>
#include <mincostflow.h>
//#include <path.h>
//#include <maps.h>
using namespace std;
-using namespace hugo;
+using namespace lemon;
Modified: hugo/trunk/src/work/athos/mincostflow.h
==============================================================================
--- hugo/trunk/src/work/athos/mincostflow.h (original)
+++ hugo/trunk/src/work/athos/mincostflow.h Wed Sep 29 17:30:04 2004
@@ -1,23 +1,23 @@
// -*- c++ -*-
-#ifndef HUGO_MINCOSTFLOW_H
-#define HUGO_MINCOSTFLOW_H
+#ifndef LEMON_MINCOSTFLOW_H
+#define LEMON_MINCOSTFLOW_H
///\ingroup galgs
///\file
///\brief An algorithm for finding the minimum cost flow of given value in an uncapacitated network
-#include <hugo/dijkstra.h>
-#include <hugo/graph_wrapper.h>
-#include <hugo/maps.h>
+#include <lemon/dijkstra.h>
+#include <lemon/graph_wrapper.h>
+#include <lemon/maps.h>
#include <vector>
#include <list>
#include <values.h>
-#include <hugo/for_each_macros.h>
-#include <hugo/unionfind.h>
-#include <hugo/bin_heap.h>
+#include <lemon/for_each_macros.h>
+#include <lemon/unionfind.h>
+#include <lemon/bin_heap.h>
#include <bfs_dfs.h>
-namespace hugo {
+namespace lemon {
/// \addtogroup galgs
/// @{
@@ -26,7 +26,7 @@
/// flow problem in an uncapacitated network
///
///
- /// The class \ref hugo::MinCostFlow "MinCostFlow" implements
+ /// The class \ref lemon::MinCostFlow "MinCostFlow" implements
/// an algorithm for solving the following general minimum cost flow problem>
///
///
@@ -508,6 +508,6 @@
///@}
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_MINCOSTFLOW_H
+#endif //LEMON_MINCOSTFLOW_H
Modified: hugo/trunk/src/work/athos/minlength_demo.cc
==============================================================================
--- hugo/trunk/src/work/athos/minlength_demo.cc (original)
+++ hugo/trunk/src/work/athos/minlength_demo.cc Wed Sep 29 17:30:04 2004
@@ -2,12 +2,12 @@
#include <fstream>
#include <list_graph.h>
-#include <hugo/dimacs.h>
-#include <hugo/time_measure.h>
+#include <lemon/dimacs.h>
+#include <lemon/time_measure.h>
#include "minlengthpaths.h"
//#include <time_measure.h>
-using namespace hugo;
+using namespace lemon;
// Use a DIMACS max flow file as stdin.
// read_dimacs_demo < dimacs_max_flow_file
Modified: hugo/trunk/src/work/athos/old/minlengthpaths.h
==============================================================================
--- hugo/trunk/src/work/athos/old/minlengthpaths.h (original)
+++ hugo/trunk/src/work/athos/old/minlengthpaths.h Wed Sep 29 17:30:04 2004
@@ -1,19 +1,19 @@
// -*- c++ -*-
-#ifndef HUGO_MINLENGTHPATHS_H
-#define HUGO_MINLENGTHPATHS_H
+#ifndef LEMON_MINLENGTHPATHS_H
+#define LEMON_MINLENGTHPATHS_H
///\ingroup galgs
///\file
///\brief An algorithm for finding k paths of minimal total length.
#include <iostream>
-#include <hugo/dijkstra.h>
-#include <hugo/graph_wrapper.h>
-#include <hugo/maps.h>
+#include <lemon/dijkstra.h>
+#include <lemon/graph_wrapper.h>
+#include <lemon/maps.h>
#include <vector>
-namespace hugo {
+namespace lemon {
/// \addtogroup galgs
/// @{
@@ -21,7 +21,7 @@
///\brief Implementation of an algorithm for finding k paths between 2 nodes
/// of minimal total length
///
- /// The class \ref hugo::MinLengthPaths "MinLengthPaths" implements
+ /// The class \ref lemon::MinLengthPaths "MinLengthPaths" implements
/// an algorithm for finding k edge-disjoint paths
/// from a given source node to a given target node in an
/// edge-weighted directed graph having minimal total weigth (length).
@@ -197,6 +197,6 @@
///@}
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_MINLENGTHPATHS_H
+#endif //LEMON_MINLENGTHPATHS_H
Modified: hugo/trunk/src/work/athos/pf_demo.cc
==============================================================================
--- hugo/trunk/src/work/athos/pf_demo.cc (original)
+++ hugo/trunk/src/work/athos/pf_demo.cc Wed Sep 29 17:30:04 2004
@@ -7,7 +7,7 @@
//#include "marci_property_vector.hh"
#include "preflow_push.hh"
-using namespace hugo;
+using namespace lemon;
int main (int, char*[])
Modified: hugo/trunk/src/work/athos/preflow_push_wogw.h
==============================================================================
--- hugo/trunk/src/work/athos/preflow_push_wogw.h (original)
+++ hugo/trunk/src/work/athos/preflow_push_wogw.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
-#ifndef HUGO_PREFLOW_PUSH_HH
-#define HUGO_PREFLOW_PUSH_HH
+#ifndef LEMON_PREFLOW_PUSH_HH
+#define LEMON_PREFLOW_PUSH_HH
//#include <algorithm>
#include <list>
@@ -13,7 +13,7 @@
using namespace std;
-namespace hugo {
+namespace lemon {
template <typename Graph, typename T>
class preflow_push {
@@ -458,6 +458,6 @@
}//run
-}//namespace hugo
+}//namespace lemon
#endif //PREFLOW_PUSH_HH
Modified: hugo/trunk/src/work/athos/suurballe.cc
==============================================================================
--- hugo/trunk/src/work/athos/suurballe.cc (original)
+++ hugo/trunk/src/work/athos/suurballe.cc Wed Sep 29 17:30:04 2004
@@ -6,7 +6,7 @@
#include <list_graph.h>
#include <minlengthpaths.h>
-using namespace hugo;
+using namespace lemon;
int main()
Modified: hugo/trunk/src/work/athos/uf_demo.cc
==============================================================================
--- hugo/trunk/src/work/athos/uf_demo.cc (original)
+++ hugo/trunk/src/work/athos/uf_demo.cc Wed Sep 29 17:30:04 2004
@@ -4,7 +4,7 @@
#include <union_find.h>
#include <iostream>
#include <list_graph.hh>
-using namespace hugo;
+using namespace lemon;
using namespace std;
int main (int, char*[])
Modified: hugo/trunk/src/work/athos/union_find.h
==============================================================================
--- hugo/trunk/src/work/athos/union_find.h (original)
+++ hugo/trunk/src/work/athos/union_find.h Wed Sep 29 17:30:04 2004
@@ -13,7 +13,7 @@
//#include <map>
-namespace hugo {
+namespace lemon {
template <typename KeyType, typename KeyIntMap>
class UnionFind {
@@ -90,5 +90,5 @@
}//unio
};
-}//namespace hugo
+}//namespace lemon
#endif
Modified: hugo/trunk/src/work/athos/xy/boundingbox.cc
==============================================================================
--- hugo/trunk/src/work/athos/xy/boundingbox.cc (original)
+++ hugo/trunk/src/work/athos/xy/boundingbox.cc Wed Sep 29 17:30:04 2004
@@ -2,7 +2,7 @@
#include <iostream>
using namespace std;
-using namespace hugo;
+using namespace lemon;
int main()
{
xy<int> z;
Modified: hugo/trunk/src/work/athos/xy/xy.cc
==============================================================================
--- hugo/trunk/src/work/athos/xy/xy.cc (original)
+++ hugo/trunk/src/work/athos/xy/xy.cc Wed Sep 29 17:30:04 2004
@@ -2,7 +2,7 @@
#include <iostream>
#include <vector>
using namespace std;
-using namespace hugo;
+using namespace lemon;
int main()
Modified: hugo/trunk/src/work/bin_heap_demo.cc
==============================================================================
--- hugo/trunk/src/work/bin_heap_demo.cc (original)
+++ hugo/trunk/src/work/bin_heap_demo.cc Wed Sep 29 17:30:04 2004
@@ -2,9 +2,9 @@
#include <string>
#include <map>
-#include <hugo/bin_heap.h>
+#include <lemon/bin_heap.h>
-using namespace hugo;
+using namespace lemon;
using namespace std;
class string_int_map;
Modified: hugo/trunk/src/work/deba/array_map_factory.h
==============================================================================
--- hugo/trunk/src/work/deba/array_map_factory.h (original)
+++ hugo/trunk/src/work/deba/array_map_factory.h Wed Sep 29 17:30:04 2004
@@ -6,7 +6,7 @@
#include "extended_pair.h"
-namespace hugo {
+namespace lemon {
template <typename MapRegistry> class ArrayMapFactory {
Modified: hugo/trunk/src/work/deba/bin_heap.h
==============================================================================
--- hugo/trunk/src/work/deba/bin_heap.h (original)
+++ hugo/trunk/src/work/deba/bin_heap.h Wed Sep 29 17:30:04 2004
@@ -58,8 +58,8 @@
*/
-#ifndef HUGO_BIN_HEAP_H
-#define HUGO_BIN_HEAP_H
+#ifndef LEMON_BIN_HEAP_H
+#define LEMON_BIN_HEAP_H
///\ingroup auxdat
///\file
@@ -69,7 +69,7 @@
#include <utility>
#include <functional>
-namespace hugo {
+namespace lemon {
/// \addtogroup auxdat
/// @{
@@ -241,6 +241,6 @@
///@}
-} // namespace hugo
+} // namespace lemon
#endif // BIN_HEAP_HH
Modified: hugo/trunk/src/work/deba/dijkstra.h
==============================================================================
--- hugo/trunk/src/work/deba/dijkstra.h (original)
+++ hugo/trunk/src/work/deba/dijkstra.h Wed Sep 29 17:30:04 2004
@@ -1,15 +1,15 @@
// -*- C++ -*-
-#ifndef HUGO_DIJKSTRA_H
-#define HUGO_DIJKSTRA_H
+#ifndef LEMON_DIJKSTRA_H
+#define LEMON_DIJKSTRA_H
///\ingroup galgs
///\file
///\brief Dijkstra algorithm.
-#include <hugo/bin_heap.h>
-#include <hugo/invalid.h>
+#include <lemon/bin_heap.h>
+#include <lemon/invalid.h>
-namespace hugo {
+namespace lemon {
/// \addtogroup galgs
/// @{
@@ -322,7 +322,7 @@
/// @}
-} //END OF NAMESPACE HUGO
+} //END OF NAMESPACE LEMON
#endif
Modified: hugo/trunk/src/work/deba/invalid.h
==============================================================================
--- hugo/trunk/src/work/deba/invalid.h (original)
+++ hugo/trunk/src/work/deba/invalid.h Wed Sep 29 17:30:04 2004
@@ -1,12 +1,12 @@
// -*- mode:C++ -*-
-#ifndef HUGO_INVALID_H
-#define HUGO_INVALID_H
+#ifndef LEMON_INVALID_H
+#define LEMON_INVALID_H
///\file
///\brief Definition of INVALID.
-namespace hugo {
+namespace lemon {
/// Dummy type to make it easier to make invalid iterators.
@@ -32,7 +32,7 @@
//const Invalid &INVALID = *(Invalid *)0;
const Invalid INVALID = Invalid();
-} //namespace hugo
+} //namespace lemon
#endif
Modified: hugo/trunk/src/work/deba/list_graph.h
==============================================================================
--- hugo/trunk/src/work/deba/list_graph.h (original)
+++ hugo/trunk/src/work/deba/list_graph.h Wed Sep 29 17:30:04 2004
@@ -1,7 +1,7 @@
// -*- mode:C++ -*-
-#ifndef HUGO_LIST_GRAPH_H
-#define HUGO_LIST_GRAPH_H
+#ifndef LEMON_LIST_GRAPH_H
+#define LEMON_LIST_GRAPH_H
///\ingroup graphs
///\file
@@ -17,7 +17,7 @@
#include "map_defines.h"
-namespace hugo {
+namespace lemon {
/// \addtogroup graphs
/// @{
@@ -396,4 +396,4 @@
}
-#endif //HUGO_LIST_GRAPH_H
+#endif //LEMON_LIST_GRAPH_H
Modified: hugo/trunk/src/work/deba/map_registry.h
==============================================================================
--- hugo/trunk/src/work/deba/map_registry.h (original)
+++ hugo/trunk/src/work/deba/map_registry.h Wed Sep 29 17:30:04 2004
@@ -5,7 +5,7 @@
using namespace std;
-namespace hugo {
+namespace lemon {
/**
* Registry class to register edge or node maps into the graph. The
Modified: hugo/trunk/src/work/deba/pac_map_factory.h
==============================================================================
--- hugo/trunk/src/work/deba/pac_map_factory.h (original)
+++ hugo/trunk/src/work/deba/pac_map_factory.h Wed Sep 29 17:30:04 2004
@@ -8,7 +8,7 @@
libary's pair associative containers as a graph map.
*/
-namespace hugo {
+namespace lemon {
template <typename G, typename K, typename KIt, template <typename, typename> class PAC>
class PacMapFactory {
Modified: hugo/trunk/src/work/deba/vector_map_factory.h
==============================================================================
--- hugo/trunk/src/work/deba/vector_map_factory.h (original)
+++ hugo/trunk/src/work/deba/vector_map_factory.h Wed Sep 29 17:30:04 2004
@@ -6,7 +6,7 @@
#include "extended_pair.h"
-namespace hugo {
+namespace lemon {
/** The VectorMapFactory template class is a factory class
* to create maps for the edge and nodes. This map factory
Modified: hugo/trunk/src/work/iterator_bfs_dfs_demo.cc
==============================================================================
--- hugo/trunk/src/work/iterator_bfs_dfs_demo.cc (original)
+++ hugo/trunk/src/work/iterator_bfs_dfs_demo.cc Wed Sep 29 17:30:04 2004
@@ -5,7 +5,7 @@
#include <list_graph.hh>
#include <bfs_iterator.hh>
-using namespace hugo;
+using namespace lemon;
int main (int, char*[])
{
Modified: hugo/trunk/src/work/jacint/graph_gen.h
==============================================================================
--- hugo/trunk/src/work/jacint/graph_gen.h (original)
+++ hugo/trunk/src/work/jacint/graph_gen.h Wed Sep 29 17:30:04 2004
@@ -10,7 +10,7 @@
///
// ///\author Marton Makai
-namespace hugo {
+namespace lemon {
/**
@@ -117,4 +117,4 @@
g.addEdge(s_nodes[i], t_nodes[j]);
}
-} //namespace hugo
+} //namespace lemon
Modified: hugo/trunk/src/work/jacint/ledacomp.cc
==============================================================================
--- hugo/trunk/src/work/jacint/ledacomp.cc (original)
+++ hugo/trunk/src/work/jacint/ledacomp.cc Wed Sep 29 17:30:04 2004
@@ -41,7 +41,7 @@
// return int( double(m) * rand() / (RAND_MAX + 1.0) );
// }
-using namespace hugo;
+using namespace lemon;
int main() {
Modified: hugo/trunk/src/work/jacint/max_flow.h
==============================================================================
--- hugo/trunk/src/work/jacint/max_flow.h (original)
+++ hugo/trunk/src/work/jacint/max_flow.h Wed Sep 29 17:30:04 2004
@@ -1,22 +1,22 @@
// -*- C++ -*-
-#ifndef HUGO_MAX_FLOW_H
-#define HUGO_MAX_FLOW_H
+#ifndef LEMON_MAX_FLOW_H
+#define LEMON_MAX_FLOW_H
#include <vector>
#include <queue>
#include <stack>
-#include <hugo/graph_wrapper.h>
+#include <lemon/graph_wrapper.h>
#include <bfs_dfs.h>
-#include <hugo/invalid.h>
-#include <hugo/maps.h>
-#include <hugo/for_each_macros.h>
+#include <lemon/invalid.h>
+#include <lemon/maps.h>
+#include <lemon/for_each_macros.h>
/// \file
/// \brief Maximum flow algorithms.
/// \ingroup galgs
-namespace hugo {
+namespace lemon {
/// \addtogroup galgs
/// @{
@@ -1193,7 +1193,7 @@
free1(erasing_res_graph);
dfs.pushAndSetReached
- ///\bug hugo 0.2
+ ///\bug lemon 0.2
(typename ErasingResGW::Node
(typename FilterResGW::Node
(typename ResGW::Node(s)
@@ -1260,9 +1260,9 @@
}
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_MAX_FLOW_H
+#endif //LEMON_MAX_FLOW_H
Modified: hugo/trunk/src/work/jacint/max_flow_bug.cc
==============================================================================
--- hugo/trunk/src/work/jacint/max_flow_bug.cc (original)
+++ hugo/trunk/src/work/jacint/max_flow_bug.cc Wed Sep 29 17:30:04 2004
@@ -1,13 +1,13 @@
#include <iostream>
-//#include <hugo/list_graph.h>
+//#include <lemon/list_graph.h>
#include <sage_graph.h>
-#include <hugo/dimacs.h>
-#include <hugo/max_flow.h>
+#include <lemon/dimacs.h>
+#include <lemon/max_flow.h>
//#include <max_flow_no_stack.h>
-#include <hugo/time_measure.h>
+#include <lemon/time_measure.h>
-using namespace hugo;
+using namespace lemon;
int main(int, char **) {
Modified: hugo/trunk/src/work/jacint/max_flow_test.cc
==============================================================================
--- hugo/trunk/src/work/jacint/max_flow_test.cc (original)
+++ hugo/trunk/src/work/jacint/max_flow_test.cc Wed Sep 29 17:30:04 2004
@@ -1,12 +1,12 @@
#include <iostream>
-#include <hugo/list_graph.h>
-#include <hugo/dimacs.h>
+#include <lemon/list_graph.h>
+#include <lemon/dimacs.h>
#include <max_flow.h>
#include <max_flow_no_stack.h>
-#include <hugo/time_measure.h>
+#include <lemon/time_measure.h>
-using namespace hugo;
+using namespace lemon;
int main(int, char **) {
Modified: hugo/trunk/src/work/jacint/max_matching.cc
==============================================================================
--- hugo/trunk/src/work/jacint/max_matching.cc (original)
+++ hugo/trunk/src/work/jacint/max_matching.cc Wed Sep 29 17:30:04 2004
@@ -10,7 +10,7 @@
#include <time_measure.h>
#include <graph_wrapper.h>
-using namespace hugo;
+using namespace lemon;
int main(int, char **) {
Modified: hugo/trunk/src/work/jacint/max_matching.h
==============================================================================
--- hugo/trunk/src/work/jacint/max_matching.h (original)
+++ hugo/trunk/src/work/jacint/max_matching.h Wed Sep 29 17:30:04 2004
@@ -1,6 +1,6 @@
// -*- C++ -*-
-#ifndef HUGO_MAX_MATCHING_H
-#define HUGO_MAX_MATCHING_H
+#ifndef LEMON_MAX_MATCHING_H
+#define LEMON_MAX_MATCHING_H
///\ingroup galgs
///\file
@@ -11,7 +11,7 @@
#include <invalid.h>
#include <unionfind.h>
-namespace hugo {
+namespace lemon {
/// \addtogroup galgs
/// @{
@@ -564,6 +564,6 @@
/// @}
-} //END OF NAMESPACE HUGO
+} //END OF NAMESPACE LEMON
#endif //EDMONDS_H
Modified: hugo/trunk/src/work/jacint/max_save.h
==============================================================================
--- hugo/trunk/src/work/jacint/max_save.h (original)
+++ hugo/trunk/src/work/jacint/max_save.h Wed Sep 29 17:30:04 2004
@@ -1,6 +1,6 @@
// -*- C++ -*-
-#ifndef HUGO_MAX_FLOW_H
-#define HUGO_MAX_FLOW_H
+#ifndef LEMON_MAX_FLOW_H
+#define LEMON_MAX_FLOW_H
///\ingroup galgs
///\file
@@ -22,7 +22,7 @@
/// \file
/// \brief Dimacs file format reader.
-namespace hugo {
+namespace lemon {
/// \addtogroup galgs
/// @{
@@ -1127,9 +1127,9 @@
/// @}
-} //END OF NAMESPACE HUGO
+} //END OF NAMESPACE LEMON
-#endif //HUGO_MAX_FLOW_H
+#endif //LEMON_MAX_FLOW_H
Modified: hugo/trunk/src/work/jacint/preflow.cc
==============================================================================
--- hugo/trunk/src/work/jacint/preflow.cc (original)
+++ hugo/trunk/src/work/jacint/preflow.cc Wed Sep 29 17:30:04 2004
@@ -5,7 +5,7 @@
#include <preflow.h>
#include <time_measure.h>
-using namespace hugo;
+using namespace lemon;
int main(int, char **) {
Modified: hugo/trunk/src/work/jacint/preflow_excess.h
==============================================================================
--- hugo/trunk/src/work/jacint/preflow_excess.h (original)
+++ hugo/trunk/src/work/jacint/preflow_excess.h Wed Sep 29 17:30:04 2004
@@ -43,8 +43,8 @@
*/
-#ifndef HUGO_PREFLOW_H
-#define HUGO_PREFLOW_H
+#ifndef LEMON_PREFLOW_H
+#define LEMON_PREFLOW_H
#define H0 20
#define H1 1
@@ -53,7 +53,7 @@
#include <queue>
#include <stack>
-namespace hugo {
+namespace lemon {
template <typename Graph, typename T,
typename CapMap=typename Graph::template EdgeMap<T>,
@@ -655,7 +655,7 @@
};
-} //namespace hugo
+} //namespace lemon
#endif //PREFLOW_H
Modified: hugo/trunk/src/work/jacint/preflow_excess_test.cc
==============================================================================
--- hugo/trunk/src/work/jacint/preflow_excess_test.cc (original)
+++ hugo/trunk/src/work/jacint/preflow_excess_test.cc Wed Sep 29 17:30:04 2004
@@ -11,7 +11,7 @@
#include <preflow_excess.h>
#include <time_measure.h>
-using namespace hugo;
+using namespace lemon;
int main(int, char **) {
Modified: hugo/trunk/src/work/jacint/preflow_res.h
==============================================================================
--- hugo/trunk/src/work/jacint/preflow_res.h (original)
+++ hugo/trunk/src/work/jacint/preflow_res.h Wed Sep 29 17:30:04 2004
@@ -1,7 +1,7 @@
// -*- C++ -*-
//The same as preflow.h, using ResGraphWrapper
-#ifndef HUGO_PREFLOW_RES_H
-#define HUGO_PREFLOW_RES_H
+#ifndef LEMON_PREFLOW_RES_H
+#define LEMON_PREFLOW_RES_H
#define H0 20
#define H1 1
@@ -12,7 +12,7 @@
#include<iostream>
-namespace hugo {
+namespace lemon {
template <typename Graph, typename T,
typename CapMap=typename Graph::template EdgeMap<T>,
@@ -486,9 +486,9 @@
};
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_PREFLOW_RES_H
+#endif //LEMON_PREFLOW_RES_H
Modified: hugo/trunk/src/work/jacint/prim.cc
==============================================================================
--- hugo/trunk/src/work/jacint/prim.cc (original)
+++ hugo/trunk/src/work/jacint/prim.cc Wed Sep 29 17:30:04 2004
@@ -10,7 +10,7 @@
#include <bin_heap.h>
#include <fib_heap.h>
-using namespace hugo;
+using namespace lemon;
int main(int, char **) {
typedef SmartGraph::Node Node;
Modified: hugo/trunk/src/work/jacint/prim.h
==============================================================================
--- hugo/trunk/src/work/jacint/prim.h (original)
+++ hugo/trunk/src/work/jacint/prim.h Wed Sep 29 17:30:04 2004
@@ -29,13 +29,13 @@
*
*/
-#ifndef HUGO_PRIM_H
-#define HUGO_PRIM_H
+#ifndef LEMON_PRIM_H
+#define LEMON_PRIM_H
#include <fib_heap.h>
#include <invalid.h>
-namespace hugo {
+namespace lemon {
template <typename Graph, typename T,
typename Heap=FibHeap<typename Graph::Node, T,
Modified: hugo/trunk/src/work/johanna/contract_wrapper.h
==============================================================================
--- hugo/trunk/src/work/johanna/contract_wrapper.h (original)
+++ hugo/trunk/src/work/johanna/contract_wrapper.h Wed Sep 29 17:30:04 2004
@@ -1,11 +1,11 @@
// -*- C++ -*- //
-#ifndef HUGO_CONTRACT_WRAPPER
-#define HUGO_CONTRACT_WRAPPER
+#ifndef LEMON_CONTRACT_WRAPPER
+#define LEMON_CONTRACT_WRAPPER
#include <graph_wrapper.h>
-namespace hugo {
+namespace lemon {
template<typename Graph>
class ConractWrapper : public GraphWrapper<const Graph> {
Modified: hugo/trunk/src/work/johanna/ma_order.h
==============================================================================
--- hugo/trunk/src/work/johanna/ma_order.h (original)
+++ hugo/trunk/src/work/johanna/ma_order.h Wed Sep 29 17:30:04 2004
@@ -1,13 +1,13 @@
// -*- C++ -*- //
-#ifndef HUGO_MA_ORDER_H
-#define HUGO_MA_ORDER_H
+#ifndef LEMON_MA_ORDER_H
+#define LEMON_MA_ORDER_H
#include <vector>
#include <functional>
#include <bin_heap.h>
-namespace hugo {
+namespace lemon {
template <typename Graph,
typename Heap = BinHeap<typename Graph::Node, int,
@@ -82,6 +82,6 @@
};
-} // namespace hugo
+} // namespace lemon
-#endif // HUGO_MA_ORDER_H
+#endif // LEMON_MA_ORDER_H
Modified: hugo/trunk/src/work/johanna/ma_order_test.cc
==============================================================================
--- hugo/trunk/src/work/johanna/ma_order_test.cc (original)
+++ hugo/trunk/src/work/johanna/ma_order_test.cc Wed Sep 29 17:30:04 2004
@@ -8,7 +8,7 @@
using namespace std;
-using namespace hugo;
+using namespace lemon;
int main() {
Modified: hugo/trunk/src/work/klao/debug.h
==============================================================================
--- hugo/trunk/src/work/klao/debug.h (original)
+++ hugo/trunk/src/work/klao/debug.h Wed Sep 29 17:30:04 2004
@@ -1,12 +1,12 @@
// -*- C++ -*- //
-#ifndef HUGO_DEBUG_H
-#define HUGO_DEBUG_H
+#ifndef LEMON_DEBUG_H
+#define LEMON_DEBUG_H
//! \file
//! \brief Basic definitions for debug control.
-namespace hugo {
+namespace lemon {
//! Debug mode for testing/debugging
@@ -53,4 +53,4 @@
#endif
}
-#endif // HUGO_DEBUG_H
+#endif // LEMON_DEBUG_H
Modified: hugo/trunk/src/work/klao/iter_map.h
==============================================================================
--- hugo/trunk/src/work/klao/iter_map.h (original)
+++ hugo/trunk/src/work/klao/iter_map.h Wed Sep 29 17:30:04 2004
@@ -1,7 +1,7 @@
// -*- c++ -*- //
-#ifndef HUGO_ITER_MAP
-#define HUGO_ITER_MAP
+#ifndef LEMON_ITER_MAP
+#define LEMON_ITER_MAP
#include <vector>
#include <algorithm>
@@ -10,9 +10,9 @@
// for memset
#include <cstring>
-#include <hugo/invalid.h>
+#include <lemon/invalid.h>
-namespace hugo {
+namespace lemon {
/// \brief A map with "small integers" as value set which can enumarate it
/// value classes
Modified: hugo/trunk/src/work/klao/iter_map_test.cc
==============================================================================
--- hugo/trunk/src/work/klao/iter_map_test.cc (original)
+++ hugo/trunk/src/work/klao/iter_map_test.cc Wed Sep 29 17:30:04 2004
@@ -1,9 +1,9 @@
#include <iter_map.h>
-#include <hugo/maps.h>
+#include <lemon/maps.h>
#include <iostream>
-using namespace hugo;
+using namespace lemon;
using namespace std;
const int N = 3;
Modified: hugo/trunk/src/work/klao/map_test.cc
==============================================================================
--- hugo/trunk/src/work/klao/map_test.cc (original)
+++ hugo/trunk/src/work/klao/map_test.cc Wed Sep 29 17:30:04 2004
@@ -1,9 +1,9 @@
#include <iostream>
-#include <hugo/maps.h>
+#include <lemon/maps.h>
using namespace std;
-using namespace hugo;
+using namespace lemon;
int main()
{
Modified: hugo/trunk/src/work/marci/augmenting_flow.h
==============================================================================
--- hugo/trunk/src/work/marci/augmenting_flow.h (original)
+++ hugo/trunk/src/work/marci/augmenting_flow.h Wed Sep 29 17:30:04 2004
@@ -1,21 +1,21 @@
// -*- C++ -*-
-#ifndef HUGO_AUGMENTING_FLOW_H
-#define HUGO_AUGMENTING_FLOW_H
+#ifndef LEMON_AUGMENTING_FLOW_H
+#define LEMON_AUGMENTING_FLOW_H
#include <vector>
#include <iostream>
-#include <hugo/graph_wrapper.h>
+#include <lemon/graph_wrapper.h>
#include <bfs_dfs.h>
-#include <hugo/invalid.h>
-#include <hugo/maps.h>
-#include <hugo/tight_edge_filter_map.h>
+#include <lemon/invalid.h>
+#include <lemon/maps.h>
+#include <lemon/tight_edge_filter_map.h>
/// \file
/// \brief Maximum flow algorithms.
/// \ingroup galgs
-namespace hugo {
+namespace lemon {
/// \addtogroup galgs
/// @{
@@ -536,7 +536,7 @@
free1(erasing_res_graph);
dfs.pushAndSetReached
- /// \bug hugo 0.2
+ /// \bug lemon 0.2
(typename ErasingResGW::Node
(typename FilterResGW::Node
(typename ResGW::Node(s)
@@ -594,8 +594,8 @@
}
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_AUGMENTING_FLOW_H
+#endif //LEMON_AUGMENTING_FLOW_H
Modified: hugo/trunk/src/work/marci/bfs_dfs.h
==============================================================================
--- hugo/trunk/src/work/marci/bfs_dfs.h (original)
+++ hugo/trunk/src/work/marci/bfs_dfs.h Wed Sep 29 17:30:04 2004
@@ -1,6 +1,6 @@
// -*- c++ -*-
-#ifndef HUGO_BFS_DFS_H
-#define HUGO_BFS_DFS_H
+#ifndef LEMON_BFS_DFS_H
+#define LEMON_BFS_DFS_H
/// \ingroup galgs
/// \file
@@ -14,9 +14,9 @@
#include <stack>
#include <utility>
-#include <hugo/invalid.h>
+#include <lemon/invalid.h>
-namespace hugo {
+namespace lemon {
/// Bfs searches for the nodes wich are not marked in
/// \c reached_map
@@ -117,7 +117,7 @@
bool finished() const { return bfs_queue.empty(); }
/// The conversion operator makes for converting the bfs-iterator
/// to an \c out-edge-iterator.
- ///\bug Edge have to be in HUGO 0.2
+ ///\bug Edge have to be in LEMON 0.2
operator Edge() const { return actual_edge; }
/// Returns if b-node has been reached just now.
bool isBNodeNewlyReached() const { return b_node_newly_reached; }
@@ -269,7 +269,7 @@
bool finished() const { return dfs_stack.empty(); }
/// The conversion operator makes for converting the bfs-iterator
/// to an \c out-edge-iterator.
- ///\bug Edge have to be in HUGO 0.2
+ ///\bug Edge have to be in LEMON 0.2
operator Edge() const { return actual_edge; }
/// Returns if b-node has been reached just now.
bool isBNodeNewlyReached() const { return b_node_newly_reached; }
@@ -343,6 +343,6 @@
};
-} // namespace hugo
+} // namespace lemon
-#endif //HUGO_BFS_DFS_H
+#endif //LEMON_BFS_DFS_H
Modified: hugo/trunk/src/work/marci/bfs_dfs_misc.h
==============================================================================
--- hugo/trunk/src/work/marci/bfs_dfs_misc.h (original)
+++ hugo/trunk/src/work/marci/bfs_dfs_misc.h Wed Sep 29 17:30:04 2004
@@ -1,6 +1,6 @@
// -*- c++ -*-
-#ifndef HUGO_BFS_DFS_MISC_H
-#define HUGO_BFS_DFS_MISC_H
+#ifndef LEMON_BFS_DFS_MISC_H
+#define LEMON_BFS_DFS_MISC_H
/// \ingroup galgs
/// \file
@@ -13,7 +13,7 @@
#include <bfs_dfs.h>
#include <for_each_macros.h>
-namespace hugo {
+namespace lemon {
/// This function eats a read-write \c BoolMap& bool_map,
/// which have to work well up
@@ -71,13 +71,13 @@
while (!dfs.finished()) {
++dfs;
if (dfs.isBNodeNewlyReached()) {
- ///\bug hugo 0.2-ben Edge kell
+ ///\bug lemon 0.2-ben Edge kell
pred.set(dfs.aNode(), typename Graph::OutEdgeIt(dfs));
} else {
///\bug ugyanaz
if (g.valid(typename Graph::OutEdgeIt(dfs)) &&
!examined[dfs.bNode()]) {
- ///\bug hugo 0.2-ben Edge kell
+ ///\bug lemon 0.2-ben Edge kell
pred.set(dfs.bNode(), typename Graph::OutEdgeIt(dfs));
return dfs.aNode();
}
@@ -92,6 +92,6 @@
return INVALID;
}
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_BFS_DFS_MISC_H
+#endif //LEMON_BFS_DFS_MISC_H
Modified: hugo/trunk/src/work/marci/bfsit_vs_byhand.cc
==============================================================================
--- hugo/trunk/src/work/marci/bfsit_vs_byhand.cc (original)
+++ hugo/trunk/src/work/marci/bfsit_vs_byhand.cc Wed Sep 29 17:30:04 2004
@@ -3,13 +3,13 @@
#include <fstream>
#include <sage_graph.h>
-#include <hugo/smart_graph.h>
-#include <hugo/dimacs.h>
-#include <hugo/time_measure.h>
-//#include <hugo/for_each_macros.h>
+#include <lemon/smart_graph.h>
+#include <lemon/dimacs.h>
+#include <lemon/time_measure.h>
+//#include <lemon/for_each_macros.h>
#include <bfs_dfs.h>
-using namespace hugo;
+using namespace lemon;
using std::cout;
using std::endl;
Modified: hugo/trunk/src/work/marci/bipartite_graph_wrapper.h
==============================================================================
--- hugo/trunk/src/work/marci/bipartite_graph_wrapper.h (original)
+++ hugo/trunk/src/work/marci/bipartite_graph_wrapper.h Wed Sep 29 17:30:04 2004
@@ -1,6 +1,6 @@
// -*- c++ -*-
-#ifndef HUGO_BIPARTITE_GRAPH_WRAPPER_H
-#define HUGO_BIPARTITE_GRAPH_WRAPPER_H
+#ifndef LEMON_BIPARTITE_GRAPH_WRAPPER_H
+#define LEMON_BIPARTITE_GRAPH_WRAPPER_H
///\ingroup gwrappers
///\file
@@ -10,12 +10,12 @@
///
///\author Marton Makai
-#include <hugo/invalid.h>
+#include <lemon/invalid.h>
#include <iter_map.h>
-#include <hugo/graph_wrapper.h>
+#include <lemon/graph_wrapper.h>
#include <for_each_macros.h>
-namespace hugo {
+namespace lemon {
/// \brief A wrapper for composing a bipartite graph from a graph
/// and from a node-map showing for any node which color class it belongs to.
@@ -926,8 +926,8 @@
///@}
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_BIPARTITE_GRAPH_WRAPPER_H
+#endif //LEMON_BIPARTITE_GRAPH_WRAPPER_H
Modified: hugo/trunk/src/work/marci/bipartite_graph_wrapper_test.cc
==============================================================================
--- hugo/trunk/src/work/marci/bipartite_graph_wrapper_test.cc (original)
+++ hugo/trunk/src/work/marci/bipartite_graph_wrapper_test.cc Wed Sep 29 17:30:04 2004
@@ -4,21 +4,21 @@
#include <vector>
//#include <sage_graph.h>
-#include <hugo/smart_graph.h>
+#include <lemon/smart_graph.h>
//#include <dimacs.h>
-#include <hugo/time_measure.h>
+#include <lemon/time_measure.h>
//#include <for_each_macros.h>
#include <bfs_dfs.h>
-#include <hugo/graph_wrapper.h>
+#include <lemon/graph_wrapper.h>
#include <bipartite_graph_wrapper.h>
-#include <hugo/maps.h>
-#include <hugo/preflow.h>
+#include <lemon/maps.h>
+#include <lemon/preflow.h>
#include <augmenting_flow.h>
using std::cout;
using std::endl;
-using namespace hugo;
+using namespace lemon;
int main() {
//typedef UndirSageGraph Graph;
Modified: hugo/trunk/src/work/marci/bipartite_matching_demo.cc
==============================================================================
--- hugo/trunk/src/work/marci/bipartite_matching_demo.cc (original)
+++ hugo/trunk/src/work/marci/bipartite_matching_demo.cc Wed Sep 29 17:30:04 2004
@@ -6,16 +6,16 @@
#include <sage_graph.h>
//#include <smart_graph.h>
//#include <dimacs.h>
-#include <hugo/time_measure.h>
+#include <lemon/time_measure.h>
#include <for_each_macros.h>
#include <bfs_dfs.h>
#include <bipartite_graph_wrapper.h>
-#include <hugo/maps.h>
-#include <hugo/max_flow.h>
+#include <lemon/maps.h>
+#include <lemon/max_flow.h>
#include <graph_gen.h>
#include <max_bipartite_matching.h>
-using namespace hugo;
+using namespace lemon;
using std::cin;
using std::cout;
Modified: hugo/trunk/src/work/marci/const_map_time.cc
==============================================================================
--- hugo/trunk/src/work/marci/const_map_time.cc (original)
+++ hugo/trunk/src/work/marci/const_map_time.cc Wed Sep 29 17:30:04 2004
@@ -3,13 +3,13 @@
#include <iostream>
-#include <hugo/maps.h>
-#include <hugo/smart_graph.h>
-#include <hugo/time_measure.h>
-#include <hugo/dimacs.h>
-#include <hugo/graph_wrapper.h>
+#include <lemon/maps.h>
+#include <lemon/smart_graph.h>
+#include <lemon/time_measure.h>
+#include <lemon/dimacs.h>
+#include <lemon/graph_wrapper.h>
-using namespace hugo;
+using namespace lemon;
int main() {
Modified: hugo/trunk/src/work/marci/experiment/bfs_iterator.h
==============================================================================
--- hugo/trunk/src/work/marci/experiment/bfs_iterator.h (original)
+++ hugo/trunk/src/work/marci/experiment/bfs_iterator.h Wed Sep 29 17:30:04 2004
@@ -1,13 +1,13 @@
// -*- c++ -*-
-#ifndef HUGO_BFS_ITERATOR_H
-#define HUGO_BFS_ITERATOR_H
+#ifndef LEMON_BFS_ITERATOR_H
+#define LEMON_BFS_ITERATOR_H
#include <queue>
#include <stack>
#include <utility>
#include <graph_wrapper.h>
-namespace hugo {
+namespace lemon {
// template <typename Graph>
// struct bfs {
@@ -836,6 +836,6 @@
-} // namespace hugo
+} // namespace lemon
-#endif //HUGO_BFS_ITERATOR_H
+#endif //LEMON_BFS_ITERATOR_H
Modified: hugo/trunk/src/work/marci/experiment/bfs_iterator_1.h
==============================================================================
--- hugo/trunk/src/work/marci/experiment/bfs_iterator_1.h (original)
+++ hugo/trunk/src/work/marci/experiment/bfs_iterator_1.h Wed Sep 29 17:30:04 2004
@@ -1,13 +1,13 @@
// -*- c++ -*-
-#ifndef HUGO_BFS_ITERATOR_H
-#define HUGO_BFS_ITERATOR_H
+#ifndef LEMON_BFS_ITERATOR_H
+#define LEMON_BFS_ITERATOR_H
#include <queue>
#include <stack>
#include <utility>
#include <graph_wrapper_1.h>
-namespace hugo {
+namespace lemon {
// template <typename Graph>
// struct bfs {
@@ -831,6 +831,6 @@
-} // namespace hugo
+} // namespace lemon
-#endif //HUGO_BFS_ITERATOR_H
+#endif //LEMON_BFS_ITERATOR_H
Modified: hugo/trunk/src/work/marci/experiment/edmonds_karp.h
==============================================================================
--- hugo/trunk/src/work/marci/experiment/edmonds_karp.h (original)
+++ hugo/trunk/src/work/marci/experiment/edmonds_karp.h Wed Sep 29 17:30:04 2004
@@ -1,6 +1,6 @@
// -*- c++ -*-
-#ifndef HUGO_EDMONDS_KARP_H
-#define HUGO_EDMONDS_KARP_H
+#ifndef LEMON_EDMONDS_KARP_H
+#define LEMON_EDMONDS_KARP_H
#include <algorithm>
#include <list>
@@ -9,7 +9,7 @@
#include <bfs_iterator.h>
#include <invalid.h>
-namespace hugo {
+namespace lemon {
template<typename Graph, typename Number, typename FlowMap, typename CapacityMap>
class ResGraph {
@@ -1233,6 +1233,6 @@
// // };
-} // namespace hugo
+} // namespace lemon
-#endif //HUGO_EDMONDS_KARP_H
+#endif //LEMON_EDMONDS_KARP_H
Modified: hugo/trunk/src/work/marci/experiment/edmonds_karp_1.h
==============================================================================
--- hugo/trunk/src/work/marci/experiment/edmonds_karp_1.h (original)
+++ hugo/trunk/src/work/marci/experiment/edmonds_karp_1.h Wed Sep 29 17:30:04 2004
@@ -1,6 +1,6 @@
// -*- c++ -*-
-#ifndef HUGO_EDMONDS_KARP_H
-#define HUGO_EDMONDS_KARP_H
+#ifndef LEMON_EDMONDS_KARP_H
+#define LEMON_EDMONDS_KARP_H
#include <algorithm>
#include <list>
@@ -10,7 +10,7 @@
#include <invalid.h>
#include <graph_wrapper_1.h>
-namespace hugo {
+namespace lemon {
template<typename Graph, typename Number, typename FlowMap, typename CapacityMap>
class ResGraph {
@@ -1143,6 +1143,6 @@
// // };
-} // namespace hugo
+} // namespace lemon
-#endif //HUGO_EDMONDS_KARP_H
+#endif //LEMON_EDMONDS_KARP_H
Modified: hugo/trunk/src/work/marci/experiment/edmonds_karp_demo.cc
==============================================================================
--- hugo/trunk/src/work/marci/experiment/edmonds_karp_demo.cc (original)
+++ hugo/trunk/src/work/marci/experiment/edmonds_karp_demo.cc Wed Sep 29 17:30:04 2004
@@ -14,7 +14,7 @@
template<typename T> int get(T) const {return 1;}
};
-using namespace hugo;
+using namespace lemon;
// Use a DIMACS max flow file as stdin.
// read_dimacs_demo < dimacs_max_flow_file
Modified: hugo/trunk/src/work/marci/experiment/edmonds_karp_demo_1.cc
==============================================================================
--- hugo/trunk/src/work/marci/experiment/edmonds_karp_demo_1.cc (original)
+++ hugo/trunk/src/work/marci/experiment/edmonds_karp_demo_1.cc Wed Sep 29 17:30:04 2004
@@ -14,7 +14,7 @@
template<typename T> int get(T) const {return 1;}
};
-using namespace hugo;
+using namespace lemon;
// Use a DIMACS max flow file as stdin.
// read_dimacs_demo < dimacs_max_flow_file
Modified: hugo/trunk/src/work/marci/experiment/graph_wrapper.h
==============================================================================
--- hugo/trunk/src/work/marci/experiment/graph_wrapper.h (original)
+++ hugo/trunk/src/work/marci/experiment/graph_wrapper.h Wed Sep 29 17:30:04 2004
@@ -1,10 +1,10 @@
// -*- c++ -*-
-#ifndef HUGO_GRAPH_WRAPPER_H
-#define HUGO_GRAPH_WRAPPER_H
+#ifndef LEMON_GRAPH_WRAPPER_H
+#define LEMON_GRAPH_WRAPPER_H
#include <invalid.h>
-namespace hugo {
+namespace lemon {
template<typename Graph>
class TrivGraphWrapper {
@@ -1701,7 +1701,7 @@
// ResGraphWrapper(Graph& _graph) : graph(&_graph) { }
// };
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_GRAPH_WRAPPER_H
+#endif //LEMON_GRAPH_WRAPPER_H
Modified: hugo/trunk/src/work/marci/experiment/graph_wrapper_1.h
==============================================================================
--- hugo/trunk/src/work/marci/experiment/graph_wrapper_1.h (original)
+++ hugo/trunk/src/work/marci/experiment/graph_wrapper_1.h Wed Sep 29 17:30:04 2004
@@ -1,10 +1,10 @@
// -*- c++ -*-
-#ifndef HUGO_GRAPH_WRAPPER_H
-#define HUGO_GRAPH_WRAPPER_H
+#ifndef LEMON_GRAPH_WRAPPER_H
+#define LEMON_GRAPH_WRAPPER_H
#include <invalid.h>
-namespace hugo {
+namespace lemon {
template<typename Graph>
class TrivGraphWrapper {
@@ -1342,7 +1342,7 @@
// ResGraphWrapper(Graph& _graph) : graph(&_graph) { }
// };
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_GRAPH_WRAPPER_H
+#endif //LEMON_GRAPH_WRAPPER_H
Modified: hugo/trunk/src/work/marci/experiment/graph_wrapper_st_ostream_op.h
==============================================================================
--- hugo/trunk/src/work/marci/experiment/graph_wrapper_st_ostream_op.h (original)
+++ hugo/trunk/src/work/marci/experiment/graph_wrapper_st_ostream_op.h Wed Sep 29 17:30:04 2004
@@ -1,16 +1,16 @@
// -*- c++ -*-
-#ifndef HUGO_GRAPH_WRAPPER_H
-#define HUGO_GRAPH_WRAPPER_H
+#ifndef LEMON_GRAPH_WRAPPER_H
+#define LEMON_GRAPH_WRAPPER_H
#include <invalid.h>
#include <iter_map.h>
-namespace hugo {
+namespace lemon {
// Graph wrappers
/// \addtogroup gwrappers
- /// A main parts of HUGOlib are the different graph structures,
+ /// A main parts of LEMON are the different graph structures,
/// generic graph algorithms, graph concepts which couple these, and
/// graph wrappers. While the previous ones are more or less clear, the
/// latter notion needs further explanation.
@@ -1646,8 +1646,8 @@
///@}
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_GRAPH_WRAPPER_H
+#endif //LEMON_GRAPH_WRAPPER_H
Modified: hugo/trunk/src/work/marci/experiment/iterator_bfs_demo.cc
==============================================================================
--- hugo/trunk/src/work/marci/experiment/iterator_bfs_demo.cc (original)
+++ hugo/trunk/src/work/marci/experiment/iterator_bfs_demo.cc Wed Sep 29 17:30:04 2004
@@ -8,7 +8,7 @@
#include <bfs_iterator.h>
#include <graph_wrapper.h>
-using namespace hugo;
+using namespace lemon;
using std::cout;
using std::endl;
using std::string;
Modified: hugo/trunk/src/work/marci/experiment/iterator_bfs_demo_1.cc
==============================================================================
--- hugo/trunk/src/work/marci/experiment/iterator_bfs_demo_1.cc (original)
+++ hugo/trunk/src/work/marci/experiment/iterator_bfs_demo_1.cc Wed Sep 29 17:30:04 2004
@@ -8,7 +8,7 @@
#include <bfs_iterator_1.h>
#include <graph_wrapper_1.h>
-using namespace hugo;
+using namespace lemon;
using std::cout;
using std::endl;
using std::string;
Modified: hugo/trunk/src/work/marci/experiment/list_graph.h
==============================================================================
--- hugo/trunk/src/work/marci/experiment/list_graph.h (original)
+++ hugo/trunk/src/work/marci/experiment/list_graph.h Wed Sep 29 17:30:04 2004
@@ -1,13 +1,13 @@
// -*- c++ -*-
-#ifndef HUGO_LIST_GRAPH_H
-#define HUGO_LIST_GRAPH_H
+#ifndef LEMON_LIST_GRAPH_H
+#define LEMON_LIST_GRAPH_H
#include <iostream>
#include <vector>
#include <invalid.h>
-namespace hugo {
+namespace lemon {
template <typename It>
int count(It it) {
@@ -565,6 +565,6 @@
// }
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_LIST_GRAPH_H
+#endif //LEMON_LIST_GRAPH_H
Modified: hugo/trunk/src/work/marci/for_each_macros.h
==============================================================================
--- hugo/trunk/src/work/marci/for_each_macros.h (original)
+++ hugo/trunk/src/work/marci/for_each_macros.h Wed Sep 29 17:30:04 2004
@@ -1,19 +1,19 @@
// -*- c++ -*-
-#ifndef HUGO_FOR_EACH_MACROS_H
-#define HUGO_FOR_EACH_MACROS_H
+#ifndef LEMON_FOR_EACH_MACROS_H
+#define LEMON_FOR_EACH_MACROS_H
// /// \ingroup gwrappers
/// \file
/// \brief Iteration macros.
///
/// This file contains several macros which make easier writting
-/// for cycles in HUGO using HUGO iterators.
+/// for cycles in LEMON using LEMON iterators.
///
/// \author Marton Makai
-namespace hugo {
+namespace lemon {
- /// This macro provides a comfortable interface for iterating with HUGO
+ /// This macro provides a comfortable interface for iterating with LEMON
/// iterators.
/// \code
/// Graph g;
@@ -33,7 +33,7 @@
/// \deprecated
#define FOR_EACH_GLOB(e, g) for((g).first((e)); (g).valid((e)); (g).next((e)))
- /// This macro provides a comfortable interface for iterating with HUGO
+ /// This macro provides a comfortable interface for iterating with LEMON
/// iterators.
/// \code
/// Graph g;
@@ -125,7 +125,7 @@
// typename Graph::InEdgeIt e; g.first(e, n); return e;
// }
- /// This macro provides a comfortable interface for iterating with HUGO
+ /// This macro provides a comfortable interface for iterating with LEMON
/// iterators.
/// \code
/// Graph g;
@@ -143,7 +143,7 @@
/// \deprecated
#define FOR_EACH_LOC(Ittype, e, g) for(Ittype e=loopFirst(Ittype(), (g)); (g).valid(e); (g).next(e))
- /// This macro provides a comfortable interface for iterating with HUGO
+ /// This macro provides a comfortable interface for iterating with LEMON
/// iterators.
/// \code
/// Graph g;
@@ -170,6 +170,6 @@
// #define FOR_EACH_INEDGE_LOC(e, g, v) for((g).first((e), (v)); (g).valid((e)); (g).next((e)))
// #define FOR_EACH_OUTEDGE_LOC(e, g, v) for((g).first((e), (v)); (g).valid((e)); (g).next((e)))
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_FOR_EACH_MACROS_H
+#endif //LEMON_FOR_EACH_MACROS_H
Modified: hugo/trunk/src/work/marci/graph_concept.h
==============================================================================
--- hugo/trunk/src/work/marci/graph_concept.h (original)
+++ hugo/trunk/src/work/marci/graph_concept.h Wed Sep 29 17:30:04 2004
@@ -1,13 +1,13 @@
// -*- c++ -*-
-#ifndef HUGO_GRAPH_H
-#define HUGO_GRAPH_H
+#ifndef LEMON_GRAPH_H
+#define LEMON_GRAPH_H
///\file
///\brief Declaration of GraphConcept.
-#include <hugo/invalid.h>
+#include <lemon/invalid.h>
-namespace hugo {
+namespace lemon {
/// @defgroup empty_graph The GraphConcept class
/// @{
@@ -471,7 +471,7 @@
/// @}
-} //namespace hugo
+} //namespace lemon
@@ -491,4 +491,4 @@
// }
-#endif // HUGO_GRAPH_H
+#endif // LEMON_GRAPH_H
Modified: hugo/trunk/src/work/marci/graph_wrapper_time.cc
==============================================================================
--- hugo/trunk/src/work/marci/graph_wrapper_time.cc (original)
+++ hugo/trunk/src/work/marci/graph_wrapper_time.cc Wed Sep 29 17:30:04 2004
@@ -7,14 +7,14 @@
#include <fstream>
#include <string>
#include <vector>
-#include <hugo/invalid.h>
-#include <hugo/time_measure.h>
-#include <hugo/graph_wrapper.h>
-#include <hugo/preflow.h>
-#include <hugo/dimacs.h>
-#include <hugo/list_graph.h>
+#include <lemon/invalid.h>
+#include <lemon/time_measure.h>
+#include <lemon/graph_wrapper.h>
+#include <lemon/preflow.h>
+#include <lemon/dimacs.h>
+#include <lemon/list_graph.h>
-using namespace hugo;
+using namespace lemon;
using std::cout;
using std::endl;
Modified: hugo/trunk/src/work/marci/gw_vs_not.cc
==============================================================================
--- hugo/trunk/src/work/marci/gw_vs_not.cc (original)
+++ hugo/trunk/src/work/marci/gw_vs_not.cc Wed Sep 29 17:30:04 2004
@@ -9,7 +9,7 @@
#include <time_measure.h>
#include <graph_wrapper.h>
-using namespace hugo;
+using namespace lemon;
// Use a DIMACS max flow file as stdin.
// read_dimacs_demo < dimacs_max_flow_file
Modified: hugo/trunk/src/work/marci/iterator_bfs_demo.cc
==============================================================================
--- hugo/trunk/src/work/marci/iterator_bfs_demo.cc (original)
+++ hugo/trunk/src/work/marci/iterator_bfs_demo.cc Wed Sep 29 17:30:04 2004
@@ -4,11 +4,11 @@
#include <string>
#include <sage_graph.h>
-#include <hugo/smart_graph.h>
+#include <lemon/smart_graph.h>
#include <bfs_dfs.h>
-#include <hugo/graph_wrapper.h>
+#include <lemon/graph_wrapper.h>
-using namespace hugo;
+using namespace lemon;
using std::cout;
using std::endl;
Modified: hugo/trunk/src/work/marci/leda/bipartite_matching_comparison.cc
==============================================================================
--- hugo/trunk/src/work/marci/leda/bipartite_matching_comparison.cc (original)
+++ hugo/trunk/src/work/marci/leda/bipartite_matching_comparison.cc Wed Sep 29 17:30:04 2004
@@ -13,18 +13,18 @@
#include <sage_graph.h>
//#include <smart_graph.h>
//#include <dimacs.h>
-#include <hugo/time_measure.h>
+#include <lemon/time_measure.h>
#include <for_each_macros.h>
-#include <hugo/graph_wrapper.h>
+#include <lemon/graph_wrapper.h>
#include <bipartite_graph_wrapper.h>
-#include <hugo/maps.h>
-#include <hugo/max_flow.h>
+#include <lemon/maps.h>
+#include <lemon/max_flow.h>
using std::cin;
using std::cout;
using std::endl;
-using namespace hugo;
+using namespace lemon;
int main() {
//for leda graph
@@ -91,7 +91,7 @@
MaxFlow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> >
max_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow/*, true*/);
max_flow_test.run();
- cout << "HUGO max matching algorithm based on preflow." << endl
+ cout << "LEMON max matching algorithm based on preflow." << endl
<< "Size of matching: "
<< max_flow_test.flowValue() << endl;
cout << "elapsed time: " << ts << endl << endl;
@@ -107,7 +107,7 @@
// FOR_EACH_LOC(stGW::EdgeIt, e, stgw) flow.set(e, 0);
// typedef SageGraph MutableGraph;
// while (max_flow_test.augmentOnBlockingFlow<MutableGraph>()) { }
-// cout << "HUGO max matching algorithm based on blocking flow augmentation."
+// cout << "LEMON max matching algorithm based on blocking flow augmentation."
// << endl << "Matching size: "
// << max_flow_test.flowValue() << endl;
// cout << "elapsed time: " << ts << endl << endl;
@@ -141,7 +141,7 @@
SageGraph::EdgeMap<int> >
max_flow_test(hg, s, t, cm, flow);
max_flow_test.run();
- cout << "HUGO max matching algorithm on SageGraph by copying the graph, based on preflow."
+ cout << "LEMON max matching algorithm on SageGraph by copying the graph, based on preflow."
<< endl
<< "Size of matching: "
<< max_flow_test.flowValue() << endl;
Modified: hugo/trunk/src/work/marci/leda/bipartite_matching_leda.cc
==============================================================================
--- hugo/trunk/src/work/marci/leda/bipartite_matching_leda.cc (original)
+++ hugo/trunk/src/work/marci/leda/bipartite_matching_leda.cc Wed Sep 29 17:30:04 2004
@@ -13,12 +13,12 @@
#include <sage_graph.h>
//#include <smart_graph.h>
//#include <dimacs.h>
-#include <hugo/time_measure.h>
+#include <lemon/time_measure.h>
#include <for_each_macros.h>
-#include <hugo/graph_wrapper.h>
+#include <lemon/graph_wrapper.h>
#include <bipartite_graph_wrapper.h>
-#include <hugo/maps.h>
-#include <hugo/max_flow.h>
+#include <lemon/maps.h>
+#include <lemon/max_flow.h>
/**
* Inicializalja a veletlenszamgeneratort.
@@ -42,7 +42,7 @@
return int( double(m) * rand() / (RAND_MAX + 1.0) );
}
-using namespace hugo;
+using namespace lemon;
int main() {
//for leda graph
Modified: hugo/trunk/src/work/marci/leda/bipartite_matching_leda_gen.cc
==============================================================================
--- hugo/trunk/src/work/marci/leda/bipartite_matching_leda_gen.cc (original)
+++ hugo/trunk/src/work/marci/leda/bipartite_matching_leda_gen.cc Wed Sep 29 17:30:04 2004
@@ -13,12 +13,12 @@
#include <sage_graph.h>
//#include <smart_graph.h>
//#include <dimacs.h>
-#include <hugo/time_measure.h>
+#include <lemon/time_measure.h>
#include <for_each_macros.h>
-#include <hugo/graph_wrapper.h>
+#include <lemon/graph_wrapper.h>
#include <bipartite_graph_wrapper.h>
-#include <hugo/maps.h>
-#include <hugo/max_flow.h>
+#include <lemon/maps.h>
+#include <lemon/max_flow.h>
#include <augmenting_flow.h>
/**
@@ -43,7 +43,7 @@
return int( double(m) * rand() / (RAND_MAX + 1.0) );
}
-using namespace hugo;
+using namespace lemon;
int main() {
//for leda graph
@@ -110,7 +110,7 @@
MaxFlow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> >
max_flow_test(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow/*, true*/);
max_flow_test.run();
- std::cout << "HUGO max matching algorithm based on preflow." << std::endl
+ std::cout << "LEMON max matching algorithm based on preflow." << std::endl
<< "Size of matching: "
<< max_flow_test.flowValue() << std::endl;
std::cout << "elapsed time: " << ts << std::endl << std::endl;
@@ -129,7 +129,7 @@
AugmentingFlow<stGW, int, ConstMap<stGW::Edge, int>, stGW::EdgeMap<int> >
max_flow_test_1(stgw, stgw.S_NODE, stgw.T_NODE, const1map, flow/*, true*/);
while (max_flow_test_1.augmentOnBlockingFlow<MutableGraph>()) { }
- std::cout << "HUGO max matching algorithm based on blocking flow augmentation."
+ std::cout << "LEMON max matching algorithm based on blocking flow augmentation."
<< std::endl << "Matching size: "
<< max_flow_test_1.flowValue() << std::endl;
std::cout << "elapsed time: " << ts << std::endl;
Modified: hugo/trunk/src/work/marci/leda/leda_graph_wrapper.h
==============================================================================
--- hugo/trunk/src/work/marci/leda/leda_graph_wrapper.h (original)
+++ hugo/trunk/src/work/marci/leda/leda_graph_wrapper.h Wed Sep 29 17:30:04 2004
@@ -1,6 +1,6 @@
// -*- c++ -*-
-#ifndef HUGO_LEDA_GRAPH_WRAPPER_H
-#define HUGO_LEDA_GRAPH_WRAPPER_H
+#ifndef LEMON_LEDA_GRAPH_WRAPPER_H
+#define LEMON_LEDA_GRAPH_WRAPPER_H
#include <LEDA/graph.h>
#include <LEDA/node_array.h>
@@ -14,15 +14,15 @@
//using namespace leda;
//#endif
-#include <hugo/invalid.h>
+#include <lemon/invalid.h>
-namespace hugo {
+namespace lemon {
- /// \brief A graph wrapper structure for wrapping LEDA graphs in HUGO.
+ /// \brief A graph wrapper structure for wrapping LEDA graphs in LEMON.
///
/// This graph wrapper class wraps LEDA graphs and LEDA parametrized graphs
- /// to satisfy HUGO graph concepts.
- /// Then the generic HUGOlib algorithms and wrappers can be used
+ /// to satisfy LEMON graph concepts.
+ /// Then the generic LEMON algorithms and wrappers can be used
/// with LEDA graphs.
/// \ingroup gwrapper
template<typename Graph>
@@ -298,7 +298,7 @@
/// This class is to wrap existing
- /// LEDA node-maps to HUGO ones.
+ /// LEDA node-maps to LEMON ones.
template<typename T> class NodeMapWrapper
{
leda_node_array<T>* leda_stuff;
@@ -320,7 +320,7 @@
};
/// This class is to wrap existing
- /// LEDA edge-maps to HUGO ones.
+ /// LEDA edge-maps to LEMON ones.
template<typename T> class EdgeMapWrapper
{
leda_edge_array<T>* leda_stuff;
@@ -379,6 +379,6 @@
}
};
-} //namespace hugo
+} //namespace lemon
-#endif // HUGO_LEDA_GRAPH_WRAPPER_H
+#endif // LEMON_LEDA_GRAPH_WRAPPER_H
Modified: hugo/trunk/src/work/marci/leda/max_bipartite_matching_demo.cc
==============================================================================
--- hugo/trunk/src/work/marci/leda/max_bipartite_matching_demo.cc (original)
+++ hugo/trunk/src/work/marci/leda/max_bipartite_matching_demo.cc Wed Sep 29 17:30:04 2004
@@ -36,7 +36,7 @@
return int( double(m) * rand() / (RAND_MAX + 1.0) );
}
-using namespace hugo;
+using namespace lemon;
using std::cout;
using std::cin;
Modified: hugo/trunk/src/work/marci/leda_bfs_dfs.cc
==============================================================================
--- hugo/trunk/src/work/marci/leda_bfs_dfs.cc (original)
+++ hugo/trunk/src/work/marci/leda_bfs_dfs.cc Wed Sep 29 17:30:04 2004
@@ -11,7 +11,7 @@
#include <graph_wrapper.h>
#include <leda_graph_wrapper.h>
-using namespace hugo;
+using namespace lemon;
using std::cout;
using std::endl;
using std::string;
Modified: hugo/trunk/src/work/marci/leda_graph_demo.cc
==============================================================================
--- hugo/trunk/src/work/marci/leda_graph_demo.cc (original)
+++ hugo/trunk/src/work/marci/leda_graph_demo.cc Wed Sep 29 17:30:04 2004
@@ -8,7 +8,7 @@
#include <time_measure.h>
#include <edmonds_karp.h>
-using namespace hugo;
+using namespace lemon;
using std::cout;
using std::endl;
Modified: hugo/trunk/src/work/marci/lg_vs_sg_vs_sg.cc
==============================================================================
--- hugo/trunk/src/work/marci/lg_vs_sg_vs_sg.cc (original)
+++ hugo/trunk/src/work/marci/lg_vs_sg_vs_sg.cc Wed Sep 29 17:30:04 2004
@@ -4,15 +4,15 @@
#include <string>
#include <sage_graph.h>
-#include <hugo/list_graph.h>
-#include <hugo/smart_graph.h>
-#include <hugo/dimacs.h>
-#include <hugo/max_flow.h>
+#include <lemon/list_graph.h>
+#include <lemon/smart_graph.h>
+#include <lemon/dimacs.h>
+#include <lemon/max_flow.h>
#include <augmenting_flow.h>
-#include <hugo/time_measure.h>
+#include <lemon/time_measure.h>
#include <for_each_macros.h>
-using namespace hugo;
+using namespace lemon;
// Use a DIMACS max flow file as stdin.
// read_dimacs_demo dimacs_max_flow_file
Modified: hugo/trunk/src/work/marci/lp/lp_solver_wrapper.h
==============================================================================
--- hugo/trunk/src/work/marci/lp/lp_solver_wrapper.h (original)
+++ hugo/trunk/src/work/marci/lp/lp_solver_wrapper.h Wed Sep 29 17:30:04 2004
@@ -1,6 +1,6 @@
// -*- c++ -*-
-#ifndef HUGO_LP_SOLVER_WRAPPER_H
-#define HUGO_LP_SOLVER_WRAPPER
+#ifndef LEMON_LP_SOLVER_WRAPPER_H
+#define LEMON_LP_SOLVER_WRAPPER
///\ingroup misc
///\file
@@ -20,12 +20,12 @@
#include <utility>
//#include <sage_graph.h>
-//#include <hugo/list_graph.h>
-//#include <hugo/graph_wrapper.h>
-#include <hugo/invalid.h>
+//#include <lemon/list_graph.h>
+//#include <lemon/graph_wrapper.h>
+#include <lemon/invalid.h>
//#include <bfs_dfs.h>
//#include <stp.h>
-//#include <hugo/max_flow.h>
+//#include <lemon/max_flow.h>
//#include <augmenting_flow.h>
//#include <iter_map.h>
@@ -33,7 +33,7 @@
using std::cin;
using std::endl;
-namespace hugo {
+namespace lemon {
/// \addtogroup misc
@@ -44,7 +44,7 @@
/// This class implements a container in which the data is stored in an
/// stl vector, the range is partitioned into sets and each set is
/// doubly linked in a list.
- /// That is, each class is iterable by hugo iterators, and any member of
+ /// That is, each class is iterable by lemon iterators, and any member of
/// the vector can bo moved to an other class.
template <typename T>
class IterablePartition {
@@ -63,7 +63,7 @@
public:
/// The classes are indexed by integers from \c 0 to \c classNum()-1.
int classNum() const { return tips.size(); }
- /// This hugo style iterator iterates through a class.
+ /// This lemon style iterator iterates through a class.
class ClassIt;
/// Constructor. The number of classes is to be given which is fixed
/// over the life of the container.
@@ -157,8 +157,8 @@
/// \brief Wrappers for LP solvers
///
- /// This class implements a hugo wrapper for glpk.
- /// Later other LP-solvers will be wrapped into hugo.
+ /// This class implements a lemon wrapper for glpk.
+ /// Later other LP-solvers will be wrapped into lemon.
/// The aim of this class is to give a general surface to different
/// solvers, i.e. it makes possible to write algorithms using LP's,
/// in which the solver can be changed to an other one easily.
@@ -424,6 +424,6 @@
/// @}
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_LP_SOLVER_WRAPPER_H
+#endif //LEMON_LP_SOLVER_WRAPPER_H
Modified: hugo/trunk/src/work/marci/lp/max_flow_by_lp.cc
==============================================================================
--- hugo/trunk/src/work/marci/lp/max_flow_by_lp.cc (original)
+++ hugo/trunk/src/work/marci/lp/max_flow_by_lp.cc Wed Sep 29 17:30:04 2004
@@ -3,17 +3,17 @@
#include <fstream>
#include <sage_graph.h>
-#include <hugo/smart_graph.h>
-#include <hugo/dimacs.h>
-#include <hugo/time_measure.h>
+#include <lemon/smart_graph.h>
+#include <lemon/dimacs.h>
+#include <lemon/time_measure.h>
//#include <graph_wrapper.h>
-#include <hugo/max_flow.h>
+#include <lemon/max_flow.h>
#include <augmenting_flow.h>
//#include <preflow_res.h>
#include <for_each_macros.h>
#include <lp_solver_wrapper.h>
-using namespace hugo;
+using namespace lemon;
// Use a DIMACS max flow file as stdin.
// max_flow_demo < dimacs_max_flow_file
Modified: hugo/trunk/src/work/marci/macro_test.cc
==============================================================================
--- hugo/trunk/src/work/marci/macro_test.cc (original)
+++ hugo/trunk/src/work/marci/macro_test.cc Wed Sep 29 17:30:04 2004
@@ -5,7 +5,7 @@
#include <sage_graph.h>
#include <for_each_macros.h>
-using namespace hugo;
+using namespace lemon;
int main()
{
Modified: hugo/trunk/src/work/marci/max_bipartite_matching.h
==============================================================================
--- hugo/trunk/src/work/marci/max_bipartite_matching.h (original)
+++ hugo/trunk/src/work/marci/max_bipartite_matching.h Wed Sep 29 17:30:04 2004
@@ -1,6 +1,6 @@
// -*- c++ -*-
-#ifndef HUGO_MAX_BIPARTITE_MATCHING_H
-#define HUGO_MAX_BIPARTITE_MATCHING_H
+#ifndef LEMON_MAX_BIPARTITE_MATCHING_H
+#define LEMON_MAX_BIPARTITE_MATCHING_H
/// \ingroup galgs
/// \file
@@ -14,10 +14,10 @@
//#include <for_each_macros.h>
#include <bipartite_graph_wrapper.h>
-//#include <hugo/maps.h>
-#include <hugo/max_flow.h>
+//#include <lemon/maps.h>
+#include <lemon/max_flow.h>
-namespace hugo {
+namespace lemon {
// template <typename Graph, typename EdgeCap, typename NodeCap,
// typename EdgeFlow, typename NodeFlow>
@@ -135,6 +135,6 @@
int matchingValue() const { return mf.flowValue(); }
};
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_MAX_BIPARTITE_MATCHING_H
+#endif //LEMON_MAX_BIPARTITE_MATCHING_H
Modified: hugo/trunk/src/work/marci/max_flow_1.cc
==============================================================================
--- hugo/trunk/src/work/marci/max_flow_1.cc (original)
+++ hugo/trunk/src/work/marci/max_flow_1.cc Wed Sep 29 17:30:04 2004
@@ -3,15 +3,15 @@
#include <fstream>
#include <sage_graph.h>
-#include <hugo/smart_graph.h>
-#include <hugo/dimacs.h>
-#include <hugo/time_measure.h>
+#include <lemon/smart_graph.h>
+#include <lemon/dimacs.h>
+#include <lemon/time_measure.h>
//#include <graph_wrapper.h>
-#include <hugo/max_flow.h>
+#include <lemon/max_flow.h>
//#include <preflow_res.h>
#include <for_each_macros.h>
-using namespace hugo;
+using namespace lemon;
// Use a DIMACS max flow file as stdin.
// read_dimacs_demo < dimacs_max_flow_file
Modified: hugo/trunk/src/work/marci/max_flow_demo.cc
==============================================================================
--- hugo/trunk/src/work/marci/max_flow_demo.cc (original)
+++ hugo/trunk/src/work/marci/max_flow_demo.cc Wed Sep 29 17:30:04 2004
@@ -6,15 +6,15 @@
#include <iostream>
#include <fstream>
-#include <hugo/smart_graph.h>
-#include <hugo/list_graph.h>
-#include <hugo/dimacs.h>
-#include <hugo/time_measure.h>
-#include <hugo/preflow.h>
+#include <lemon/smart_graph.h>
+#include <lemon/list_graph.h>
+#include <lemon/dimacs.h>
+#include <lemon/time_measure.h>
+#include <lemon/preflow.h>
#include <augmenting_flow.h>
#include <graph_concept.h>
-using namespace hugo;
+using namespace lemon;
int main(int, char **) {
Modified: hugo/trunk/src/work/marci/merge_node_graph_wrapper.h
==============================================================================
--- hugo/trunk/src/work/marci/merge_node_graph_wrapper.h (original)
+++ hugo/trunk/src/work/marci/merge_node_graph_wrapper.h Wed Sep 29 17:30:04 2004
@@ -1,5 +1,5 @@
/* -*- C++ -*-
- * src/hugo/merge_node_graph_wrapper.h - Part of HUGOlib, a generic C++ optimization library
+ * src/lemon/merge_node_graph_wrapper.h - Part of LEMON, a generic C++ optimization library
*
* Copyright (C) 2004 Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
* (Egervary Combinatorial Optimization Research Group, EGRES).
@@ -14,16 +14,16 @@
*
*/
-#ifndef HUGO_MERGE_NODE_GRAPH_WRAPPER_H
-#define HUGO_MERGE_NODE_GRAPH_WRAPPER_H
+#ifndef LEMON_MERGE_NODE_GRAPH_WRAPPER_H
+#define LEMON_MERGE_NODE_GRAPH_WRAPPER_H
-#include <hugo/invalid.h>
-#include <hugo/maps.h>
-#include <hugo/map_defines.h>
-#include <hugo/graph_wrapper.h>
+#include <lemon/invalid.h>
+#include <lemon/maps.h>
+#include <lemon/map_defines.h>
+#include <lemon/graph_wrapper.h>
#include <iostream>
-namespace hugo {
+namespace lemon {
template <typename Graph1, typename Graph2, typename Enable=void>
class MergeNodeGraphWrapper :
@@ -172,6 +172,6 @@
};
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_MERGE_NODE_GRAPH_WRAPPER_H
+#endif //LEMON_MERGE_NODE_GRAPH_WRAPPER_H
Modified: hugo/trunk/src/work/marci/merge_node_graph_wrapper_test.cc
==============================================================================
--- hugo/trunk/src/work/marci/merge_node_graph_wrapper_test.cc (original)
+++ hugo/trunk/src/work/marci/merge_node_graph_wrapper_test.cc Wed Sep 29 17:30:04 2004
@@ -1,13 +1,13 @@
#include <iostream>
-#include <hugo/list_graph.h>
-#include <hugo/smart_graph.h>
+#include <lemon/list_graph.h>
+#include <lemon/smart_graph.h>
#include <merge_node_graph_wrapper.h>
using std::cout;
using std::endl;
-using namespace hugo;
+using namespace lemon;
int main() {
typedef SmartGraph Graph1;
Modified: hugo/trunk/src/work/marci/oldies/edmonds_karp.h
==============================================================================
--- hugo/trunk/src/work/marci/oldies/edmonds_karp.h (original)
+++ hugo/trunk/src/work/marci/oldies/edmonds_karp.h Wed Sep 29 17:30:04 2004
@@ -1,6 +1,6 @@
// -*- c++ -*-
-#ifndef HUGO_EDMONDS_KARP_H
-#define HUGO_EDMONDS_KARP_H
+#ifndef LEMON_EDMONDS_KARP_H
+#define LEMON_EDMONDS_KARP_H
#include <algorithm>
#include <list>
@@ -12,7 +12,7 @@
#include <maps.h>
#include <for_each_macros.h>
-namespace hugo {
+namespace lemon {
template <typename Graph, typename Num,
typename CapMap, typename FlowMap>
@@ -951,6 +951,6 @@
// // };
-} // namespace hugo
+} // namespace lemon
-#endif //HUGO_EDMONDS_KARP_H
+#endif //LEMON_EDMONDS_KARP_H
Modified: hugo/trunk/src/work/marci/oldies/marci_graph_demo.cc
==============================================================================
--- hugo/trunk/src/work/marci/oldies/marci_graph_demo.cc (original)
+++ hugo/trunk/src/work/marci/oldies/marci_graph_demo.cc Wed Sep 29 17:30:04 2004
@@ -6,7 +6,7 @@
#include <bfs_iterator.h>
#include <edmonds_karp.h>
-using namespace hugo;
+using namespace lemon;
int main (int, char*[])
{
Modified: hugo/trunk/src/work/marci/preflow_bug.cc
==============================================================================
--- hugo/trunk/src/work/marci/preflow_bug.cc (original)
+++ hugo/trunk/src/work/marci/preflow_bug.cc Wed Sep 29 17:30:04 2004
@@ -3,11 +3,11 @@
#include <fstream>
#include <sage_graph.h>
-#include <hugo/smart_graph.h>
-#include <hugo/dimacs.h>
-//#include <hugo/time_measure.h>
+#include <lemon/smart_graph.h>
+#include <lemon/dimacs.h>
+//#include <lemon/time_measure.h>
//#include <graph_wrapper.h>
-#include <hugo/max_flow.h>
+#include <lemon/max_flow.h>
//#include <preflow_res.h>
#include <for_each_macros.h>
#include <graph_concept.h>
@@ -15,7 +15,7 @@
using std::cout;
using std::endl;
-using namespace hugo;
+using namespace lemon;
// Use a DIMACS min cost flow file as stdin.
// read_dimacs_demo < dimacs_max_flow_file
Modified: hugo/trunk/src/work/marci/preflow_demo_athos.cc
==============================================================================
--- hugo/trunk/src/work/marci/preflow_demo_athos.cc (original)
+++ hugo/trunk/src/work/marci/preflow_demo_athos.cc Wed Sep 29 17:30:04 2004
@@ -6,7 +6,7 @@
#include <preflow_push.hh>
#include <time_measure.h>
-using namespace hugo;
+using namespace lemon;
// Use a DIMACS max flow file as stdin.
// read_dimacs_demo < dimacs_max_flow_file
Modified: hugo/trunk/src/work/marci/preflow_demo_jacint.cc
==============================================================================
--- hugo/trunk/src/work/marci/preflow_demo_jacint.cc (original)
+++ hugo/trunk/src/work/marci/preflow_demo_jacint.cc Wed Sep 29 17:30:04 2004
@@ -7,7 +7,7 @@
#include <preflow_push_hl.h>
#include <time_measure.h>
-using namespace hugo;
+using namespace lemon;
// Use a DIMACS max flow file as stdin.
// read_dimacs_demo < dimacs_max_flow_file
Modified: hugo/trunk/src/work/marci/top_sort_test.cc
==============================================================================
--- hugo/trunk/src/work/marci/top_sort_test.cc (original)
+++ hugo/trunk/src/work/marci/top_sort_test.cc Wed Sep 29 17:30:04 2004
@@ -3,14 +3,14 @@
#include <fstream>
#include <list>
-#include <hugo/dimacs.h>
+#include <lemon/dimacs.h>
#include <bfs_dfs_misc.h>
#include <sage_graph.h>
-#include <hugo/graph_wrapper.h>
-#include <hugo/maps.h>
+#include <lemon/graph_wrapper.h>
+#include <lemon/maps.h>
#include <for_each_macros.h>
-using namespace hugo;
+using namespace lemon;
using std::cout;
using std::endl;
Modified: hugo/trunk/src/work/peter/edgepathgraph.h
==============================================================================
--- hugo/trunk/src/work/peter/edgepathgraph.h (original)
+++ hugo/trunk/src/work/peter/edgepathgraph.h Wed Sep 29 17:30:04 2004
@@ -1,15 +1,15 @@
// -*- c++ -*-
-#ifndef HUGO_NET_GRAPH_H
-#define HUGO_NET_GRAPH_H
+#ifndef LEMON_NET_GRAPH_H
+#define LEMON_NET_GRAPH_H
///\file
///\brief Declaration of EdgePathGraph.
-#include <hugo/invalid.h>
-#include <hugo/maps.h>
+#include <lemon/invalid.h>
+#include <lemon/maps.h>
-/// The namespace of HugoLib
-namespace hugo {
+/// The namespace of LEMON
+namespace lemon {
// @defgroup empty_graph The EdgePathGraph class
// @{
@@ -401,7 +401,7 @@
// @}
-} //namespace hugo
+} //namespace lemon
-#endif // HUGO_SKELETON_GRAPH_H
+#endif // LEMON_SKELETON_GRAPH_H
Modified: hugo/trunk/src/work/peter/edgepathgraph_test.cc
==============================================================================
--- hugo/trunk/src/work/peter/edgepathgraph_test.cc (original)
+++ hugo/trunk/src/work/peter/edgepathgraph_test.cc Wed Sep 29 17:30:04 2004
@@ -3,11 +3,11 @@
#include <stdio.h>
#include "edgepathgraph.h"
-#include <hugo/list_graph.h>
-#include <hugo/smart_graph.h>
+#include <lemon/list_graph.h>
+#include <lemon/smart_graph.h>
#include <path.h>
-using namespace hugo;
+using namespace lemon;
using namespace std;
bool passed = true;
Modified: hugo/trunk/src/work/peter/hierarchygraph.h
==============================================================================
--- hugo/trunk/src/work/peter/hierarchygraph.h (original)
+++ hugo/trunk/src/work/peter/hierarchygraph.h Wed Sep 29 17:30:04 2004
@@ -1,15 +1,15 @@
// -*- c++ -*-
-#ifndef HUGO_NET_GRAPH_H
-#define HUGO_NET_GRAPH_H
+#ifndef LEMON_NET_GRAPH_H
+#define LEMON_NET_GRAPH_H
///\file
///\brief Declaration of HierarchyGraph.
-#include <hugo/invalid.h>
-#include <hugo/maps.h>
+#include <lemon/invalid.h>
+#include <lemon/maps.h>
-/// The namespace of HugoLib
-namespace hugo
+/// The namespace of LEMON
+namespace lemon
{
// @defgroup empty_graph The HierarchyGraph class
@@ -575,7 +575,7 @@
// @}
-} //namespace hugo
+} //namespace lemon
-#endif // HUGO_SKELETON_GRAPH_H
+#endif // LEMON_SKELETON_GRAPH_H
Modified: hugo/trunk/src/work/peter/hierarchygraph_test.cc
==============================================================================
--- hugo/trunk/src/work/peter/hierarchygraph_test.cc (original)
+++ hugo/trunk/src/work/peter/hierarchygraph_test.cc Wed Sep 29 17:30:04 2004
@@ -3,11 +3,11 @@
#include <stdio.h>
#include "hierarchygraph.h"
-#include <hugo/list_graph.h>
-#include <hugo/smart_graph.h>
+#include <lemon/list_graph.h>
+#include <lemon/smart_graph.h>
#include <path.h>
-using namespace hugo;
+using namespace lemon;
using namespace std;
bool passed = true;
Modified: hugo/trunk/src/work/peter/path/debug.h
==============================================================================
--- hugo/trunk/src/work/peter/path/debug.h (original)
+++ hugo/trunk/src/work/peter/path/debug.h Wed Sep 29 17:30:04 2004
@@ -1,12 +1,12 @@
// -*- C++ -*- //
-#ifndef HUGO_DEBUG_H
-#define HUGO_DEBUG_H
+#ifndef LEMON_DEBUG_H
+#define LEMON_DEBUG_H
//! \file
//! \brief Basic definitions for debug control.
-namespace hugo {
+namespace lemon {
//! Debug mode for testing/debugging
@@ -53,4 +53,4 @@
#endif
}
-#endif // HUGO_DEBUG_H
+#endif // LEMON_DEBUG_H
Modified: hugo/trunk/src/work/peter/path/path.h
==============================================================================
--- hugo/trunk/src/work/peter/path/path.h (original)
+++ hugo/trunk/src/work/peter/path/path.h Wed Sep 29 17:30:04 2004
@@ -3,16 +3,16 @@
/**
@defgroup paths Path Structures
@ingroup datas
-\brief Path structures implemented in Hugo.
+\brief Path structures implemented in LEMON.
-Hugolib provides flexible data structures
+LEMON provides flexible data structures
to work with paths.
All of them have the same interface, especially they can be built or extended
using a standard Builder subclass. This make is easy to have e.g. the Dijkstra
algorithm to store its result in any kind of path structure.
-\sa hugo::skeleton::Path
+\sa lemon::skeleton::Path
*/
@@ -20,18 +20,18 @@
///\file
///\brief Classes for representing paths in graphs.
-#ifndef HUGO_PATH_H
-#define HUGO_PATH_H
+#ifndef LEMON_PATH_H
+#define LEMON_PATH_H
#include <deque>
#include <vector>
#include <algorithm>
-#include <hugo/invalid.h>
-#include <hugo/error.h>
+#include <lemon/invalid.h>
+#include <lemon/error.h>
#include <debug.h>
-namespace hugo {
+namespace lemon {
/// \addtogroup paths
/// @{
@@ -1169,6 +1169,6 @@
///@}
-} // namespace hugo
+} // namespace lemon
-#endif // HUGO_PATH_H
+#endif // LEMON_PATH_H
Modified: hugo/trunk/src/work/peter/path/path_skeleton.h
==============================================================================
--- hugo/trunk/src/work/peter/path/path_skeleton.h (original)
+++ hugo/trunk/src/work/peter/path/path_skeleton.h Wed Sep 29 17:30:04 2004
@@ -5,12 +5,12 @@
///\file
///\brief Classes for representing paths in graphs.
-#ifndef HUGO_PATH_H
-#define HUGO_PATH_H
+#ifndef LEMON_PATH_H
+#define LEMON_PATH_H
-#include <hugo/invalid.h>
+#include <lemon/invalid.h>
-namespace hugo {
+namespace lemon {
namespace skeleton {
/// \addtogroup skeletons
/// @{
@@ -218,6 +218,6 @@
///@}
}
-} // namespace hugo
+} // namespace lemon
-#endif // HUGO_PATH_H
+#endif // LEMON_PATH_H
Modified: hugo/trunk/src/work/peter/path/path_test.cc
==============================================================================
--- hugo/trunk/src/work/peter/path/path_test.cc (original)
+++ hugo/trunk/src/work/peter/path/path_test.cc Wed Sep 29 17:30:04 2004
@@ -5,7 +5,7 @@
#include <list_graph.h>
using namespace std;
-using namespace hugo;
+using namespace lemon;
using namespace skeleton;
bool passed = true;
Modified: hugo/trunk/src/work/sage_graph.h
==============================================================================
--- hugo/trunk/src/work/sage_graph.h (original)
+++ hugo/trunk/src/work/sage_graph.h Wed Sep 29 17:30:04 2004
@@ -1,13 +1,13 @@
// -*- c++ -*-
-#ifndef HUGO_SAGE_GRAPH_H
-#define HUGO_SAGE_GRAPH_H
+#ifndef LEMON_SAGE_GRAPH_H
+#define LEMON_SAGE_GRAPH_H
#include <iostream>
#include <vector>
-#include <hugo/invalid.h>
+#include <lemon/invalid.h>
-namespace hugo {
+namespace lemon {
// template <typename It>
// int count(It it) {
@@ -536,6 +536,6 @@
typedef SymEdgeIt InEdgeIt;
};
-} //namespace hugo
+} //namespace lemon
-#endif //HUGO_SAGE_GRAPH_H
+#endif //LEMON_SAGE_GRAPH_H
More information about the Lemon-commits
mailing list