[Lemon-commits] [Lemon-1.0 commits] Alpar Juttner: Merge
Lemon HG
hg at lemon.cs.elte.hu
Fri Oct 10 12:02:05 CEST 2008
details: http://lemon.cs.elte.hu/hg/lemon-1.0/rev/a0ab96ad65fe
changeset: 324:a0ab96ad65fe
user: Alpar Juttner <alpar [at] cs.elte.hu>
date: Thu Oct 09 16:20:37 2008 +0100
description:
Merge
diffstat:
40 files changed, 1155 insertions(+), 992 deletions(-)
Makefile.am | 12 -
README | 4
configure.ac | 14 -
demo/arg_parser_demo.cc | 2
demo/graph_to_eps_demo.cc | 2
doc/Makefile.am | 1
doc/groups.dox | 83 ++-----
doc/lgf.dox | 2
doc/mainpage.dox | 5
doc/migration.dox | 143 ++++++++++++
lemon/arg_parser.cc | 5
lemon/arg_parser.h | 4
lemon/bfs.h | 92 +++----
lemon/bits/alteration_notifier.h | 432 +++++++++++++++++--------------------
lemon/bits/array_map.h | 168 +++++++-------
lemon/bits/base_extender.h | 34 +-
lemon/bits/bezier.h | 10
lemon/bits/default_map.h | 9
lemon/bits/enable_if.h | 24 +-
lemon/bits/graph_extender.h | 86 +++----
lemon/bits/map_extender.h | 16 -
lemon/bits/traits.h | 6
lemon/bits/vector_map.h | 170 +++++++-------
lemon/color.h | 2
lemon/concepts/graph_components.h | 2
lemon/concepts/maps.h | 4
lemon/core.h | 26 +-
lemon/dfs.h | 92 +++----
lemon/dijkstra.h | 68 ++---
lemon/dim2.h | 54 +---
lemon/graph_to_eps.h | 2
lemon/lgf_reader.h | 112 +++------
lemon/lgf_writer.h | 114 +++------
lemon/list_graph.h | 2
lemon/maps.h | 188 ++++++++--------
lemon/path.h | 2
lemon/smart_graph.h | 8
lemon/time_measure.h | 19 -
tools/Makefile.am | 1
tools/lemon-0.x-to-1.x.sh | 127 ++++++++++
diffs (truncated from 4344 to 300 lines):
diff -r 689f24ee83e6 -r a0ab96ad65fe Makefile.am
--- a/Makefile.am Thu Oct 09 16:47:01 2008 +0200
+++ b/Makefile.am Thu Oct 09 16:20:37 2008 +0100
@@ -24,6 +24,7 @@
noinst_PROGRAMS =
bin_PROGRAMS =
check_PROGRAMS =
+dist_bin_SCRIPTS =
TESTS =
XFAIL_TESTS =
@@ -31,7 +32,6 @@
include test/Makefile.am
include doc/Makefile.am
include demo/Makefile.am
-include benchmark/Makefile.am
include tools/Makefile.am
MRPROPERFILES = \
diff -r 689f24ee83e6 -r a0ab96ad65fe README
--- a/README Thu Oct 09 16:47:01 2008 +0200
+++ b/README Thu Oct 09 16:20:37 2008 +0100
@@ -37,10 +37,6 @@
Contains programs to check the integrity and correctness of LEMON.
-benchmark/
-
- Contains programs for measuring the performance of algorithms.
-
tools/
Various utilities related to LEMON.
diff -r 689f24ee83e6 -r a0ab96ad65fe benchmark/Makefile.am
--- a/benchmark/Makefile.am Thu Oct 09 16:47:01 2008 +0200
+++ /dev/null Thu Jan 01 00:00:00 1970 +0000
@@ -1,7 +0,0 @@
-if WANT_BENCHMARK
-
-noinst_HEADERS +=
-
-noinst_PROGRAMS +=
-
-endif WANT_BENCHMARK
diff -r 689f24ee83e6 -r a0ab96ad65fe configure.ac
--- a/configure.ac Thu Oct 09 16:47:01 2008 +0200
+++ b/configure.ac Thu Oct 09 16:20:37 2008 +0100
@@ -81,19 +81,6 @@
fi
AM_CONDITIONAL([WANT_TOOLS], [test x"$enable_tools" != x"no"])
-dnl Disable/enable building the benchmarks.
-AC_ARG_ENABLE([benchmark],
-AS_HELP_STRING([--enable-benchmark], [build the benchmarks])
-AS_HELP_STRING([--disable-benchmark], [do not build the benchmarks @<:@default@:>@]),
- [], [enable_benchmark=no])
-AC_MSG_CHECKING([whether to build the benchmarks])
-if test x"$enable_benchmark" != x"no"; then
- AC_MSG_RESULT([yes])
-else
- AC_MSG_RESULT([no])
-fi
-AM_CONDITIONAL([WANT_BENCHMARK], [test x"$enable_benchmark" != x"no"])
-
dnl Checks for header files.
AC_CHECK_HEADERS(limits.h sys/time.h sys/times.h unistd.h)
@@ -132,7 +119,6 @@
#echo CPLEX support................. : $lx_cplex_found
#echo SOPLEX support................ : $lx_soplex_found
#echo
-echo Build benchmarks.............. : $enable_benchmark
echo Build demo programs........... : $enable_demo
echo Build additional tools........ : $enable_tools
echo
diff -r 689f24ee83e6 -r a0ab96ad65fe demo/arg_parser_demo.cc
--- a/demo/arg_parser_demo.cc Thu Oct 09 16:47:01 2008 +0200
+++ b/demo/arg_parser_demo.cc Thu Oct 09 16:20:37 2008 +0100
@@ -27,7 +27,7 @@
#include <lemon/arg_parser.h>
using namespace lemon;
-int main(int argc, const char **argv)
+int main(int argc, char **argv)
{
// Initialize the argument parser
ArgParser ap(argc, argv);
diff -r 689f24ee83e6 -r a0ab96ad65fe demo/graph_to_eps_demo.cc
--- a/demo/graph_to_eps_demo.cc Thu Oct 09 16:47:01 2008 +0200
+++ b/demo/graph_to_eps_demo.cc Thu Oct 09 16:20:37 2008 +0100
@@ -26,7 +26,7 @@
/// graphToEps(), and showing how to draw directed graphs,
/// how to handle parallel egdes, how to change the properties (like
/// color, shape, size, title etc.) of nodes and arcs individually
-/// using appropriate \ref maps-page "graph maps".
+/// using appropriate graph maps.
///
/// \include graph_to_eps_demo.cc
diff -r 689f24ee83e6 -r a0ab96ad65fe doc/Makefile.am
--- a/doc/Makefile.am Thu Oct 09 16:47:01 2008 +0200
+++ b/doc/Makefile.am Thu Oct 09 16:20:37 2008 +0100
@@ -7,6 +7,7 @@
doc/lgf.dox \
doc/license.dox \
doc/mainpage.dox \
+ doc/migration.dox \
doc/named-param.dox \
doc/namespaces.dox \
doc/html \
diff -r 689f24ee83e6 -r a0ab96ad65fe doc/groups.dox
--- a/doc/groups.dox Thu Oct 09 16:47:01 2008 +0200
+++ b/doc/groups.dox Thu Oct 09 16:20:37 2008 +0100
@@ -54,7 +54,9 @@
You are free to use the graph structure that fit your requirements
the best, most graph algorithms and auxiliary data structures can be used
-with any graph structures.
+with any graph structure.
+
+<b>See also:</b> \ref graph_concepts "Graph Structure Concepts".
*/
/**
@@ -74,8 +76,10 @@
This group describes the map structures implemented in LEMON.
-LEMON provides several special purpose maps that e.g. combine
+LEMON provides several special purpose maps and map adaptors that e.g. combine
new maps from existing ones.
+
+<b>See also:</b> \ref map_concepts "Map Concepts".
*/
/**
@@ -86,7 +90,6 @@
This group describes maps that are specifically designed to assign
values to the nodes and arcs of graphs.
*/
-
/**
\defgroup map_adaptors Map Adaptors
@@ -104,7 +107,7 @@
The typical usage of this classes is passing implicit maps to
algorithms. If a function type algorithm is called then the function
type map adaptors can be used comfortable. For example let's see the
-usage of map adaptors with the \c digraphToEps() function.
+usage of map adaptors with the \c graphToEps() function.
\code
Color nodeColor(int deg) {
if (deg >= 2) {
@@ -118,13 +121,13 @@
Digraph::NodeMap<int> degree_map(graph);
- digraphToEps(graph, "graph.eps")
+ graphToEps(graph, "graph.eps")
.coords(coords).scaleToA4().undirected()
.nodeColors(composeMap(functorToMap(nodeColor), degree_map))
.run();
\endcode
The \c functorToMap() function makes an \c int to \c Color map from the
-\e nodeColor() function. The \c composeMap() compose the \e degree_map
+\c nodeColor() function. The \c composeMap() compose the \c degree_map
and the previously created map. The composed map is a proper function to
get the color of each node.
@@ -173,7 +176,6 @@
any kind of path structure.
\sa lemon::concepts::Path
-
*/
/**
@@ -184,7 +186,6 @@
This group describes some data structures implemented in LEMON in
order to make it easier to implement combinatorial algorithms.
*/
-
/**
@defgroup algs Algorithms
@@ -201,11 +202,11 @@
\brief Common graph search algorithms.
This group describes the common graph search algorithms like
-Breadth-first search (Bfs) and Depth-first search (Dfs).
+Breadth-First Search (BFS) and Depth-First Search (DFS).
*/
/**
- at defgroup shortest_path Shortest Path algorithms
+ at defgroup shortest_path Shortest Path Algorithms
@ingroup algs
\brief Algorithms for finding shortest paths.
@@ -213,7 +214,7 @@
*/
/**
- at defgroup max_flow Maximum Flow algorithms
+ at defgroup max_flow Maximum Flow Algorithms
@ingroup algs
\brief Algorithms for finding maximum flows.
@@ -241,11 +242,10 @@
fastest method to compute the maximum flow. All impelementations
provides functions to query the minimum cut, which is the dual linear
programming problem of the maximum flow.
-
*/
/**
- at defgroup min_cost_flow Minimum Cost Flow algorithms
+ at defgroup min_cost_flow Minimum Cost Flow Algorithms
@ingroup algs
\brief Algorithms for finding minimum cost flows and circulations.
@@ -255,7 +255,7 @@
*/
/**
- at defgroup min_cut Minimum Cut algorithms
+ at defgroup min_cut Minimum Cut Algorithms
@ingroup algs
\brief Algorithms for finding minimum cut in graphs.
@@ -282,11 +282,10 @@
If you want to find minimum cut just between two distinict nodes,
please see the \ref max_flow "Maximum Flow page".
-
*/
/**
- at defgroup graph_prop Connectivity and other graph properties
+ at defgroup graph_prop Connectivity and Other Graph Properties
@ingroup algs
\brief Algorithms for discovering the graph properties
@@ -298,7 +297,7 @@
*/
/**
- at defgroup planar Planarity embedding and drawing
+ at defgroup planar Planarity Embedding and Drawing
@ingroup algs
\brief Algorithms for planarity checking, embedding and drawing
@@ -310,7 +309,7 @@
*/
/**
- at defgroup matching Matching algorithms
+ at defgroup matching Matching Algorithms
@ingroup algs
\brief Algorithms for finding matchings in graphs and bipartite graphs.
@@ -348,11 +347,10 @@
\image html bipartite_matching.png
\image latex bipartite_matching.eps "Bipartite Matching" width=\textwidth
-
*/
/**
- at defgroup spantree Minimum Spanning Tree algorithms
+ at defgroup spantree Minimum Spanning Tree Algorithms
@ingroup algs
\brief Algorithms for finding a minimum cost spanning tree in a graph.
@@ -360,9 +358,8 @@
tree in a graph
*/
-
/**
- at defgroup auxalg Auxiliary algorithms
+ at defgroup auxalg Auxiliary Algorithms
@ingroup algs
\brief Auxiliary algorithms implemented in LEMON.
@@ -371,7 +368,8 @@
*/
/**
- at defgroup approx Approximation algorithms
+ at defgroup approx Approximation Algorithms
+ at ingroup algs
\brief Approximation algorithms.
This group describes the approximation and heuristic algorithms
@@ -385,22 +383,20 @@
This group describes some general optimization frameworks
implemented in LEMON.
-
More information about the Lemon-commits
mailing list