Diff [a78e5b779b69ebdea3a80452eb8e57498cb48212:c0c2f5c87aa648bc03a301c4443797ea80b6b83d] for / – LEMON

CMakeLists.txt

-                      r1264
+                      r1185
 FIND_PACKAGE(Doxygen)
 FIND_PACKAGE(Ghostscript)
+SET(LEMON_ENABLE_GLPK YES CACHE STRING "Enable GLPK solver backend.")
+SET(LEMON_ENABLE_ILOG YES CACHE STRING "Enable ILOG (CPLEX) solver backend.")
+SET(LEMON_ENABLE_COIN YES CACHE STRING "Enable COIN solver backend.")
+SET(LEMON_ENABLE_SOPLEX YES CACHE STRING "Enable SoPlex solver backend.")
+IF(LEMON_ENABLE_GLPK)
+  FIND_PACKAGE(GLPK 4.33)
+ENDIF(LEMON_ENABLE_GLPK)
+IF(LEMON_ENABLE_ILOG)
+  FIND_PACKAGE(ILOG)
+ENDIF(LEMON_ENABLE_ILOG)
+IF(LEMON_ENABLE_COIN)
+  FIND_PACKAGE(COIN)
+ENDIF(LEMON_ENABLE_COIN)
+IF(LEMON_ENABLE_SOPLEX)
+  FIND_PACKAGE(SOPLEX)
+ENDIF(LEMON_ENABLE_SOPLEX)
+IF(GLPK_FOUND)
+  SET(LEMON_HAVE_LP TRUE)
+  SET(LEMON_HAVE_MIP TRUE)
+  SET(LEMON_HAVE_GLPK TRUE)
+ENDIF(GLPK_FOUND)
+IF(ILOG_FOUND)
+  SET(LEMON_HAVE_LP TRUE)
+  SET(LEMON_HAVE_MIP TRUE)
+  SET(LEMON_HAVE_CPLEX TRUE)
+ENDIF(ILOG_FOUND)
+IF(COIN_FOUND)
+  SET(LEMON_HAVE_LP TRUE)
+  SET(LEMON_HAVE_MIP TRUE)
+  SET(LEMON_HAVE_CLP TRUE)
+  SET(LEMON_HAVE_CBC TRUE)
+ENDIF(COIN_FOUND)
+IF(SOPLEX_FOUND)
+  SET(LEMON_HAVE_LP TRUE)
+  SET(LEMON_HAVE_SOPLEX TRUE)
+ENDIF(SOPLEX_FOUND)
+IF(ILOG_FOUND)
+  SET(DEFAULT_LP "CPLEX")
+  SET(DEFAULT_MIP "CPLEX")
+ELSEIF(COIN_FOUND)
+  SET(DEFAULT_LP "CLP")
+  SET(DEFAULT_MIP "CBC")
+ELSEIF(GLPK_FOUND)
+  SET(DEFAULT_LP "GLPK")
+  SET(DEFAULT_MIP "GLPK")
+ELSEIF(SOPLEX_FOUND)
+  SET(DEFAULT_LP "SOPLEX")
+ENDIF()
+IF(NOT LEMON_DEFAULT_LP OR
+    (NOT ILOG_FOUND AND (LEMON_DEFAULT_LP STREQUAL "CPLEX")) OR
+    (NOT COIN_FOUND AND (LEMON_DEFAULT_LP STREQUAL "CLP")) OR
+    (NOT GLPK_FOUND AND (LEMON_DEFAULT_LP STREQUAL "GLPK")) OR
+    (NOT SOPLEX_FOUND AND (LEMON_DEFAULT_LP STREQUAL "SOPLEX")))
+  SET(LEMON_DEFAULT_LP ${DEFAULT_LP} CACHE STRING
+    "Default LP solver backend (GLPK, CPLEX, CLP or SOPLEX)" FORCE)
+ENDIF()
+IF(NOT LEMON_DEFAULT_MIP OR
+    (NOT ILOG_FOUND AND (LEMON_DEFAULT_MIP STREQUAL "CPLEX")) OR
+    (NOT COIN_FOUND AND (LEMON_DEFAULT_MIP STREQUAL "CBC")) OR
+    (NOT GLPK_FOUND AND (LEMON_DEFAULT_MIP STREQUAL "GLPK")))
+  SET(LEMON_DEFAULT_MIP ${DEFAULT_MIP} CACHE STRING
+    "Default MIP solver backend (GLPK, CPLEX or CBC)" FORCE)
+ENDIF()
+FIND_PACKAGE(GLPK 4.33)
+FIND_PACKAGE(CPLEX)
+FIND_PACKAGE(COIN)
 IF(DEFINED ENV{LEMON_CXX_WARNING})

INSTALL

-                      r1233
+                      r1208
--DLEMON_ENABLE_GLPK=NO
--DLEMON_ENABLE_COIN=NO
--DLEMON_ENABLE_ILOG=NO
-  Enable optional third party libraries. They are all enabled by default.
--DLEMON_DEFAULT_LP=GLPK
-  Sets the default LP solver backend. The supported values are
-  CPLEX, CLP and GLPK. By default, it is set to the first one which
-  is enabled and succesfully discovered.
--DLEMON_DEFAULT_MIP=GLPK
-  Sets the default MIP solver backend. The supported values are
-  CPLEX, CBC and GLPK. By default, it is set to the first one which
-  is enabled and succesfully discovered.
 -DGLPK_ROOT_DIR=DIRECTORY
 -DCOIN_ROOT_DIR=DIRECTORY
 -DILOG_ROOT_DIR=DIRECTORY
+-DCPLEX_ROOT_DIR=DIRECTORY
   Root directory prefixes of optional third party libraries.
+  Install root directory prefixes of optional third party libraries.
 Makefile Variables

NEWS

-                      r1281
+                      r962
--08-10 Version 1.3 released
-        This is major feature release
-        * New data structures
-          #69 : Bipartite graph concepts and implementations
-        * New algorithms
-          #177: Port Edmonds-Karp algorithm
-          #380, #405: Heuristic algorithm for the max clique problem
-          #386: Heuristic algorithms for symmetric TSP
-          ----: Nagamochi-Ibaraki algorithm [5087694945e4]
-          #397, #56: Max. cardinality search
-        * Other new features
-          #223: Thread safe graph and graph map implementations
-          #442: Different TimeStamp print formats
-          #457: File export functionality to LpBase
-          #362: Bidirectional iterator support for radixSort()
-        * Implementation improvements
-          ----: Network Simplex
-                #391: Better update process, pivot rule and arc mixing
-                #435: Improved Altering List pivot rule
-          #417: Various fine tunings in CostScaling
-          #438: Optional iteration limit in HowardMmc
-          #436: Ensure strongly polynomial running time for CycleCanceling
-                while keeping the same performance
-          ----: Make the CBC interface be compatible with latest CBC releases
-                [ee581a0ecfbf]
-        * CMAKE has become the default build environment (#434)
-          ----: Autotool support has been dropped
-          ----: Improved LP/MIP configuration
-                #465: Enable/disable options for LP/MIP backends
-                #446: Better CPLEX discovery
-                #460: Add cmake config to find SoPlex
-          ----: Allow CPACK configuration on all platforms
-          #390: Add 'Maintainer' CMAKE build type
-          #388: Add 'check' target.
-          #401: Add contrib dir
-          #389: Better version string setting in CMAKE
-          #433: Support shared library build
-          #416: Support testing with valgrind
-        * Doc improvements
-          #395: SOURCE_BROWSER Doxygen switch is configurable from CMAKE
-                update-external-tags CMAKE target
-          #455: Optionally use MathJax for rendering the math formulae
-          #402, #437, #459, #456, #463: Various doc improvements
-        * Bugfixes (compared to release 1.2):
-          #432: Add missing doc/template.h and doc/references.bib to release
-                tarball
-          ----: Intel C++ compatibility fixes
-          #441: Fix buggy reinitialization in _solver_bits::VarIndex::clear()
-          #444: Bugfix in path copy constructors and assignment operators
-          #447: Bugfix in AllArcLookUp<>
-          #448: Bugfix in adaptor_test.cc
-          #449: Fix clang compilation warnings and errors
-          #440: Fix a bug + remove redundant typedefs in dimacs-solver
-          #453: Avoid GCC 4.7 compiler warnings
-          #445: Fix missing initialization in CplexEnv::CplexEnv()
-          #428: Add missing lemon/lemon.pc.cmake to the release tarball
-          #393: Create and install lemon.pc
-          #429: Fix VS warnings
-          #430: Fix LpBase::Constr two-side limit bug
-          #392: Bug fix in Dfs::start(s,t)
-          #414: Fix wrong initialization in Preflow
-          #418: Better Win CodeBlock/MinGW support
-          #419: Build environment improvements
-                - Build of mip_test and lp_test precede the running of the tests
-                - Also search for coin libs under ${COIN_ROOT_DIR}/lib/coin
-                - Do not look for COIN_VOL libraries
-          #382: Allow lgf file without Arc maps
-          #417: Bug fix in CostScaling
-          #366: Fix Pred[Matrix]MapPath::empty()
-          #371: Bug fix in (di)graphCopy()
-                The target graph is cleared before adding nodes and arcs/edges.
-          #364: Add missing UndirectedTags
-          #368: Fix the usage of std::numeric_limits<>::min() in Network Simplex
-          #372: Fix a critical bug in preflow
-          #461: Bugfix in assert.h
-          #470: Fix compilation issues related to various gcc versions
-          #446: Fix #define indicating CPLEX availability
-          #294: Add explicit namespace to
-                ignore_unused_variable_warning() usages
-          #420: Bugfix in IterableValueMap
-          #439: Bugfix in biNodeConnected()
 -03-19 Version 1.2 released

cmake/FindCOIN.cmake

-                      r1232
+                      r1120
   COIN_BZ2_LIBRARY
+)
+IF(COIN_FOUND)
+  SET(LEMON_HAVE_LP TRUE)
+  SET(LEMON_HAVE_MIP TRUE)
+  SET(LEMON_HAVE_CLP TRUE)
+  SET(LEMON_HAVE_CBC TRUE)
+ENDIF(COIN_FOUND)

cmake/FindGLPK.cmake

-                      r1232
+                      r685
 MARK_AS_ADVANCED(GLPK_LIBRARY GLPK_INCLUDE_DIR GLPK_BIN_DIR)
+IF(GLPK_FOUND)
+  SET(LEMON_HAVE_LP TRUE)
+  SET(LEMON_HAVE_MIP TRUE)
+  SET(LEMON_HAVE_GLPK TRUE)
+ENDIF(GLPK_FOUND)

doc/CMakeLists.txt

-                      r1251
+                      r1209
 SET(LEMON_DOC_USE_MATHJAX "NO" CACHE STRING "Use MathJax to display math formulae (YES/NO).")
 SET(LEMON_DOC_MATHJAX_RELPATH "http://www.mathjax.org/mathjax" CACHE STRING "MathJax library location.")
-SET(LEMON_DOC_LIBSTDC++_URL
-  "http://gcc.gnu.org/onlinedocs/gcc-4.7.3/libstdc++/api"
-  CACHE STRING "GCC libstdc++ doxygen doc url.")
 CONFIGURE_FILE(
 …
     COMMAND ${CMAKE_COMMAND} -E remove_directory gen-images
     COMMAND ${CMAKE_COMMAND} -E make_directory gen-images
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r20 -sOutputFile=gen-images/grid_graph.png ${CMAKE_CURRENT_SOURCE_DIR}/images/grid_graph.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r32 -sOutputFile=gen-images/adaptors2.png ${CMAKE_CURRENT_SOURCE_DIR}/images/adaptors2.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r32 -sOutputFile=gen-images/connected_components.png ${CMAKE_CURRENT_SOURCE_DIR}/images/connected_components.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r32 -sOutputFile=gen-images/strongly_connected_components.png ${CMAKE_CURRENT_SOURCE_DIR}/images/strongly_connected_components.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r32 -sOutputFile=gen-images/node_biconnected_components.png ${CMAKE_CURRENT_SOURCE_DIR}/images/node_biconnected_components.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r32 -sOutputFile=gen-images/edge_biconnected_components.png ${CMAKE_CURRENT_SOURCE_DIR}/images/edge_biconnected_components.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r32 -sOutputFile=gen-images/bipartite_partitions.png ${CMAKE_CURRENT_SOURCE_DIR}/images/bipartite_partitions.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r24 -sOutputFile=gen-images/matching.png ${CMAKE_CURRENT_SOURCE_DIR}/images/matching.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r24 -sOutputFile=gen-images/bipartite_matching.png ${CMAKE_CURRENT_SOURCE_DIR}/images/bipartite_matching.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r40 -sOutputFile=gen-images/planar.png ${CMAKE_CURRENT_SOURCE_DIR}/images/planar.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r24 -sOutputFile=gen-images/tsp.png ${CMAKE_CURRENT_SOURCE_DIR}/images/tsp.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r8 -sOutputFile=gen-images/nodeshape_0.png ${CMAKE_CURRENT_SOURCE_DIR}/images/nodeshape_0.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r8 -sOutputFile=gen-images/nodeshape_1.png ${CMAKE_CURRENT_SOURCE_DIR}/images/nodeshape_1.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r8 -sOutputFile=gen-images/nodeshape_2.png ${CMAKE_CURRENT_SOURCE_DIR}/images/nodeshape_2.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r8 -sOutputFile=gen-images/nodeshape_3.png ${CMAKE_CURRENT_SOURCE_DIR}/images/nodeshape_3.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r8 -sOutputFile=gen-images/nodeshape_4.png ${CMAKE_CURRENT_SOURCE_DIR}/images/nodeshape_4.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r18 -sOutputFile=gen-images/bipartite_matching.png ${CMAKE_CURRENT_SOURCE_DIR}/images/bipartite_matching.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r18 -sOutputFile=gen-images/bipartite_partitions.png ${CMAKE_CURRENT_SOURCE_DIR}/images/bipartite_partitions.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r18 -sOutputFile=gen-images/connected_components.png ${CMAKE_CURRENT_SOURCE_DIR}/images/connected_components.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r18 -sOutputFile=gen-images/edge_biconnected_components.png ${CMAKE_CURRENT_SOURCE_DIR}/images/edge_biconnected_components.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r18 -sOutputFile=gen-images/grid_graph.png ${CMAKE_CURRENT_SOURCE_DIR}/images/grid_graph.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r18 -sOutputFile=gen-images/matching.png ${CMAKE_CURRENT_SOURCE_DIR}/images/matching.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r18 -sOutputFile=gen-images/node_biconnected_components.png ${CMAKE_CURRENT_SOURCE_DIR}/images/node_biconnected_components.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r18 -sOutputFile=gen-images/nodeshape_0.png ${CMAKE_CURRENT_SOURCE_DIR}/images/nodeshape_0.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r18 -sOutputFile=gen-images/nodeshape_1.png ${CMAKE_CURRENT_SOURCE_DIR}/images/nodeshape_1.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r18 -sOutputFile=gen-images/nodeshape_2.png ${CMAKE_CURRENT_SOURCE_DIR}/images/nodeshape_2.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r18 -sOutputFile=gen-images/nodeshape_3.png ${CMAKE_CURRENT_SOURCE_DIR}/images/nodeshape_3.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r18 -sOutputFile=gen-images/nodeshape_4.png ${CMAKE_CURRENT_SOURCE_DIR}/images/nodeshape_4.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r18 -sOutputFile=gen-images/planar.png ${CMAKE_CURRENT_SOURCE_DIR}/images/planar.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r18 -sOutputFile=gen-images/strongly_connected_components.png ${CMAKE_CURRENT_SOURCE_DIR}/images/strongly_connected_components.eps
+    COMMAND ${GHOSTSCRIPT_EXECUTABLE} ${GHOSTSCRIPT_OPTIONS} -r18 -sOutputFile=gen-images/tsp.png ${CMAKE_CURRENT_SOURCE_DIR}/images/tsp.eps
     COMMAND ${CMAKE_COMMAND} -E remove_directory html
+    COMMAND ${PYTHON_EXECUTABLE} ${PROJECT_SOURCE_DIR}/scripts/bib2dox.py ${CMAKE_CURRENT_SOURCE_DIR}/references.bib >references.dox
     COMMAND ${DOXYGEN_EXECUTABLE} Doxyfile
     WORKING_DIRECTORY ${CMAKE_CURRENT_BINARY_DIR}
 …
 IF(WGET_FOUND)
 ADD_CUSTOM_TARGET(update-external-tags
   COMMAND ${WGET_EXECUTABLE} -N ${LEMON_DOC_LIBSTDC++_URL}/libstdc++.tag
+  COMMAND ${WGET_EXECUTABLE} -N http://gcc.gnu.org/onlinedocs/libstdc++/latest-doxygen/libstdc++.tag
   WORKING_DIRECTORY ${CMAKE_CURRENT_BINARY_DIR}
+  )

doc/Doxyfile.in

-                      r1251
+                      r1208
 FILE_VERSION_FILTER    =
 LAYOUT_FILE            = "@abs_top_srcdir@/doc/DoxygenLayout.xml"
-CITE_BIB_FILES         = "@abs_top_srcdir@/doc/references.bib"
 #---------------------------------------------------------------------------
 # configuration options related to warning and progress messages
 …
                          "@abs_top_srcdir@/tools" \
                          "@abs_top_srcdir@/test/test_tools.h" \
+                         "@abs_top_builddir@/doc/mainpage.dox"
+                         "@abs_top_builddir@/doc/mainpage.dox" \
+                         "@abs_top_builddir@/doc/references.dox"
 INPUT_ENCODING         = UTF-8
 FILE_PATTERNS          = *.h \
 …
 # Configuration::additions related to external references
 #---------------------------------------------------------------------------
 TAGFILES               = "@abs_top_builddir@/doc/libstdc++.tag = @LEMON_DOC_LIBSTDC++_URL@"
+TAGFILES               = "@abs_top_builddir@/doc/libstdc++.tag = http://gcc.gnu.org/onlinedocs/libstdc++/latest-doxygen/  "
 GENERATE_TAGFILE       = html/lemon.tag
 ALLEXTERNALS           = NO

doc/DoxygenLayout.xml

r1251	r1036
18	18	<tab type="globals" visible="yes" title="" intro=""/>
19	19	</tab>
	20	<tab type="dirs" visible="yes" title="" intro=""/>
20	21	<tab type="examples" visible="yes" title="" intro=""/>
21	22	<tab type="pages" visible="yes" title="" intro=""/>

doc/coding_style.dox

r1270	r1023
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2009
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

doc/dirs.dox

r1270	r1031
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2009
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

doc/groups.dox

-                      r1271
+                      r1206
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
 detailed documentation of particular adaptors.
-Since the adaptor classes conform to the \ref graph_concepts "graph concepts",
-an adaptor can even be applied to another one.
-The following image illustrates a situation when a \ref SubDigraph adaptor
-is applied on a digraph and \ref Undirector is applied on the subgraph.
-\image html adaptors2.png
-\image latex adaptors2.eps "Using graph adaptors" width=\textwidth
 The behavior of graph adaptors can be very different. Some of them keep
 capabilities of the original graph while in other cases this would be
 …
 This group contains the common graph search algorithms, namely
 \e breadth-first \e search (BFS) and \e depth-first \e search (DFS)
 \cite clrs01algorithms.
+\ref clrs01algorithms.
 */
 …
 This group contains the algorithms for finding shortest paths in digraphs
 \cite clrs01algorithms.
+\ref clrs01algorithms.
  - \ref Dijkstra algorithm for finding shortest paths from a source node
 …
 This group contains the algorithms for finding minimum cost spanning
 trees and arborescences \cite clrs01algorithms.
+trees and arborescences \ref clrs01algorithms.
 */
 …
 This group contains the algorithms for finding maximum flows and
 feasible circulations \cite clrs01algorithms, \cite amo93networkflows.
+feasible circulations \ref clrs01algorithms, \ref amo93networkflows.
 The \e maximum \e flow \e problem is to find a flow of maximum value between
 …
 LEMON contains several algorithms for solving maximum flow problems:
 - \ref EdmondsKarp Edmonds-Karp algorithm
   \cite edmondskarp72theoretical.
+  \ref edmondskarp72theoretical.
 - \ref Preflow Goldberg-Tarjan's preflow push-relabel algorithm
   \cite goldberg88newapproach.
+  \ref goldberg88newapproach.
 - \ref DinitzSleatorTarjan Dinitz's blocking flow algorithm with dynamic trees
   \cite dinic70algorithm, \cite sleator83dynamic.
+  \ref dinic70algorithm, \ref sleator83dynamic.
 - \ref GoldbergTarjan !Preflow push-relabel algorithm with dynamic trees
   \cite goldberg88newapproach, \cite sleator83dynamic.
+  \ref goldberg88newapproach, \ref sleator83dynamic.
 In most cases the \ref Preflow algorithm provides the
 …
 This group contains the algorithms for finding minimum cost flows and
 circulations \cite amo93networkflows. For more information about this
 problem and its dual solution, see: \ref min_cost_flow
+circulations \ref amo93networkflows. For more information about this
+problem and its dual solution, see \ref min_cost_flow
 "Minimum Cost Flow Problem".
 LEMON contains several algorithms for this problem.
  - \ref NetworkSimplex Primal Network Simplex algorithm with various
    pivot strategies \cite dantzig63linearprog, \cite kellyoneill91netsimplex.
+   pivot strategies \ref dantzig63linearprog, \ref kellyoneill91netsimplex.
  - \ref CostScaling Cost Scaling algorithm based on push/augment and
    relabel operations \cite goldberg90approximation, \cite goldberg97efficient,
    \cite bunnagel98efficient.
+   relabel operations \ref goldberg90approximation, \ref goldberg97efficient,
+   \ref bunnagel98efficient.
  - \ref CapacityScaling Capacity Scaling algorithm based on the successive
    shortest path method \cite edmondskarp72theoretical.
+   shortest path method \ref edmondskarp72theoretical.
  - \ref CycleCanceling Cycle-Canceling algorithms, two of which are
    strongly polynomial \cite klein67primal, \cite goldberg89cyclecanceling.
+   strongly polynomial \ref klein67primal, \ref goldberg89cyclecanceling.
 In general, \ref NetworkSimplex and \ref CostScaling are the most efficient
 …
 However, other algorithms could be faster in special cases.
 For example, if the total supply and/or capacities are rather small,
+\ref CapacityScaling is usually the fastest algorithm
+(without effective scaling).
+\ref CapacityScaling is usually the fastest algorithm (without effective scaling).
 These classes are intended to be used with integer-valued input data
 …
 which is capable of handling real-valued arc costs (other numerical
 data are required to be integer).
-For more details about these implementations and for a comprehensive
-experimental study, see the paper \cite KiralyKovacs12MCF.
-It also compares these codes to other publicly available
-minimum cost flow solvers.
 */
 …
 This group contains the algorithms for finding minimum mean cycles
 \cite amo93networkflows, \cite karp78characterization.
+\ref amo93networkflows, \ref karp78characterization.
 The \e minimum \e mean \e cycle \e problem is to find a directed cycle
 …
 LEMON contains three algorithms for solving the minimum mean cycle problem:
 - \ref KarpMmc Karp's original algorithm \cite karp78characterization.
+- \ref KarpMmc Karp's original algorithm \ref karp78characterization.
 - \ref HartmannOrlinMmc Hartmann-Orlin's algorithm, which is an improved
   version of Karp's algorithm \cite hartmann93finding.
+  version of Karp's algorithm \ref hartmann93finding.
 - \ref HowardMmc Howard's policy iteration algorithm
   \cite dasdan98minmeancycle, \cite dasdan04experimental.
+  \ref dasdan98minmeancycle, \ref dasdan04experimental.
 In practice, the \ref HowardMmc "Howard" algorithm turned out to be by far the
 …
 time is exponential.
 Both \ref KarpMmc "Karp" and \ref HartmannOrlinMmc "Hartmann-Orlin" algorithms
+run in time O(nm) and use space O(n<sup>2</sup>+m).
+run in time O(ne) and use space O(n<sup>2</sup>+e), but the latter one is
+typically faster due to the applied early termination scheme.
 */
 …
 \image latex planar.eps "Plane graph" width=\textwidth
 */
 /**
 @defgroup tsp Traveling Salesman Problem
 …
 high-level interface.
 The currently supported solvers are \cite glpk, \cite clp, \cite cbc,
 \cite cplex, \cite soplex.
+The currently supported solvers are \ref glpk, \ref clp, \ref cbc,
+\ref cplex, \ref soplex.
 */
 …
 This group contains general \c EPS drawing methods and special
 graph exporting tools.
-\image html graph_to_eps.png
 */

doc/images/bipartite_partitions.eps

-                      r1213
+                      r634
 %!PS-Adobe-2.0 EPSF-2.0
 %%Creator: LEMON, graphToEps()
 %%CreationDate: Fri Mar  8 00:18:43 2013
+%%CreationDate: Tue Nov 15 16:51:43 2005
 %%BoundingBox: 0 0 842 596
 %%EndComments
 …
 %Edges:
 gsave
 .857 -446.322 296.569 -487.43 79.2808 -528.539 0 0 0 7.00153 lb
 .857 -446.322 575.52 -315.656 637.183 -184.989 0 0 0 7.00153 lb
 .468 566.711 494.771 434.577 596.074 302.442 0 0 0 7.00153 lb
 .468 566.711 155.625 579.925 -82.2171 593.138 0 0 0 7.00153 lb
 .468 566.711 251.056 450.726 108.644 334.741 0 0 0 7.00153 lb
 .153 52.8539 732.613 177.648 596.074 302.442 0 0 0 7.00153 lb
 .153 52.8539 753.168 -66.0676 637.183 -184.989 0 0 0 7.00153 lb
 -82.2171 593.138 -91.0261 346.487 -99.8351 99.8351 0 0 0 7.00153 lb
 -663.61 546.157 -753.168 394.936 -842.726 243.715 0 0 0 7.00153 lb
 -663.61 546.157 -574.052 437.513 -484.494 328.869 0 0 0 7.00153 lb
 -1077.63 161.498 -960.178 202.606 -842.726 243.715 0 0 0 7.00153 lb
 -1077.63 161.498 -968.987 66.0674 -860.344 -29.3633 0 0 0 7.00153 lb
 -1177.47 -234.906 -1029.18 -381.722 -880.898 -528.539 0 0 0 7.00153 lb
 -1177.47 -234.906 -1018.91 -132.135 -860.344 -29.3633 0 0 0 7.00153 lb
 -880.898 -528.539 -744.359 -387.595 -607.82 -246.651 0 0 0 7.00153 lb
 -499.175 -499.175 -355.295 -475.685 -211.415 -452.194 0 0 0 7.00153 lb
 -499.175 -499.175 -553.498 -372.913 -607.82 -246.651 0 0 0 7.00153 lb
 -499.175 -499.175 -386.587 -315.087 -274 -131 0 0 0 7.00153 lb
 .2808 -528.539 -66.0671 -490.366 -211.415 -452.194 0 0 0 7.00153 lb
 .183 -184.989 421.363 -253.993 205.543 -322.996 0 0 0 7.00153 lb
 .543 -322.996 162.966 -226.097 120.389 -129.198 0 0 0 7.00153 lb
 .34 88.0898 259.865 -20.5541 120.389 -129.198 0 0 0 7.00153 lb
 .34 88.0898 253.992 211.415 108.644 334.741 0 0 0 7.00153 lb
 -842.726 243.715 -471.281 171.775 -99.8351 99.8351 0 0 0 7.00153 lb
 -842.726 243.715 -558.363 56.3575 -274 -131 0 0 0 7.00153 lb
 -860.344 -29.3633 -734.082 -138.007 -607.82 -246.651 0 0 0 7.00153 lb
 -211.415 -452.194 -45.513 -290.696 120.389 -129.198 0 0 0 7.00153 lb
 -99.8351 99.8351 4.40445 217.288 108.644 334.741 0 0 0 7.00153 lb
 -99.8351 99.8351 -292.165 214.352 -484.494 328.869 0 0 0 7.00153 lb
 .389 -129.198 -76.8055 -130.099 -274 -131 0 0 0 7.00153 lb
+.857 -446.322 296.569 -487.43 79.2808 -528.539 0 0 0 2 lb
+.857 -446.322 575.52 -315.655 637.183 -184.989 0 0 0 2 lb
+.468 566.711 494.771 434.577 596.074 302.442 0 0 0 2 lb
+.468 566.711 155.625 579.925 -82.2171 593.138 0 0 0 2 lb
+.468 566.711 251.056 450.726 108.644 334.741 0 0 0 2 lb
+.153 52.8539 732.613 177.648 596.074 302.442 0 0 0 2 lb
+.153 52.8539 753.168 -66.0676 637.183 -184.989 0 0 0 2 lb
+-82.2171 593.138 -91.0261 346.487 -99.8351 99.8351 0 0 0 2 lb
+-663.61 546.157 -753.168 394.936 -842.726 243.715 0 0 0 2 lb
+-663.61 546.157 -574.052 437.513 -484.494 328.869 0 0 0 2 lb
+-1077.63 161.498 -960.178 202.606 -842.726 243.715 0 0 0 2 lb
+-1077.63 161.498 -968.987 66.0674 -860.344 -29.3633 0 0 0 2 lb
+-1177.47 -234.906 -1029.18 -381.722 -880.898 -528.539 0 0 0 2 lb
+-1177.47 -234.906 -1018.91 -132.135 -860.344 -29.3633 0 0 0 2 lb
+-880.898 -528.539 -744.359 -387.595 -607.82 -246.651 0 0 0 2 lb
+-499.175 -499.175 -355.295 -475.685 -211.415 -452.194 0 0 0 2 lb
+-499.175 -499.175 -553.498 -372.913 -607.82 -246.651 0 0 0 2 lb
+-499.175 -499.175 -386.587 -315.087 -274 -131 0 0 0 2 lb
+.2808 -528.539 -66.0671 -490.366 -211.415 -452.194 0 0 0 2 lb
+.183 -184.989 421.363 -253.993 205.543 -322.996 0 0 0 2 lb
+.543 -322.996 162.966 -226.097 120.389 -129.198 0 0 0 2 lb
+.34 88.0898 259.865 -20.5541 120.389 -129.198 0 0 0 2 lb
+.34 88.0898 253.992 211.415 108.644 334.741 0 0 0 2 lb
+-842.726 243.715 -471.281 171.775 -99.8351 99.8351 0 0 0 2 lb
+-842.726 243.715 -558.363 56.3575 -274 -131 0 0 0 2 lb
+-860.344 -29.3633 -734.082 -138.007 -607.82 -246.651 0 0 0 2 lb
+-211.415 -452.194 -45.513 -290.696 120.389 -129.198 0 0 0 2 lb
+-99.8351 99.8351 4.40445 217.288 108.644 334.741 0 0 0 2 lb
+-99.8351 99.8351 -292.165 214.352 -484.494 328.869 0 0 0 2 lb
+.389 -129.198 -76.8055 -130.099 -274 -131 0 0 0 2 lb
 grestore
 %Nodes:
 gsave
 -274 -131 23.3384 1 0 0 nc
 -607.82 -246.651 23.3384 1 0 0 nc
 -484.494 328.869 23.3384 0 0 1 nc
 .644 334.741 23.3384 0 0 1 nc
 .389 -129.198 23.3384 0 0 1 nc
 -99.8351 99.8351 23.3384 1 0 0 nc
 -211.415 -452.194 23.3384 1 0 0 nc
 -860.344 -29.3633 23.3384 0 0 1 nc
 -842.726 243.715 23.3384 0 0 1 nc
 .34 88.0898 23.3384 1 0 0 nc
 .543 -322.996 23.3384 1 0 0 nc
 .183 -184.989 23.3384 0 0 1 nc
 .2808 -528.539 23.3384 0 0 1 nc
 -499.175 -499.175 23.3384 0 0 1 nc
 -880.898 -528.539 23.3384 0 0 1 nc
 -1177.47 -234.906 23.3384 1 0 0 nc
 -1077.63 161.498 23.3384 1 0 0 nc
 -663.61 546.157 23.3384 1 0 0 nc
 -82.2171 593.138 23.3384 0 0 1 nc
 .074 302.442 23.3384 0 0 1 nc
 .153 52.8539 23.3384 1 0 0 nc
 .468 566.711 23.3384 1 0 0 nc
 .857 -446.322 23.3384 1 0 0 nc
+-274 -131 20 1 0 0 nc
+-607.82 -246.651 20 1 0 0 nc
+-484.494 328.869 20 0 0 1 nc
+.644 334.741 20 0 0 1 nc
+.389 -129.198 20 0 0 1 nc
+-99.8351 99.8351 20 1 0 0 nc
+-211.415 -452.194 20 1 0 0 nc
+-860.344 -29.3633 20 0 0 1 nc
+-842.726 243.715 20 0 0 1 nc
+.34 88.0898 20 1 0 0 nc
+.543 -322.996 20 1 0 0 nc
+.183 -184.989 20 0 0 1 nc
+.2808 -528.539 20 0 0 1 nc
+-499.175 -499.175 20 0 0 1 nc
+-880.898 -528.539 20 0 0 1 nc
+-1177.47 -234.906 20 1 0 0 nc
+-1077.63 161.498 20 1 0 0 nc
+-663.61 546.157 20 1 0 0 nc
+-82.2171 593.138 20 0 0 1 nc
+.074 302.442 20 0 0 1 nc
+.153 52.8539 20 1 0 0 nc
+.468 566.711 20 1 0 0 nc
+.857 -446.322 20 1 0 0 nc
 grestore
 grestore

doc/images/connected_components.eps

-                      r1213
+                      r634
 %!PS-Adobe-2.0 EPSF-2.0
 %%Creator: LEMON, graphToEps()
 %%CreationDate: Fri Mar  8 00:18:43 2013
+%%CreationDate: Fri Nov  4 13:47:12 2005
 %%BoundingBox: 0 0 842 596
 %%EndComments
 …
 %Edges:
 gsave
 .035 177.301 622.149 225.748 670.264 274.195 0 0 0 6.25356 lb
 .579 115.483 682.421 194.839 670.264 274.195 0 0 0 6.25356 lb
 .402 10.3938 246.402 -6.60595 212.403 -23.6057 0 0 0 6.25356 lb
 .402 10.3938 283.493 -18.9695 286.584 -48.3327 0 0 0 6.25356 lb
 .403 -23.6057 249.493 -35.9692 286.584 -48.3327 0 0 0 6.25356 lb
 .584 -48.3327 326.765 -79.2414 366.947 -110.15 0 0 0 6.25356 lb
 .584 -48.3327 278.857 -111.695 271.13 -175.058 0 0 0 6.25356 lb
 .037 -88.514 417.946 -142.604 397.855 -196.694 0 0 0 6.25356 lb
 .037 -88.514 402.492 -99.332 366.947 -110.15 0 0 0 6.25356 lb
 .855 -196.694 382.401 -153.422 366.947 -110.15 0 0 0 6.25356 lb
 .947 -110.15 319.038 -142.604 271.13 -175.058 0 0 0 6.25356 lb
 .13 -175.058 274.221 -213.694 277.311 -252.33 0 0 0 6.25356 lb
 .13 -175.058 238.675 -190.512 206.221 -205.967 0 0 0 6.25356 lb
 .311 -252.33 241.766 -229.149 206.221 -205.967 0 0 0 6.25356 lb
 -840.856 -246.718 -804.351 -66.7145 -767.847 113.289 0 0 0 6.25356 lb
 -579.033 445.603 -673.44 279.446 -767.847 113.289 0 0 0 6.25356 lb
 -579.033 445.603 -524.906 302.104 -470.779 158.605 0 0 0 6.25356 lb
 -767.847 113.289 -619.313 135.947 -470.779 158.605 0 0 0 6.25356 lb
 .312 201.403 946.592 42.798 986.873 -115.807 0 0 0 6.25356 lb
 .312 201.403 834.562 91.8901 762.812 -17.6227 0 0 0 6.25356 lb
 .873 -115.807 874.842 -66.7148 762.812 -17.6227 0 0 0 6.25356 lb
 -470.779 158.605 -390.218 50.3508 -309.657 -57.9033 0 0 0 6.25356 lb
 .945 521.129 208.955 541.269 -5.03507 561.41 0 0 0 6.25356 lb
 .945 521.129 376.371 417.911 329.797 314.692 0 0 0 6.25356 lb
 .945 521.129 474.554 276.928 526.164 32.7279 0 0 0 6.25356 lb
 -5.03507 561.41 -36.5042 440.568 -67.9734 319.727 0 0 0 6.25356 lb
 .797 314.692 130.912 317.209 -67.9734 319.727 0 0 0 6.25356 lb
 -67.9734 319.727 229.095 176.227 526.164 32.7279 0 0 0 6.25356 lb
 .812 -17.6227 644.488 7.5526 526.164 32.7279 0 0 0 6.25356 lb
 .812 -17.6227 746.448 -162.381 730.084 -307.139 0 0 0 6.25356 lb
 .164 32.7279 470.779 -128.394 415.393 -289.516 0 0 0 6.25356 lb
 .084 -307.139 572.738 -298.327 415.393 -289.516 0 0 0 6.25356 lb
 .393 -289.516 173.71 -318.468 -67.9734 -347.42 0 0 0 6.25356 lb
 -67.9734 -347.42 -188.815 -202.662 -309.657 -57.9033 0 0 0 6.25356 lb
 -67.9734 -347.42 -195.758 -390.692 -323.543 -433.964 0 0 0 6.25356 lb
 -309.657 -57.9033 -424.775 -160.272 -539.894 -262.64 0 0 0 6.25356 lb
 -323.543 -433.964 -431.719 -348.302 -539.894 -262.64 0 0 0 6.25356 lb
 -26.6953 -19.9585 44.8558 -96.8093 116.407 -173.66 0 0 0 6.25356 lb
 -26.6953 -19.9585 87.2563 9.19185 201.208 38.3422 0 0 0 6.25356 lb
 -26.6953 -19.9585 -144.622 43.6422 -262.548 107.243 0 0 0 6.25356 lb
 -26.6953 -19.9585 -20.0703 56.8923 -13.4452 133.743 0 0 0 6.25356 lb
 .407 -173.66 158.808 -67.6589 201.208 38.3422 0 0 0 6.25356 lb
 -262.548 107.243 -137.997 120.493 -13.4452 133.743 0 0 0 6.25356 lb
 -262.548 107.243 -221.472 176.144 -180.397 245.045 0 0 0 6.25356 lb
 -13.4452 133.743 -96.9211 189.394 -180.397 245.045 0 0 0 6.25356 lb
 -180.397 245.045 -113.509 338.465 -132.697 451.748 0 0 0 6.25356 lb
 -180.397 245.045 -199.585 358.328 -132.697 451.748 0 0 0 6.25356 lb
 -416.25 345.746 -274.474 398.747 -132.697 451.748 0 0 0 6.25356 lb
 -416.25 345.746 -393.725 457.048 -371.2 568.349 0 0 0 6.25356 lb
 -132.697 451.748 -251.948 510.048 -371.2 568.349 0 0 0 6.25356 lb
 .264 274.195 629.188 409.347 588.113 544.499 0 0 0 6.25356 lb
 .264 274.195 797.466 341.771 924.667 409.347 0 0 0 6.25356 lb
 .113 544.499 756.39 476.923 924.667 409.347 0 0 0 6.25356 lb
 -689.204 -237.261 -587.735 -114.393 -567.302 43.6423 0 0 0 6.25356 lb
 -689.204 -237.261 -668.771 -79.2259 -567.302 43.6423 0 0 0 6.25356 lb
+.035 177.301 622.149 225.748 670.264 274.195 0 0 0 2 lb
+.579 115.483 682.421 194.839 670.264 274.195 0 0 0 2 lb
+.402 10.3938 246.402 -6.60595 212.403 -23.6057 0 0 0 2 lb
+.402 10.3938 283.493 -18.9695 286.584 -48.3327 0 0 0 2 lb
+.403 -23.6057 249.493 -35.9692 286.584 -48.3327 0 0 0 2 lb
+.584 -48.3327 326.765 -79.2414 366.947 -110.15 0 0 0 2 lb
+.584 -48.3327 278.857 -111.695 271.13 -175.058 0 0 0 2 lb
+.037 -88.514 417.946 -142.604 397.855 -196.694 0 0 0 2 lb
+.037 -88.514 402.492 -99.332 366.947 -110.15 0 0 0 2 lb
+.855 -196.694 382.401 -153.422 366.947 -110.15 0 0 0 2 lb
+.947 -110.15 319.038 -142.604 271.13 -175.058 0 0 0 2 lb
+.13 -175.058 274.221 -213.694 277.311 -252.33 0 0 0 2 lb
+.13 -175.058 238.675 -190.512 206.221 -205.967 0 0 0 2 lb
+.311 -252.33 241.766 -229.149 206.221 -205.967 0 0 0 2 lb
+-840.856 -246.718 -804.351 -66.7145 -767.847 113.289 0 0 0 2 lb
+-579.033 445.603 -673.44 279.446 -767.847 113.289 0 0 0 2 lb
+-579.033 445.603 -524.906 302.104 -470.779 158.605 0 0 0 2 lb
+-767.847 113.289 -619.313 135.947 -470.779 158.605 0 0 0 2 lb
+.312 201.403 946.592 42.798 986.873 -115.807 0 0 0 2 lb
+.312 201.403 834.562 91.8901 762.812 -17.6227 0 0 0 2 lb
+.873 -115.807 874.842 -66.7148 762.812 -17.6227 0 0 0 2 lb
+-470.779 158.605 -390.218 50.3508 -309.657 -57.9033 0 0 0 2 lb
+.945 521.129 208.955 541.269 -5.03507 561.41 0 0 0 2 lb
+.945 521.129 376.371 417.911 329.797 314.692 0 0 0 2 lb
+.945 521.129 474.554 276.928 526.164 32.7279 0 0 0 2 lb
+-5.03507 561.41 -36.5042 440.568 -67.9734 319.727 0 0 0 2 lb
+.797 314.692 130.912 317.209 -67.9734 319.727 0 0 0 2 lb
+-67.9734 319.727 229.095 176.227 526.164 32.7279 0 0 0 2 lb
+.812 -17.6227 644.488 7.5526 526.164 32.7279 0 0 0 2 lb
+.812 -17.6227 746.448 -162.381 730.084 -307.139 0 0 0 2 lb
+.164 32.7279 470.779 -128.394 415.393 -289.516 0 0 0 2 lb
+.084 -307.139 572.738 -298.327 415.393 -289.516 0 0 0 2 lb
+.393 -289.516 173.71 -318.468 -67.9734 -347.42 0 0 0 2 lb
+-67.9734 -347.42 -188.815 -202.662 -309.657 -57.9033 0 0 0 2 lb
+-67.9734 -347.42 -195.758 -390.692 -323.543 -433.964 0 0 0 2 lb
+-309.657 -57.9033 -424.775 -160.272 -539.894 -262.64 0 0 0 2 lb
+-323.543 -433.964 -431.719 -348.302 -539.894 -262.64 0 0 0 2 lb
+-26.6953 -19.9585 44.8558 -96.8093 116.407 -173.66 0 0 0 2 lb
+-26.6953 -19.9585 87.2563 9.19185 201.208 38.3422 0 0 0 2 lb
+-26.6953 -19.9585 -144.622 43.6422 -262.548 107.243 0 0 0 2 lb
+-26.6953 -19.9585 -20.0703 56.8923 -13.4452 133.743 0 0 0 2 lb
+.407 -173.66 158.808 -67.6589 201.208 38.3422 0 0 0 2 lb
+-262.548 107.243 -137.997 120.493 -13.4452 133.743 0 0 0 2 lb
+-262.548 107.243 -221.472 176.144 -180.397 245.045 0 0 0 2 lb
+-13.4452 133.743 -96.9211 189.394 -180.397 245.045 0 0 0 2 lb
+-180.397 245.045 -142.256 345.099 -132.697 451.748 0 0 0 2 lb
+-180.397 245.045 -170.838 351.694 -132.697 451.748 0 0 0 2 lb
+-416.25 345.746 -274.474 398.747 -132.697 451.748 0 0 0 2 lb
+-416.25 345.746 -393.725 457.048 -371.2 568.349 0 0 0 2 lb
+-132.697 451.748 -251.948 510.048 -371.2 568.349 0 0 0 2 lb
+.264 274.195 629.188 409.347 588.113 544.499 0 0 0 2 lb
+.264 274.195 797.466 341.771 924.667 409.347 0 0 0 2 lb
+.113 544.499 756.39 476.923 924.667 409.347 0 0 0 2 lb
+-689.204 -237.261 -614.799 -102.648 -567.302 43.6423 0 0 0 2 lb
+-689.204 -237.261 -641.707 -90.9706 -567.302 43.6423 0 0 0 2 lb
 grestore
 %Nodes:
 gsave
 -567.302 43.6423 20.8452 0 0 0 nc
 -689.204 -237.261 20.8452 0 0 0 nc
 .667 409.347 20.8452 1 0 0 nc
 .113 544.499 20.8452 1 0 0 nc
 .264 274.195 20.8452 1 0 0 nc
 -371.2 568.349 20.8452 0 1 0 nc
 -132.697 451.748 20.8452 0 1 0 nc
 -416.25 345.746 20.8452 0 1 0 nc
 -180.397 245.045 20.8452 0 1 0 nc
 -13.4452 133.743 20.8452 0 1 0 nc
 -262.548 107.243 20.8452 0 1 0 nc
 .208 38.3422 20.8452 0 1 0 nc
 .407 -173.66 20.8452 0 1 0 nc
 -26.6953 -19.9585 20.8452 0 1 0 nc
 -539.894 -262.64 20.8452 0 0 1 nc
 -323.543 -433.964 20.8452 0 0 1 nc
 -309.657 -57.9033 20.8452 0 0 1 nc
 -67.9734 -347.42 20.8452 0 0 1 nc
 .393 -289.516 20.8452 0 0 1 nc
 .084 -307.139 20.8452 0 0 1 nc
 .164 32.7279 20.8452 0 0 1 nc
 .812 -17.6227 20.8452 0 0 1 nc
 -67.9734 319.727 20.8452 0 0 1 nc
 .797 314.692 20.8452 0 0 1 nc
 -5.03507 561.41 20.8452 0 0 1 nc
 .945 521.129 20.8452 0 0 1 nc
 -470.779 158.605 20.8452 0 0 1 nc
 .873 -115.807 20.8452 0 0 1 nc
 .312 201.403 20.8452 0 0 1 nc
 -767.847 113.289 20.8452 0 0 1 nc
 -579.033 445.603 20.8452 0 0 1 nc
 -840.856 -246.718 20.8452 0 0 1 nc
 .221 -205.967 20.8452 1 1 0 nc
 .311 -252.33 20.8452 1 1 0 nc
 .13 -175.058 20.8452 1 1 0 nc
 .947 -110.15 20.8452 1 1 0 nc
 .855 -196.694 20.8452 1 1 0 nc
 .037 -88.514 20.8452 1 1 0 nc
 .584 -48.3327 20.8452 1 1 0 nc
 .403 -23.6057 20.8452 1 1 0 nc
 .402 10.3938 20.8452 1 1 0 nc
 .579 115.483 20.8452 1 0 0 nc
 .035 177.301 20.8452 1 0 0 nc
+-567.302 43.6423 20 0 0 0 nc
+-689.204 -237.261 20 0 0 0 nc
+.667 409.347 20 1 0 0 nc
+.113 544.499 20 1 0 0 nc
+.264 274.195 20 1 0 0 nc
+-371.2 568.349 20 0 1 0 nc
+-132.697 451.748 20 0 1 0 nc
+-416.25 345.746 20 0 1 0 nc
+-180.397 245.045 20 0 1 0 nc
+-13.4452 133.743 20 0 1 0 nc
+-262.548 107.243 20 0 1 0 nc
+.208 38.3422 20 0 1 0 nc
+.407 -173.66 20 0 1 0 nc
+-26.6953 -19.9585 20 0 1 0 nc
+-539.894 -262.64 20 0 0 1 nc
+-323.543 -433.964 20 0 0 1 nc
+-309.657 -57.9033 20 0 0 1 nc
+-67.9734 -347.42 20 0 0 1 nc
+.393 -289.516 20 0 0 1 nc
+.084 -307.139 20 0 0 1 nc
+.164 32.7279 20 0 0 1 nc
+.812 -17.6227 20 0 0 1 nc
+-67.9734 319.727 20 0 0 1 nc
+.797 314.692 20 0 0 1 nc
+-5.03507 561.41 20 0 0 1 nc
+.945 521.129 20 0 0 1 nc
+-470.779 158.605 20 0 0 1 nc
+.873 -115.807 20 0 0 1 nc
+.312 201.403 20 0 0 1 nc
+-767.847 113.289 20 0 0 1 nc
+-579.033 445.603 20 0 0 1 nc
+-840.856 -246.718 20 0 0 1 nc
+.221 -205.967 20 1 1 0 nc
+.311 -252.33 20 1 1 0 nc
+.13 -175.058 20 1 1 0 nc
+.947 -110.15 20 1 1 0 nc
+.855 -196.694 20 1 1 0 nc
+.037 -88.514 20 1 1 0 nc
+.584 -48.3327 20 1 1 0 nc
+.403 -23.6057 20 1 1 0 nc
+.402 10.3938 20 1 1 0 nc
+.579 115.483 20 1 0 0 nc
+.035 177.301 20 1 0 0 nc
 grestore
 grestore

doc/images/edge_biconnected_components.eps

-                      r1213
+                      r634
 %!PS-Adobe-2.0 EPSF-2.0
 %%Creator: LEMON, graphToEps()
 %%CreationDate: Fri Mar  8 00:18:43 2013
+%%CreationDate: Fri Nov  4 13:47:12 2005
 %%BoundingBox: 0 0 842 596
 %%EndComments
 …
 %Edges:
 gsave
 .035 177.301 622.149 225.748 670.264 274.195 1 0 0 6.25356 lb
 .579 115.483 682.421 194.839 670.264 274.195 1 0 0 6.25356 lb
 .402 10.3938 246.402 -6.60595 212.403 -23.6057 0 0 1 6.25356 lb
 .402 10.3938 283.493 -18.9695 286.584 -48.3327 0 0 1 6.25356 lb
 .403 -23.6057 249.493 -35.9692 286.584 -48.3327 0 0 1 6.25356 lb
 .584 -48.3327 326.765 -79.2414 366.947 -110.15 0 0 1 6.25356 lb
 .584 -48.3327 278.857 -111.695 271.13 -175.058 0 0 1 6.25356 lb
 .037 -88.514 417.946 -142.604 397.855 -196.694 0 0 1 6.25356 lb
 .037 -88.514 402.492 -99.332 366.947 -110.15 0 0 1 6.25356 lb
 .855 -196.694 382.401 -153.422 366.947 -110.15 0 0 1 6.25356 lb
 .947 -110.15 319.038 -142.604 271.13 -175.058 0 0 1 6.25356 lb
 .13 -175.058 274.221 -213.694 277.311 -252.33 0 0 1 6.25356 lb
 .13 -175.058 238.675 -190.512 206.221 -205.967 0 0 1 6.25356 lb
 .311 -252.33 241.766 -229.149 206.221 -205.967 0 0 1 6.25356 lb
 -840.856 -246.718 -804.351 -66.7145 -767.847 113.289 1 0 0 6.25356 lb
 -579.033 445.603 -673.44 279.446 -767.847 113.289 0 0 1 6.25356 lb
 -579.033 445.603 -524.906 302.104 -470.779 158.605 0 0 1 6.25356 lb
 -767.847 113.289 -619.313 135.947 -470.779 158.605 0 0 1 6.25356 lb
 .312 201.403 946.592 42.798 986.873 -115.807 0 0 1 6.25356 lb
 .312 201.403 834.562 91.8901 762.812 -17.6227 0 0 1 6.25356 lb
 .873 -115.807 874.842 -66.7148 762.812 -17.6227 0 0 1 6.25356 lb
 -470.779 158.605 -390.218 50.3508 -309.657 -57.9033 1 0 0 6.25356 lb
 .945 521.129 208.955 541.269 -5.03507 561.41 0 0 1 6.25356 lb
 .945 521.129 376.371 417.911 329.797 314.692 0 0 1 6.25356 lb
 .945 521.129 474.554 276.928 526.164 32.7279 0 0 1 6.25356 lb
 -5.03507 561.41 -36.5042 440.568 -67.9734 319.727 0 0 1 6.25356 lb
 .797 314.692 130.912 317.209 -67.9734 319.727 0 0 1 6.25356 lb
 -67.9734 319.727 229.095 176.227 526.164 32.7279 0 0 1 6.25356 lb
 .812 -17.6227 644.488 7.5526 526.164 32.7279 0 0 1 6.25356 lb
 .812 -17.6227 746.448 -162.381 730.084 -307.139 0 0 1 6.25356 lb
 .164 32.7279 470.779 -128.394 415.393 -289.516 0 0 1 6.25356 lb
 .084 -307.139 572.738 -298.327 415.393 -289.516 0 0 1 6.25356 lb
 .393 -289.516 173.71 -318.468 -67.9734 -347.42 1 0 0 6.25356 lb
 -67.9734 -347.42 -188.815 -202.662 -309.657 -57.9033 0 0 1 6.25356 lb
 -67.9734 -347.42 -195.758 -390.692 -323.543 -433.964 0 0 1 6.25356 lb
 -309.657 -57.9033 -424.775 -160.272 -539.894 -262.64 0 0 1 6.25356 lb
 -323.543 -433.964 -431.719 -348.302 -539.894 -262.64 0 0 1 6.25356 lb
 -26.6953 -19.9585 44.8558 -96.8093 116.407 -173.66 0 0 1 6.25356 lb
 -26.6953 -19.9585 87.2563 9.19185 201.208 38.3422 0 0 1 6.25356 lb
 -26.6953 -19.9585 -144.622 43.6422 -262.548 107.243 0 0 1 6.25356 lb
 -26.6953 -19.9585 -20.0703 56.8923 -13.4452 133.743 0 0 1 6.25356 lb
 .407 -173.66 158.808 -67.6589 201.208 38.3422 0 0 1 6.25356 lb
 -262.548 107.243 -137.997 120.493 -13.4452 133.743 0 0 1 6.25356 lb
 -262.548 107.243 -221.472 176.144 -180.397 245.045 0 0 1 6.25356 lb
 -13.4452 133.743 -96.9211 189.394 -180.397 245.045 0 0 1 6.25356 lb
 -180.397 245.045 -113.509 338.465 -132.697 451.748 0 0 1 6.25356 lb
 -180.397 245.045 -199.585 358.328 -132.697 451.748 0 0 1 6.25356 lb
 -416.25 345.746 -274.474 398.747 -132.697 451.748 0 0 1 6.25356 lb
 -416.25 345.746 -393.725 457.048 -371.2 568.349 0 0 1 6.25356 lb
 -132.697 451.748 -251.948 510.048 -371.2 568.349 0 0 1 6.25356 lb
 .264 274.195 629.188 409.347 588.113 544.499 0 0 1 6.25356 lb
 .264 274.195 797.466 341.771 924.667 409.347 0 0 1 6.25356 lb
 .113 544.499 756.39 476.923 924.667 409.347 0 0 1 6.25356 lb
 -689.204 -237.261 -587.735 -114.393 -567.302 43.6423 0 0 1 6.25356 lb
 -689.204 -237.261 -668.771 -79.2259 -567.302 43.6423 0 0 1 6.25356 lb
+.035 177.301 622.149 225.748 670.264 274.195 1 0 0 2 lb
+.579 115.483 682.421 194.839 670.264 274.195 1 0 0 2 lb
+.402 10.3938 246.402 -6.60595 212.403 -23.6057 0 0 1 2 lb
+.402 10.3938 283.493 -18.9695 286.584 -48.3327 0 0 1 2 lb
+.403 -23.6057 249.493 -35.9692 286.584 -48.3327 0 0 1 2 lb
+.584 -48.3327 326.765 -79.2414 366.947 -110.15 0 0 1 2 lb
+.584 -48.3327 278.857 -111.695 271.13 -175.058 0 0 1 2 lb
+.037 -88.514 417.946 -142.604 397.855 -196.694 0 0 1 2 lb
+.037 -88.514 402.492 -99.332 366.947 -110.15 0 0 1 2 lb
+.855 -196.694 382.401 -153.422 366.947 -110.15 0 0 1 2 lb
+.947 -110.15 319.038 -142.604 271.13 -175.058 0 0 1 2 lb
+.13 -175.058 274.221 -213.694 277.311 -252.33 0 0 1 2 lb
+.13 -175.058 238.675 -190.512 206.221 -205.967 0 0 1 2 lb
+.311 -252.33 241.766 -229.149 206.221 -205.967 0 0 1 2 lb
+-840.856 -246.718 -804.351 -66.7145 -767.847 113.289 1 0 0 2 lb
+-579.033 445.603 -673.44 279.446 -767.847 113.289 0 0 1 2 lb
+-579.033 445.603 -524.906 302.104 -470.779 158.605 0 0 1 2 lb
+-767.847 113.289 -619.313 135.947 -470.779 158.605 0 0 1 2 lb
+.312 201.403 946.592 42.798 986.873 -115.807 0 0 1 2 lb
+.312 201.403 834.562 91.8901 762.812 -17.6227 0 0 1 2 lb
+.873 -115.807 874.842 -66.7148 762.812 -17.6227 0 0 1 2 lb
+-470.779 158.605 -390.218 50.3508 -309.657 -57.9033 1 0 0 2 lb
+.945 521.129 208.955 541.269 -5.03507 561.41 0 0 1 2 lb
+.945 521.129 376.371 417.911 329.797 314.692 0 0 1 2 lb
+.945 521.129 474.554 276.928 526.164 32.7279 0 0 1 2 lb
+-5.03507 561.41 -36.5042 440.568 -67.9734 319.727 0 0 1 2 lb
+.797 314.692 130.912 317.209 -67.9734 319.727 0 0 1 2 lb
+-67.9734 319.727 229.095 176.227 526.164 32.7279 0 0 1 2 lb
+.812 -17.6227 644.488 7.5526 526.164 32.7279 0 0 1 2 lb
+.812 -17.6227 746.448 -162.381 730.084 -307.139 0 0 1 2 lb
+.164 32.7279 470.779 -128.394 415.393 -289.516 0 0 1 2 lb
+.084 -307.139 572.738 -298.327 415.393 -289.516 0 0 1 2 lb
+.393 -289.516 173.71 -318.468 -67.9734 -347.42 1 0 0 2 lb
+-67.9734 -347.42 -188.815 -202.662 -309.657 -57.9033 0 0 1 2 lb
+-67.9734 -347.42 -195.758 -390.692 -323.543 -433.964 0 0 1 2 lb
+-309.657 -57.9033 -424.775 -160.272 -539.894 -262.64 0 0 1 2 lb
+-323.543 -433.964 -431.719 -348.302 -539.894 -262.64 0 0 1 2 lb
+-26.6953 -19.9585 44.8558 -96.8093 116.407 -173.66 0 0 1 2 lb
+-26.6953 -19.9585 87.2563 9.19185 201.208 38.3422 0 0 1 2 lb
+-26.6953 -19.9585 -144.622 43.6422 -262.548 107.243 0 0 1 2 lb
+-26.6953 -19.9585 -20.0703 56.8923 -13.4452 133.743 0 0 1 2 lb
+.407 -173.66 158.808 -67.6589 201.208 38.3422 0 0 1 2 lb
+-262.548 107.243 -137.997 120.493 -13.4452 133.743 0 0 1 2 lb
+-262.548 107.243 -221.472 176.144 -180.397 245.045 0 0 1 2 lb
+-13.4452 133.743 -96.9211 189.394 -180.397 245.045 0 0 1 2 lb
+-180.397 245.045 -142.256 345.099 -132.697 451.748 0 0 1 2 lb
+-180.397 245.045 -170.838 351.694 -132.697 451.748 0 0 1 2 lb
+-416.25 345.746 -274.474 398.747 -132.697 451.748 0 0 1 2 lb
+-416.25 345.746 -393.725 457.048 -371.2 568.349 0 0 1 2 lb
+-132.697 451.748 -251.948 510.048 -371.2 568.349 0 0 1 2 lb
+.264 274.195 629.188 409.347 588.113 544.499 0 0 1 2 lb
+.264 274.195 797.466 341.771 924.667 409.347 0 0 1 2 lb
+.113 544.499 756.39 476.923 924.667 409.347 0 0 1 2 lb
+-689.204 -237.261 -614.799 -102.648 -567.302 43.6423 0 0 1 2 lb
+-689.204 -237.261 -641.707 -90.9706 -567.302 43.6423 0 0 1 2 lb
 grestore
 %Nodes:
 gsave
 -567.302 43.6423 20.8452 0 0 0 nc
 -689.204 -237.261 20.8452 0 0 0 nc
 .667 409.347 20.8452 0 0 1 nc
 .113 544.499 20.8452 0 0 1 nc
 .264 274.195 20.8452 0 0 1 nc
 -371.2 568.349 20.8452 1 1 0 nc
 -132.697 451.748 20.8452 1 1 0 nc
 -416.25 345.746 20.8452 1 1 0 nc
 -180.397 245.045 20.8452 1 1 0 nc
 -13.4452 133.743 20.8452 1 1 0 nc
 -262.548 107.243 20.8452 1 1 0 nc
 .208 38.3422 20.8452 1 1 0 nc
 .407 -173.66 20.8452 1 1 0 nc
 -26.6953 -19.9585 20.8452 1 1 0 nc
 -539.894 -262.64 20.8452 0 0.5 0 nc
 -323.543 -433.964 20.8452 0 0.5 0 nc
 -309.657 -57.9033 20.8452 0 0.5 0 nc
 -67.9734 -347.42 20.8452 0 0.5 0 nc
 .393 -289.516 20.8452 0.5 0 0 nc
 .084 -307.139 20.8452 0.5 0 0 nc
 .164 32.7279 20.8452 0.5 0 0 nc
 .812 -17.6227 20.8452 0.5 0 0 nc
 -67.9734 319.727 20.8452 0.5 0 0 nc
 .797 314.692 20.8452 0.5 0 0 nc
 -5.03507 561.41 20.8452 0.5 0 0 nc
 .945 521.129 20.8452 0.5 0 0 nc
 -470.779 158.605 20.8452 0 1 1 nc
 .873 -115.807 20.8452 0.5 0 0 nc
 .312 201.403 20.8452 0.5 0 0 nc
 -767.847 113.289 20.8452 0 1 1 nc
 -579.033 445.603 20.8452 0 1 1 nc
 -840.856 -246.718 20.8452 1 0 1 nc
 .221 -205.967 20.8452 0 0 0.5 nc
 .311 -252.33 20.8452 0 0 0.5 nc
 .13 -175.058 20.8452 0 0 0.5 nc
 .947 -110.15 20.8452 0 0 0.5 nc
 .855 -196.694 20.8452 0 0 0.5 nc
 .037 -88.514 20.8452 0 0 0.5 nc
 .584 -48.3327 20.8452 0 0 0.5 nc
 .403 -23.6057 20.8452 0 0 0.5 nc
 .402 10.3938 20.8452 0 0 0.5 nc
 .579 115.483 20.8452 1 0 0 nc
 .035 177.301 20.8452 0 1 0 nc
+-567.302 43.6423 20 0 0 0 nc
+-689.204 -237.261 20 0 0 0 nc
+.667 409.347 20 0 0 1 nc
+.113 544.499 20 0 0 1 nc
+.264 274.195 20 0 0 1 nc
+-371.2 568.349 20 1 1 0 nc
+-132.697 451.748 20 1 1 0 nc
+-416.25 345.746 20 1 1 0 nc
+-180.397 245.045 20 1 1 0 nc
+-13.4452 133.743 20 1 1 0 nc
+-262.548 107.243 20 1 1 0 nc
+.208 38.3422 20 1 1 0 nc
+.407 -173.66 20 1 1 0 nc
+-26.6953 -19.9585 20 1 1 0 nc
+-539.894 -262.64 20 0 0.5 0 nc
+-323.543 -433.964 20 0 0.5 0 nc
+-309.657 -57.9033 20 0 0.5 0 nc
+-67.9734 -347.42 20 0 0.5 0 nc
+.393 -289.516 20 0.5 0 0 nc
+.084 -307.139 20 0.5 0 0 nc
+.164 32.7279 20 0.5 0 0 nc
+.812 -17.6227 20 0.5 0 0 nc
+-67.9734 319.727 20 0.5 0 0 nc
+.797 314.692 20 0.5 0 0 nc
+-5.03507 561.41 20 0.5 0 0 nc
+.945 521.129 20 0.5 0 0 nc
+-470.779 158.605 20 0 1 1 nc
+.873 -115.807 20 0.5 0 0 nc
+.312 201.403 20 0.5 0 0 nc
+-767.847 113.289 20 0 1 1 nc
+-579.033 445.603 20 0 1 1 nc
+-840.856 -246.718 20 1 0 1 nc
+.221 -205.967 20 0 0 0.5 nc
+.311 -252.33 20 0 0 0.5 nc
+.13 -175.058 20 0 0 0.5 nc
+.947 -110.15 20 0 0 0.5 nc
+.855 -196.694 20 0 0 0.5 nc
+.037 -88.514 20 0 0 0.5 nc
+.584 -48.3327 20 0 0 0.5 nc
+.403 -23.6057 20 0 0 0.5 nc
+.402 10.3938 20 0 0 0.5 nc
+.579 115.483 20 1 0 0 nc
+.035 177.301 20 0 1 0 nc
 grestore
 grestore

doc/images/node_biconnected_components.eps

-                      r1213
+                      r634
 %!PS-Adobe-2.0 EPSF-2.0
 %%Creator: LEMON, graphToEps()
 %%CreationDate: Fri Mar  8 00:18:43 2013
+%%CreationDate: Fri Nov  4 13:47:12 2005
 %%BoundingBox: 0 0 842 596
 %%EndComments
 …
 %Edges:
 gsave
 .035 177.301 622.149 225.748 670.264 274.195 0 1 0 6.25356 lb
 .579 115.483 682.421 194.839 670.264 274.195 1 0 0 6.25356 lb
 .402 10.3938 246.402 -6.60595 212.403 -23.6057 1 1 0.5 6.25356 lb
 .402 10.3938 283.493 -18.9695 286.584 -48.3327 1 1 0.5 6.25356 lb
 .403 -23.6057 249.493 -35.9692 286.584 -48.3327 1 1 0.5 6.25356 lb
 .584 -48.3327 326.765 -79.2414 366.947 -110.15 1 0.5 1 6.25356 lb
 .584 -48.3327 278.857 -111.695 271.13 -175.058 1 0.5 1 6.25356 lb
 .037 -88.514 417.946 -142.604 397.855 -196.694 0.5 0.5 1 6.25356 lb
 .037 -88.514 402.492 -99.332 366.947 -110.15 0.5 0.5 1 6.25356 lb
 .855 -196.694 382.401 -153.422 366.947 -110.15 0.5 0.5 1 6.25356 lb
 .947 -110.15 319.038 -142.604 271.13 -175.058 1 0.5 1 6.25356 lb
 .13 -175.058 274.221 -213.694 277.311 -252.33 0.5 1 1 6.25356 lb
 .13 -175.058 238.675 -190.512 206.221 -205.967 0.5 1 1 6.25356 lb
 .311 -252.33 241.766 -229.149 206.221 -205.967 0.5 1 1 6.25356 lb
 -840.856 -246.718 -804.351 -66.7145 -767.847 113.289 0 0.5 0 6.25356 lb
 -579.033 445.603 -673.44 279.446 -767.847 113.289 0 0 0.5 6.25356 lb
 -579.033 445.603 -524.906 302.104 -470.779 158.605 0 0 0.5 6.25356 lb
 -767.847 113.289 -619.313 135.947 -470.779 158.605 0 0 0.5 6.25356 lb
 .312 201.403 946.592 42.798 986.873 -115.807 0 0.5 0.5 6.25356 lb
 .312 201.403 834.562 91.8901 762.812 -17.6227 0 0.5 0.5 6.25356 lb
 .873 -115.807 874.842 -66.7148 762.812 -17.6227 0 0.5 0.5 6.25356 lb
 -470.779 158.605 -390.218 50.3508 -309.657 -57.9033 0.5 0.5 0 6.25356 lb
 .945 521.129 208.955 541.269 -5.03507 561.41 0.5 0 0.5 6.25356 lb
 .945 521.129 376.371 417.911 329.797 314.692 0.5 0 0.5 6.25356 lb
 .945 521.129 474.554 276.928 526.164 32.7279 0.5 0 0.5 6.25356 lb
 -5.03507 561.41 -36.5042 440.568 -67.9734 319.727 0.5 0 0.5 6.25356 lb
 .797 314.692 130.912 317.209 -67.9734 319.727 0.5 0 0.5 6.25356 lb
 -67.9734 319.727 229.095 176.227 526.164 32.7279 0.5 0 0.5 6.25356 lb
 .812 -17.6227 644.488 7.5526 526.164 32.7279 0.5 0.5 0.5 6.25356 lb
 .812 -17.6227 746.448 -162.381 730.084 -307.139 0.5 0.5 0.5 6.25356 lb
 .164 32.7279 470.779 -128.394 415.393 -289.516 0.5 0.5 0.5 6.25356 lb
 .084 -307.139 572.738 -298.327 415.393 -289.516 0.5 0.5 0.5 6.25356 lb
 .393 -289.516 173.71 -318.468 -67.9734 -347.42 1 0.5 0.5 6.25356 lb
 -67.9734 -347.42 -188.815 -202.662 -309.657 -57.9033 0.5 1 0.5 6.25356 lb
 -67.9734 -347.42 -195.758 -390.692 -323.543 -433.964 0.5 1 0.5 6.25356 lb
 -309.657 -57.9033 -424.775 -160.272 -539.894 -262.64 0.5 1 0.5 6.25356 lb
 -323.543 -433.964 -431.719 -348.302 -539.894 -262.64 0.5 1 0.5 6.25356 lb
 -26.6953 -19.9585 44.8558 -96.8093 116.407 -173.66 1 1 0 6.25356 lb
 -26.6953 -19.9585 87.2563 9.19185 201.208 38.3422 1 1 0 6.25356 lb
 -26.6953 -19.9585 -144.622 43.6422 -262.548 107.243 1 0 1 6.25356 lb
 -26.6953 -19.9585 -20.0703 56.8923 -13.4452 133.743 1 0 1 6.25356 lb
 .407 -173.66 158.808 -67.6589 201.208 38.3422 1 1 0 6.25356 lb
 -262.548 107.243 -137.997 120.493 -13.4452 133.743 1 0 1 6.25356 lb
 -262.548 107.243 -221.472 176.144 -180.397 245.045 1 0 1 6.25356 lb
 -13.4452 133.743 -96.9211 189.394 -180.397 245.045 1 0 1 6.25356 lb
 -180.397 245.045 -113.509 338.465 -132.697 451.748 0 1 1 6.25356 lb
 -180.397 245.045 -199.585 358.328 -132.697 451.748 0 1 1 6.25356 lb
 -416.25 345.746 -274.474 398.747 -132.697 451.748 0.5 0 0 6.25356 lb
 -416.25 345.746 -393.725 457.048 -371.2 568.349 0.5 0 0 6.25356 lb
 -132.697 451.748 -251.948 510.048 -371.2 568.349 0.5 0 0 6.25356 lb
 .264 274.195 629.188 409.347 588.113 544.499 0 0 1 6.25356 lb
 .264 274.195 797.466 341.771 924.667 409.347 0 0 1 6.25356 lb
 .113 544.499 756.39 476.923 924.667 409.347 0 0 1 6.25356 lb
 -689.204 -237.261 -587.735 -114.393 -567.302 43.6423 0 0 0 6.25356 lb
 -689.204 -237.261 -668.771 -79.2259 -567.302 43.6423 0 0 0 6.25356 lb
+.035 177.301 622.149 225.748 670.264 274.195 0 1 0 5 lb
+.579 115.483 682.421 194.839 670.264 274.195 1 0 0 5 lb
+.402 10.3938 246.402 -6.60595 212.403 -23.6057 1 1 0.5 5 lb
+.402 10.3938 283.493 -18.9695 286.584 -48.3327 1 1 0.5 5 lb
+.403 -23.6057 249.493 -35.9692 286.584 -48.3327 1 1 0.5 5 lb
+.584 -48.3327 326.765 -79.2414 366.947 -110.15 1 0.5 1 5 lb
+.584 -48.3327 278.857 -111.695 271.13 -175.058 1 0.5 1 5 lb
+.037 -88.514 417.946 -142.604 397.855 -196.694 0.5 0.5 1 5 lb
+.037 -88.514 402.492 -99.332 366.947 -110.15 0.5 0.5 1 5 lb
+.855 -196.694 382.401 -153.422 366.947 -110.15 0.5 0.5 1 5 lb
+.947 -110.15 319.038 -142.604 271.13 -175.058 1 0.5 1 5 lb
+.13 -175.058 274.221 -213.694 277.311 -252.33 0.5 1 1 5 lb
+.13 -175.058 238.675 -190.512 206.221 -205.967 0.5 1 1 5 lb
+.311 -252.33 241.766 -229.149 206.221 -205.967 0.5 1 1 5 lb
+-840.856 -246.718 -804.351 -66.7145 -767.847 113.289 0 0.5 0 5 lb
+-579.033 445.603 -673.44 279.446 -767.847 113.289 0 0 0.5 5 lb
+-579.033 445.603 -524.906 302.104 -470.779 158.605 0 0 0.5 5 lb
+-767.847 113.289 -619.313 135.947 -470.779 158.605 0 0 0.5 5 lb
+.312 201.403 946.592 42.798 986.873 -115.807 0 0.5 0.5 5 lb
+.312 201.403 834.562 91.8901 762.812 -17.6227 0 0.5 0.5 5 lb
+.873 -115.807 874.842 -66.7148 762.812 -17.6227 0 0.5 0.5 5 lb
+-470.779 158.605 -390.218 50.3508 -309.657 -57.9033 0.5 0.5 0 5 lb
+.945 521.129 208.955 541.269 -5.03507 561.41 0.5 0 0.5 5 lb
+.945 521.129 376.371 417.911 329.797 314.692 0.5 0 0.5 5 lb
+.945 521.129 474.554 276.928 526.164 32.7279 0.5 0 0.5 5 lb
+-5.03507 561.41 -36.5042 440.568 -67.9734 319.727 0.5 0 0.5 5 lb
+.797 314.692 130.912 317.209 -67.9734 319.727 0.5 0 0.5 5 lb
+-67.9734 319.727 229.095 176.227 526.164 32.7279 0.5 0 0.5 5 lb
+.812 -17.6227 644.488 7.5526 526.164 32.7279 0.5 0.5 0.5 5 lb
+.812 -17.6227 746.448 -162.381 730.084 -307.139 0.5 0.5 0.5 5 lb
+.164 32.7279 470.779 -128.394 415.393 -289.516 0.5 0.5 0.5 5 lb
+.084 -307.139 572.738 -298.327 415.393 -289.516 0.5 0.5 0.5 5 lb
+.393 -289.516 173.71 -318.468 -67.9734 -347.42 1 0.5 0.5 5 lb
+-67.9734 -347.42 -188.815 -202.662 -309.657 -57.9033 0.5 1 0.5 5 lb
+-67.9734 -347.42 -195.758 -390.692 -323.543 -433.964 0.5 1 0.5 5 lb
+-309.657 -57.9033 -424.775 -160.272 -539.894 -262.64 0.5 1 0.5 5 lb
+-323.543 -433.964 -431.719 -348.302 -539.894 -262.64 0.5 1 0.5 5 lb
+-26.6953 -19.9585 44.8558 -96.8093 116.407 -173.66 1 1 0 5 lb
+-26.6953 -19.9585 87.2563 9.19185 201.208 38.3422 1 1 0 5 lb
+-26.6953 -19.9585 -144.622 43.6422 -262.548 107.243 1 0 1 5 lb
+-26.6953 -19.9585 -20.0703 56.8923 -13.4452 133.743 1 0 1 5 lb
+.407 -173.66 158.808 -67.6589 201.208 38.3422 1 1 0 5 lb
+-262.548 107.243 -137.997 120.493 -13.4452 133.743 1 0 1 5 lb
+-262.548 107.243 -221.472 176.144 -180.397 245.045 1 0 1 5 lb
+-13.4452 133.743 -96.9211 189.394 -180.397 245.045 1 0 1 5 lb
+-180.397 245.045 -140.307 344.649 -132.697 451.748 0 1 1 5 lb
+-180.397 245.045 -172.787 352.144 -132.697 451.748 0 1 1 5 lb
+-416.25 345.746 -274.474 398.747 -132.697 451.748 0.5 0 0 5 lb
+-416.25 345.746 -393.725 457.048 -371.2 568.349 0.5 0 0 5 lb
+-132.697 451.748 -251.948 510.048 -371.2 568.349 0.5 0 0 5 lb
+.264 274.195 629.188 409.347 588.113 544.499 0 0 1 5 lb
+.264 274.195 797.466 341.771 924.667 409.347 0 0 1 5 lb
+.113 544.499 756.39 476.923 924.667 409.347 0 0 1 5 lb
+-689.204 -237.261 -612.964 -103.444 -567.302 43.6423 0 0 0 5 lb
+-689.204 -237.261 -643.542 -90.1744 -567.302 43.6423 0 0 0 5 lb
 grestore
 %Nodes:
 gsave
 -567.302 43.6423 20.8452 0 0 1 nc
 -689.204 -237.261 20.8452 0 0 1 nc
 .667 409.347 20.8452 0 0 1 nc
 .113 544.499 20.8452 0 0 1 nc
 .264 274.195 20.8452 1 0 0 nc
 -371.2 568.349 20.8452 0 0 1 nc
 -132.697 451.748 20.8452 1 0 0 nc
 -416.25 345.746 20.8452 0 0 1 nc
 -180.397 245.045 20.8452 1 0 0 nc
 -13.4452 133.743 20.8452 0 0 1 nc
 -262.548 107.243 20.8452 0 0 1 nc
 .208 38.3422 20.8452 0 0 1 nc
 .407 -173.66 20.8452 0 0 1 nc
 -26.6953 -19.9585 20.8452 1 0 0 nc
 -539.894 -262.64 20.8452 0 0 1 nc
 -323.543 -433.964 20.8452 0 0 1 nc
 -309.657 -57.9033 20.8452 1 0 0 nc
 -67.9734 -347.42 20.8452 1 0 0 nc
 .393 -289.516 20.8452 1 0 0 nc
 .084 -307.139 20.8452 0 0 1 nc
 .164 32.7279 20.8452 1 0 0 nc
 .812 -17.6227 20.8452 1 0 0 nc
 -67.9734 319.727 20.8452 0 0 1 nc
 .797 314.692 20.8452 0 0 1 nc
 -5.03507 561.41 20.8452 0 0 1 nc
 .945 521.129 20.8452 0 0 1 nc
 -470.779 158.605 20.8452 1 0 0 nc
 .873 -115.807 20.8452 0 0 1 nc
 .312 201.403 20.8452 0 0 1 nc
 -767.847 113.289 20.8452 1 0 0 nc
 -579.033 445.603 20.8452 0 0 1 nc
 -840.856 -246.718 20.8452 0 0 1 nc
 .221 -205.967 20.8452 0 0 1 nc
 .311 -252.33 20.8452 0 0 1 nc
 .13 -175.058 20.8452 1 0 0 nc
 .947 -110.15 20.8452 1 0 0 nc
 .855 -196.694 20.8452 0 0 1 nc
 .037 -88.514 20.8452 0 0 1 nc
 .584 -48.3327 20.8452 1 0 0 nc
 .403 -23.6057 20.8452 0 0 1 nc
 .402 10.3938 20.8452 0 0 1 nc
 .579 115.483 20.8452 0 0 1 nc
 .035 177.301 20.8452 0 0 1 nc
+-567.302 43.6423 20 0 0 1 nc
+-689.204 -237.261 20 0 0 1 nc
+.667 409.347 20 0 0 1 nc
+.113 544.499 20 0 0 1 nc
+.264 274.195 20 1 0 0 nc
+-371.2 568.349 20 0 0 1 nc
+-132.697 451.748 20 1 0 0 nc
+-416.25 345.746 20 0 0 1 nc
+-180.397 245.045 20 1 0 0 nc
+-13.4452 133.743 20 0 0 1 nc
+-262.548 107.243 20 0 0 1 nc
+.208 38.3422 20 0 0 1 nc
+.407 -173.66 20 0 0 1 nc
+-26.6953 -19.9585 20 1 0 0 nc
+-539.894 -262.64 20 0 0 1 nc
+-323.543 -433.964 20 0 0 1 nc
+-309.657 -57.9033 20 1 0 0 nc
+-67.9734 -347.42 20 1 0 0 nc
+.393 -289.516 20 1 0 0 nc
+.084 -307.139 20 0 0 1 nc
+.164 32.7279 20 1 0 0 nc
+.812 -17.6227 20 1 0 0 nc
+-67.9734 319.727 20 0 0 1 nc
+.797 314.692 20 0 0 1 nc
+-5.03507 561.41 20 0 0 1 nc
+.945 521.129 20 0 0 1 nc
+-470.779 158.605 20 1 0 0 nc
+.873 -115.807 20 0 0 1 nc
+.312 201.403 20 0 0 1 nc
+-767.847 113.289 20 1 0 0 nc
+-579.033 445.603 20 0 0 1 nc
+-840.856 -246.718 20 0 0 1 nc
+.221 -205.967 20 0 0 1 nc
+.311 -252.33 20 0 0 1 nc
+.13 -175.058 20 1 0 0 nc
+.947 -110.15 20 1 0 0 nc
+.855 -196.694 20 0 0 1 nc
+.037 -88.514 20 0 0 1 nc
+.584 -48.3327 20 1 0 0 nc
+.403 -23.6057 20 0 0 1 nc
+.402 10.3938 20 0 0 1 nc
+.579 115.483 20 0 0 1 nc
+.035 177.301 20 0 0 1 nc
 grestore
 grestore

doc/images/strongly_connected_components.eps

-                      r1213
+                      r634
 %!PS-Adobe-2.0 EPSF-2.0
 %%Creator: LEMON, graphToEps()
 %%CreationDate: Fri Mar  8 00:22:15 2013
+%%CreationDate: Fri Nov  4 13:47:12 2005
 %%BoundingBox: 0 0 842 596
 %%EndComments
 …
 %Edges:
 gsave
 .56973 setlinewidth 0 0 1 setrgbcolor newpath
+setlinewidth 0 0 1 setrgbcolor newpath
 .178 27.2723 moveto
 .849 -31.0725 190.033 -46.2697 176.306 -82.1369 curveto stroke
 newpath 163.235 -116.291 moveto 165.206 -77.8889 lineto 187.405 -86.3849 lineto closepath fill
 .56973 setlinewidth 0 0 1 setrgbcolor newpath
+.373 -40.1551 188.622 -49.9556 169.228 -100.631 curveto stroke
+newpath 164.939 -111.838 moveto 165.492 -99.2013 lineto 172.964 -102.061 lineto closepath fill
+setlinewidth 0 0 1 setrgbcolor newpath
 .8044 15.5841 moveto
 .705 19.9594 126.016 21.0591 166.493 23.7879 curveto stroke
 newpath 202.98 26.2477 moveto 167.292 11.9299 lineto 165.694 35.6458 lineto closepath fill
 .56973 setlinewidth 1 0 0 setrgbcolor newpath
+.293 20.6059 129.775 21.3125 186.25 25.1199 curveto stroke
+newpath 198.223 25.927 moveto 186.519 21.1289 lineto 185.981 29.1108 lineto closepath fill
+setlinewidth 1 0 0 setrgbcolor newpath
 .178 27.2723 moveto
 .264 -80.3935 289.87 -95.0808 338.092 -177.379 curveto stroke
 newpath 356.579 -208.932 moveto 327.837 -183.388 lineto 348.346 -171.371 lineto closepath fill
 .56973 setlinewidth 0 0 1 setrgbcolor newpath
+.395 -87.4449 290.763 -96.6058 348.102 -194.464 curveto stroke
+newpath 354.169 -204.818 moveto 344.651 -196.487 lineto 351.554 -192.442 lineto closepath fill
+setlinewidth 0 0 1 setrgbcolor newpath
 .79 -130.517 moveto
 .446 -74.4692 104.358 -61.4239 76.4943 -25.394 curveto stroke
 newpath 54.1228 3.53455 moveto 85.8959 -18.1234 lineto 67.0928 -32.6646 lineto closepath fill
 .56973 setlinewidth 1 0 0 setrgbcolor newpath
+.71 -67.0521 102.27 -58.7243 64.3804 -9.72954 curveto stroke
+newpath 57.0394 -0.236898 moveto 67.5446 -7.28254 lineto 61.2162 -12.1765 lineto closepath fill
+setlinewidth 1 0 0 setrgbcolor newpath
 -105.193 -261.035 moveto
 -39.4801 -139.85 -31.344 -124.846 20.1113 -29.9539 curveto stroke
 newpath 37.5434 2.19358 moveto 30.559 -35.6192 lineto 9.66361 -24.2886 lineto closepath fill
 .56973 setlinewidth 0 0 1 setrgbcolor newpath
+-35.6576 -132.801 -30.5923 -123.459 29.5506 -12.5464 curveto stroke
+newpath 35.2708 -1.99743 moveto 33.0669 -14.4531 lineto 26.0343 -10.6397 lineto closepath fill
+setlinewidth 0 0 1 setrgbcolor newpath
 -465.576 -42.8564 moveto
 -550.335 -27.1603 -566.8 -24.1113 -625.027 -13.3286 curveto stroke
 newpath -660.985 -6.66971 moveto -622.863 -1.64245 lineto -627.191 -25.0148 lineto closepath fill
 .56973 setlinewidth 0 0 1 setrgbcolor newpath
+-559.078 -25.5413 -569.47 -23.6169 -644.498 -9.72286 curveto stroke
+newpath -656.297 -7.5378 moveto -643.77 -5.78973 lineto -645.226 -13.656 lineto closepath fill
+setlinewidth 0 0 1 setrgbcolor newpath
 -574.666 -153.893 moveto
 -535.911 -114.447 -524.692 -103.027 -501.88 -79.8085 curveto stroke
 newpath -476.251 -53.7222 moveto -493.402 -88.1377 lineto -510.358 -71.4793 lineto closepath fill
 .56973 setlinewidth 1 0 0 setrgbcolor newpath
+-528.842 -107.252 -521.515 -99.794 -488.002 -65.683 curveto stroke
+newpath -479.592 -57.123 moveto -485.149 -68.4863 lineto -490.856 -62.8797 lineto closepath fill
+setlinewidth 1 0 0 setrgbcolor newpath
 -490.901 120.777 moveto
 -481.623 60.8277 -479.143 44.8049 -473.499 8.33636 curveto stroke
 newpath -467.906 -27.8032 moveto -485.244 6.51862 lineto -461.754 10.1541 lineto closepath fill
 .56973 setlinewidth 0 0 1 setrgbcolor newpath
+-480.122 51.1328 -478.519 40.7713 -470.47 -11.2329 curveto stroke
+newpath -468.635 -23.0917 moveto -474.423 -11.8447 lineto -466.517 -10.6212 lineto closepath fill
+setlinewidth 0 0 1 setrgbcolor newpath
 -675.963 -3.89604 moveto
 -637.405 -60.9909 -628.201 -74.6206 -603.658 -110.963 curveto stroke
 newpath -583.191 -141.27 moveto -613.507 -117.615 lineto -593.808 -104.312 lineto closepath fill
 .56973 setlinewidth 0 0 1 setrgbcolor newpath
+-632.116 -68.8235 -626.228 -77.5422 -592.575 -127.374 curveto stroke
+newpath -585.859 -137.319 moveto -595.89 -129.612 lineto -589.26 -125.135 lineto closepath fill
+setlinewidth 0 0 1 setrgbcolor newpath
 -490.901 120.777 moveto
 -439.75 208.465 -431.238 223.057 -394.278 286.417 curveto stroke
 newpath -375.851 318.006 moveto -384.012 280.429 lineto -404.543 292.406 lineto closepath fill
 .56973 setlinewidth 0 0 1 setrgbcolor newpath
+-435.445 215.844 -430.107 224.995 -384.3 303.522 curveto stroke
+newpath -378.253 313.887 moveto -380.845 301.507 lineto -387.755 305.537 lineto closepath fill
+setlinewidth 0 0 1 setrgbcolor newpath
 -266.879 114.933 moveto
 -358.311 117.318 -375.109 117.756 -439.117 119.426 curveto stroke
 newpath -475.674 120.38 moveto -438.807 131.307 lineto -439.426 107.545 lineto closepath fill
 .56973 setlinewidth 0 0 1 setrgbcolor newpath
+-367.067 117.547 -377.642 117.822 -458.912 119.943 curveto stroke
+newpath -470.908 120.255 moveto -458.807 123.941 lineto -459.016 115.944 lineto closepath fill
+setlinewidth 0 0 1 setrgbcolor newpath
 -368.176 331.163 moveto
 -326.156 241.466 -318.997 226.186 -288.855 161.843 curveto stroke
 newpath -273.341 128.727 moveto -299.617 156.801 lineto -278.092 166.885 lineto closepath fill
 .56973 setlinewidth 1 0 0 setrgbcolor newpath
+-322.511 233.685 -318.018 224.095 -280.454 143.911 curveto stroke
+newpath -275.364 133.044 moveto -284.076 142.214 lineto -276.832 145.608 lineto closepath fill
+setlinewidth 1 0 0 setrgbcolor newpath
 -266.879 114.933 moveto
 -226.764 227.755 -221.069 243.774 -190.728 329.107 curveto stroke
 newpath -178.477 363.564 moveto -179.53 325.126 lineto -201.926 333.089 lineto closepath fill
 .56973 setlinewidth 0 0 1 setrgbcolor newpath
+-224.004 235.52 -220.448 245.52 -184.094 347.765 curveto stroke
+newpath -180.074 359.072 moveto -180.325 346.425 lineto -187.863 349.105 lineto closepath fill
+setlinewidth 0 0 1 setrgbcolor newpath
 -251.294 -335.059 moveto
 -198.044 -308.079 -183.61 -300.766 -151.402 -284.448 curveto stroke
 newpath -118.781 -267.92 moveto -146.031 -295.049 lineto -156.774 -273.846 lineto closepath fill
 .56973 setlinewidth 0 0 1 setrgbcolor newpath
+-189.25 -303.624 -179.902 -298.887 -133.738 -275.498 curveto stroke
+newpath -123.034 -270.074 moveto -131.93 -279.066 lineto -135.546 -271.93 lineto closepath fill
+setlinewidth 0 0 1 setrgbcolor newpath
 -389.604 -136.361 moveto
 -332.039 -219.059 -322.392 -232.919 -280.889 -292.543 curveto stroke
 newpath -259.996 -322.557 moveto -290.643 -299.333 lineto -271.134 -285.753 lineto closepath fill
 .56973 setlinewidth 1 0 0 setrgbcolor newpath
+-327.15 -226.083 -321.098 -234.777 -269.576 -308.795 curveto stroke
+newpath -262.72 -318.644 moveto -272.859 -311.081 lineto -266.293 -306.51 lineto closepath fill
+setlinewidth 1 0 0 setrgbcolor newpath
 .84406 175.322 moveto
 -70.5724 261.706 -81.8227 274.423 -139.051 339.116 curveto stroke
 newpath -163.281 366.507 moveto -130.149 346.991 lineto -147.953 331.242 lineto closepath fill
 .56973 setlinewidth 0 0 1 setrgbcolor newpath
+-76.0754 267.926 -83.1051 275.873 -152.172 353.948 curveto stroke
+newpath -160.122 362.936 moveto -149.176 356.598 lineto -155.168 351.298 lineto closepath fill
+setlinewidth 0 0 1 setrgbcolor newpath
 .478 311.683 moveto
 .641 256.819 90.7821 246.103 45.6398 208.485 curveto stroke
 newpath 17.546 185.074 moveto 38.0313 217.615 lineto 53.2483 199.355 lineto closepath fill
 .56973 setlinewidth 0 0 1 setrgbcolor newpath
+.8003 251.119 88.6819 244.353 30.4273 195.808 curveto stroke
+newpath 21.2086 188.126 moveto 27.8666 198.881 lineto 32.988 192.735 lineto closepath fill
+setlinewidth 0 0 1 setrgbcolor newpath
 .851 111.037 moveto
 .224 196.246 258.132 209.083 203.347 272.486 curveto stroke
 newpath 179.437 300.157 moveto 212.34 280.257 lineto 194.354 264.716 lineto closepath fill
 .56973 setlinewidth 0 0 1 setrgbcolor newpath
+.766 202.563 256.831 210.589 190.4 287.47 curveto stroke
+newpath 182.554 296.55 moveto 193.427 290.085 lineto 187.373 284.855 lineto closepath fill
+setlinewidth 0 0 1 setrgbcolor newpath
 .84406 175.322 moveto
 .419 146.79 172.221 143.585 291.966 120.743 curveto stroke
 newpath 327.888 113.891 moveto 289.739 109.069 lineto 294.193 132.418 lineto closepath fill
 .56973 setlinewidth 0 0 1 setrgbcolor newpath
+.16 145.314 173.605 143.321 311.418 117.033 curveto stroke
+newpath 323.205 114.784 moveto 310.668 113.104 lineto 312.167 120.962 lineto closepath fill
+setlinewidth 0 0 1 setrgbcolor newpath
 .851 111.037 moveto
 .978 6.99574 505.015 -2.86383 627.727 -89.0547 curveto stroke
 newpath 657.653 -110.074 moveto 620.896 -98.7802 lineto 634.558 -79.3291 lineto closepath fill
 .56973 setlinewidth 0 0 1 setrgbcolor newpath
+.255 2.58683 505.964 -3.53033 643.932 -100.436 curveto stroke
+newpath 653.752 -107.334 moveto 641.633 -103.71 lineto 646.231 -97.163 lineto closepath fill
+setlinewidth 0 0 1 setrgbcolor newpath
 .28 -222.074 moveto
 .807 -74.8128 353.709 -57.7536 346.177 59.3416 curveto stroke
 newpath 343.829 95.836 moveto 358.037 60.1045 lineto 334.316 58.5786 lineto closepath fill
 .56973 setlinewidth 0 0 1 setrgbcolor newpath
+.298 -66.9063 353.616 -56.2971 344.905 79.1029 curveto stroke
+newpath 344.135 91.0781 moveto 348.897 79.3597 lineto 340.914 78.8461 lineto closepath fill
+setlinewidth 0 0 1 setrgbcolor newpath
 .118 -118.829 moveto
 .595 -164.241 519.412 -169.704 413.361 -205.505 curveto stroke
 newpath 378.712 -217.202 moveto 409.559 -194.245 lineto 417.162 -216.766 lineto closepath fill
 .56973 setlinewidth 1 0 0 setrgbcolor newpath
+.037 -166.793 517.967 -170.192 394.599 -211.839 curveto stroke
+newpath 383.229 -215.677 moveto 393.32 -208.049 lineto 395.878 -215.629 lineto closepath fill
+setlinewidth 1 0 0 setrgbcolor newpath
 -105.193 -261.035 moveto
 .939 -243.099 128.069 -241.677 312.655 -226.358 curveto stroke
 newpath 349.1 -223.334 moveto 313.638 -238.202 lineto 311.672 -214.514 lineto closepath fill
 .56973 setlinewidth 0 0 1 setrgbcolor newpath
+.401 -242.479 129.015 -241.598 332.39 -224.721 curveto stroke
+newpath 344.348 -223.728 moveto 332.72 -228.707 lineto 332.059 -220.734 lineto closepath fill
+setlinewidth 0 0 1 setrgbcolor newpath
 -105.193 -261.035 moveto
 -156.746 -168.566 -164.987 -153.784 -202.693 -86.1539 curveto stroke
 newpath -220.5 -54.2129 moveto -192.312 -80.3665 lineto -213.073 -91.9413 lineto closepath fill
 .56973 setlinewidth 0 0 1 setrgbcolor newpath
+-160.867 -161.176 -166.028 -151.918 -212.336 -68.858 curveto stroke
+newpath -218.179 -58.3769 moveto -208.842 -66.9102 lineto -215.829 -70.8058 lineto closepath fill
+setlinewidth 0 0 1 setrgbcolor newpath
 -227.918 -40.9084 moveto
 -290.327 -77.7521 -304.558 -86.1532 -344.995 -110.026 curveto stroke
 newpath -376.487 -128.617 moveto -351.037 -99.7914 lineto -338.953 -120.26 lineto closepath fill
+-298.35 -82.4884 -307.42 -87.8432 -362.048 -120.093 curveto stroke
+newpath -372.381 -126.193 moveto -364.081 -116.648 lineto -360.014 -123.537 lineto closepath fill
 grestore
 %Nodes:
 gsave
 -389.604 -136.361 15.2324 0 1 0 nc
 -227.918 -40.9084 15.2324 0 1 0 nc
 -105.193 -261.035 15.2324 0 1 0 nc
 .28 -222.074 15.2324 1 1 0 nc
 .118 -118.829 15.2324 1 1 0 nc
 .851 111.037 15.2324 1 1 0 nc
 .84406 175.322 15.2324 1 1 0 nc
 .478 311.683 15.2324 1 1 0 nc
 -173.374 377.916 15.2324 1 0 1 nc
 -251.294 -335.059 15.2324 0 1 0 nc
 -266.879 114.933 15.2324 0 0 0 nc
 -368.176 331.163 15.2324 0 0 0 nc
 -490.901 120.777 15.2324 0 0 0 nc
 -574.666 -153.893 15.2324 1 0 0 nc
 -675.963 -3.89604 15.2324 1 0 0 nc
 -465.576 -42.8564 15.2324 1 0 0 nc
 .8044 15.5841 15.2324 0 0 1 nc
 .79 -130.517 15.2324 0 0 1 nc
 .178 27.2723 15.2324 0 0 1 nc
+-389.604 -136.361 20 0 1 0 nc
+-227.918 -40.9084 20 0 1 0 nc
+-105.193 -261.035 20 0 1 0 nc
+.28 -222.074 20 1 1 0 nc
+.118 -118.829 20 1 1 0 nc
+.851 111.037 20 1 1 0 nc
+.84406 175.322 20 1 1 0 nc
+.478 311.683 20 1 1 0 nc
+-173.374 377.916 20 1 0 1 nc
+-251.294 -335.059 20 0 1 0 nc
+-266.879 114.933 20 0 0 0 nc
+-368.176 331.163 20 0 0 0 nc
+-490.901 120.777 20 0 0 0 nc
+-574.666 -153.893 20 1 0 0 nc
+-675.963 -3.89604 20 1 0 0 nc
+-465.576 -42.8564 20 1 0 0 nc
+.8044 15.5841 20 0 0 1 nc
+.79 -130.517 20 0 0 1 nc
+.178 27.2723 20 0 0 1 nc
 grestore
 grestore

doc/lgf.dox

-                      r1270
+                      r1192
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2009
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
 The \e LGF files can also contain bipartite graphs, in this case a
 \c \@red_nodes and a \c \@blue_nodes sections describe the node set of the
+\c @red_nodes and a \c @blue_nodes sections describe the node set of the
 graph. If a map is in both of these sections, then it can be used as a
 regular node map.

doc/mainpage.dox.in

-                      r1221
+                      r1039
 It is a C++ template library providing efficient implementations of common
 data structures and algorithms with focus on combinatorial optimization
 tasks connected mainly with graphs and networks \cite DezsoJuttnerKovacs11Lemon.
+tasks connected mainly with graphs and networks.
 <b>
 …
 The project is maintained by the
 <a href="http://www.cs.elte.hu/egres/">Egerv&aacute;ry Research Group on
 Combinatorial Optimization</a> \cite egres
+Combinatorial Optimization</a> \ref egres
 at the Operations Research Department of the
 <a href="http://www.elte.hu/en/">E&ouml;tv&ouml;s Lor&aacute;nd University</a>,
 Budapest, Hungary.
 LEMON is also a member of the <a href="http://www.coin-or.org/">COIN-OR</a>
 initiative \cite coinor.
+initiative \ref coinor.
 \section howtoread How to Read the Documentation

doc/min_cost_flow.dox

-                      r1270
+                      r1164
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
 minimum total cost from a set of supply nodes to a set of demand nodes
 in a network with capacity constraints (lower and upper bounds)
 and arc costs \cite amo93networkflows.
+and arc costs \ref amo93networkflows.
 Formally, let \f$G=(V,A)\f$ be a digraph, \f$lower: A\rightarrow\mathbf{R}\f$,

doc/references.bib

-                      r1219
+                      r1164
                   {O}perations {R}esearch},
   url =          {http://www.coin-or.org/}
+}
-%%%%% Papers related to LEMON %%%%%
-@article{DezsoJuttnerKovacs11Lemon,
-  author =       {B. Dezs{\H o} and A. J\"uttner and P. Kov\'acs},
-  title =        {{LEMON} -- an open source {C++} graph template library},
-  journal =      {Electronic Notes in Theoretical Computer Science},
-  volume =       {264},
-  pages =        {23--45},
-  year =         {2011},
-  note =         {Proc. 2nd Workshop on Generative Technologies}
+}
-@article{KiralyKovacs12MCF,
-  author =       {Z. Kir\'aly and P. Kov\'acs},
-  title =        {Efficient implementations of minimum-cost flow algorithms},
-  journal =      {Acta Universitatis Sapientiae, Informatica},
-  year =         {2012},
-  volume =       {4},
-  pages =        {67--118}
+}

lemon/CMakeLists.txt

-                      r1264
+                      r1133
 IF(LEMON_HAVE_CPLEX)
   SET(LEMON_SOURCES ${LEMON_SOURCES} cplex.cc)
   INCLUDE_DIRECTORIES(${ILOG_INCLUDE_DIRS})
+  INCLUDE_DIRECTORIES(${CPLEX_INCLUDE_DIRS})
 ENDIF()
 …
   SET(LEMON_SOURCES ${LEMON_SOURCES} cbc.cc)
   INCLUDE_DIRECTORIES(${COIN_INCLUDE_DIRS})
-ENDIF()
-IF(LEMON_HAVE_SOPLEX)
-  SET(LEMON_SOURCES ${LEMON_SOURCES} soplex.cc)
-  INCLUDE_DIRECTORIES(${SOPLEX_INCLUDE_DIRS})
 ENDIF()

lemon/adaptors.h

r1270	r1159
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2010
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/assert.h

-                      r1270
+                      r463
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2009
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
                              ::lemon::_assert_bits::cstringify(msg),    \
                              #exp), 0)))
 #    if defined LEMON_ENABLE_DEBUG
+#    if LEMON_ENABLE_DEBUG
 #      define LEMON_DEBUG(exp, msg)                                     \
          (static_cast<void> (!!(exp) ? 0 : (                            \

lemon/base.cc

-                      r1270
+                      r554
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2009
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
 #include<lemon/tolerance.h>
 #include<lemon/core.h>
-#include<lemon/time_measure.h>
 namespace lemon {
 …
 #endif
-  TimeStamp::Format TimeStamp::_format = TimeStamp::NORMAL;
 } //namespace lemon

lemon/bellman_ford.h

-                      r1270
+                      r960
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   /// This class provides an efficient implementation of the Bellman-Ford
   /// algorithm. The maximum time complexity of the algorithm is
   /// <tt>O(nm)</tt>.
+  /// <tt>O(ne)</tt>.
   ///
   /// The Bellman-Ford algorithm solves the single-source shortest path
 …
     /// The type of the paths.
     typedef PredMapPath<Digraph, PredMap> Path;
     ///\brief The \ref lemon::BellmanFordDefaultOperationTraits
+    ///\brief The \ref BellmanFordDefaultOperationTraits
     /// "operation traits class" of the algorithm.
     typedef typename TR::OperationTraits OperationTraits;
+    ///\brief The \ref lemon::BellmanFordDefaultTraits "traits class"
+    ///of the algorithm.
+    ///The \ref BellmanFordDefaultTraits "traits class" of the algorithm.
     typedef TR Traits;

lemon/bfs.h

-                      r1270
+                      r1127
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
     typedef PredMapPath<Digraph, PredMap> Path;
     ///The \ref lemon::BfsDefaultTraits "traits class" of the algorithm.
+    ///The \ref BfsDefaultTraits "traits class" of the algorithm.
     typedef TR Traits;

lemon/bin_heap.h

r1270	r758
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2009
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/bits/alteration_notifier.h

r1270	r1131
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2009
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/bits/array_map.h

r1270	r956
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2010
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/bits/bezier.h

r1270	r1157
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2009
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/bits/default_map.h

r1270	r956
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2010
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/bits/edge_set_extender.h

r1270	r1161
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2010
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/bits/graph_adaptor_extender.h

r1270	r965
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2009
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/bits/graph_extender.h

-                      r1270
+                      r1195
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2009
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
     typedef AlterationNotifier<BpGraphExtender, Node> NodeNotifier;
     typedef AlterationNotifier<BpGraphExtender, RedNode> RedNodeNotifier;
+    typedef AlterationNotifier<BpGraphExtender, RedNode> RedNodeNotifier;
     typedef AlterationNotifier<BpGraphExtender, BlueNode> BlueNodeNotifier;
     typedef AlterationNotifier<BpGraphExtender, Arc> ArcNotifier;

lemon/bits/lock.h

-                      r1270
+                      r1131
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2012
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
     public:
       Lock() {
         pthread_mutex_init(&_lock, 0);
+        pthread_mutex_init(&_lock, 0);
+      }
       ~Lock() {
         pthread_mutex_destroy(&_lock);
+        pthread_mutex_destroy(&_lock);
+      }
       void lock() {
         pthread_mutex_lock(&_lock);
+        pthread_mutex_lock(&_lock);
+      }
       void unlock() {
         pthread_mutex_unlock(&_lock);
+        pthread_mutex_unlock(&_lock);
+      }
 …
       void lock() {}
       void unlock() {}
     };
+    };
 #endif
+  }

lemon/bits/map_extender.h

r1270	r867
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2009
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/bits/path_dump.h

r1270	r973
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2009
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/bits/solver_bits.h

r1270	r1142
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2010
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/bits/traits.h

r1270	r1194
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2009
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/bits/windows.cc

-                      r1270
+                      r1163
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
 #endif
+    }
     WinLock::~WinLock() {
 #ifdef WIN32

lemon/bits/windows.h

r1270	r1131
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2009
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/capacity_scaling.h

-                      r1298
+                      r1297
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   /// \ref CapacityScaling implements the capacity scaling version
   /// of the successive shortest path algorithm for finding a
+  /// \ref min_cost_flow "minimum cost flow" \cite amo93networkflows,
+  /// \cite edmondskarp72theoretical. It is an efficient dual
+  /// solution method, which runs in polynomial time
+  /// \f$O(m\log U (n+m)\log n)\f$, where <i>U</i> denotes the maximum
+  /// of node supply and arc capacity values.
+  /// \ref min_cost_flow "minimum cost flow" \ref amo93networkflows,
+  /// \ref edmondskarp72theoretical. It is an efficient dual
+  /// solution method.
   ///
   /// This algorithm is typically slower than \ref CostScaling and
 …
     typedef typename TR::Heap Heap;
+    /// \brief The \ref lemon::CapacityScalingDefaultTraits "traits class"
+    /// of the algorithm
+    /// The \ref CapacityScalingDefaultTraits "traits class" of the algorithm
     typedef TR Traits;
 …
     ///
     /// This function returns the total cost of the found flow.
     /// Its complexity is O(m).
+    /// Its complexity is O(e).
     ///
     /// \note The return type of the function can be specified as a
 …
       return OPTIMAL;
+    }
     // Check if the upper bound is greater than or equal to the lower bound
     // on each forward arc.

lemon/cbc.cc

r1270	r1161
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2009
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/cbc.h

-                      r1270
+                      r956
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
  */
+// -*- C++ -*-
 #ifndef LEMON_CBC_H
 #define LEMON_CBC_H

lemon/christofides_tsp.h

-                      r1270
+                      r1205
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
 namespace lemon {
   /// \ingroup tsp
   ///
 …
           return _sum = 2 * _cost[_gr.edge(_gr(0), _gr(1))];
+        }
         // Compute min. cost spanning tree
         std::vector<Edge> tree;
         kruskal(_gr, _cost, std::back_inserter(tree));
         FullGraph::NodeMap<int> deg(_gr, 0);
         for (int i = 0; i != int(tree.size()); ++i) {
 …
           if (deg[u] % 2 == 1) odd_nodes.push_back(u);
+        }
         SmartGraph sgr;
         SmartGraph::EdgeMap<Cost> scost(sgr);
 …
+          }
+        }
         // Compute min. cost perfect matching
         MaxWeightedPerfectMatching<SmartGraph, SmartGraph::EdgeMap<Cost> >
           mwpm(sgr, scost);
         mwpm.run();
         for (SmartGraph::EdgeIt e(sgr); e != INVALID; ++e) {
           if (mwpm.matching(e)) {
 …
+          }
+        }
         // Join the spanning tree and the matching
+        // Join the spanning tree and the matching
         sgr.clear();
         for (int i = 0; i != _gr.nodeNum(); ++i) {
 …
       /// @}
       /// \name Query Functions
       /// @{
       /// \brief The total cost of the found tour.
       ///
 …
         return _sum;
+      }
       /// \brief Returns a const reference to the node sequence of the
       /// found tour.
 …
         std::copy(_path.begin(), _path.end(), out);
+      }
       /// \brief Gives back the found tour as a path.
       ///
       /// This function copies the found tour as a list of arcs/edges into
       /// the given \ref lemon::concepts::Path "path structure".
+      /// the given \ref concept::Path "path structure".
       ///
       /// \pre run() must be called before using this function.
 …
+        }
+      }
       /// @}
   };

lemon/circulation.h

-                      r1270
+                      r1159
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   public:
+    /// \brief The \ref lemon::CirculationDefaultTraits "traits class"
+    /// of the algorithm.
+    ///The \ref CirculationDefaultTraits "traits class" of the algorithm.
     typedef TR Traits;
     ///The type of the digraph the algorithm runs on.

lemon/clp.cc

r1270	r1142
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2010
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/clp.h

r1270	r956
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2010
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/concept_check.h

-                      r1270
+                      r1157
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2009
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
 #if !defined(NDEBUG)
     void (Concept::*x)() = & Concept::constraints;
     ::lemon::ignore_unused_variable_warning(x);
+    ignore_unused_variable_warning(x);
 #endif
+  }
 …
     typedef typename Concept::template Constraints<Type> ConceptCheck;
     void (ConceptCheck::*x)() = & ConceptCheck::constraints;
     ::lemon::ignore_unused_variable_warning(x);
+    ignore_unused_variable_warning(x);
 #endif
+  }

lemon/concepts/bpgraph.h

-                      r1270
+                      r1196
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
         /// Sets the iterator to the first arc of the given graph.
         ///
+        explicit ArcIt(const BpGraph &g)
+        {
+          ::lemon::ignore_unused_variable_warning(g);
+        }
+        explicit ArcIt(const BpGraph &g) { ignore_unused_variable_warning(g); }
         /// Sets the iterator to the given arc.
 …
         ///
         OutArcIt(const BpGraph& n, const Node& g) {
           ::lemon::ignore_unused_variable_warning(n);
           ::lemon::ignore_unused_variable_warning(g);
+          ignore_unused_variable_warning(n);
+          ignore_unused_variable_warning(g);
+        }
         /// Sets the iterator to the given arc.
 …
         ///
         InArcIt(const BpGraph& g, const Node& n) {
           ::lemon::ignore_unused_variable_warning(n);
           ::lemon::ignore_unused_variable_warning(g);
+          ignore_unused_variable_warning(n);
+          ignore_unused_variable_warning(g);
+        }
         /// Sets the iterator to the given arc.
 …
       /// \brief Gives back the red end node of the edge.
       ///
+      ///
       /// Gives back the red end node of the edge.
       RedNode redNode(const Edge&) const { return RedNode(); }
       /// \brief Gives back the blue end node of the edge.
       ///
+      ///
       /// Gives back the blue end node of the edge.
       BlueNode blueNode(const Edge&) const { return BlueNode(); }
 …
       /// \brief The base node of the iterator.
       ///
       /// Returns the base node of the given incoming arc iterator
+      /// Returns the base node of the given incomming arc iterator
       /// (i.e. the target node of the corresponding arc).
       Node baseNode(InArcIt) const { return INVALID; }
 …
       /// \brief The running node of the iterator.
       ///
       /// Returns the running node of the given incoming arc iterator
+      /// Returns the running node of the given incomming arc iterator
       /// (i.e. the source node of the corresponding arc).
       Node runningNode(InArcIt) const { return INVALID; }

lemon/concepts/digraph.h

-                      r1271
+                      r956
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
         /// Sets the iterator to the first arc of the given digraph.
         ///
+        explicit ArcIt(const Digraph& g) {
+          ::lemon::ignore_unused_variable_warning(g);
+        }
+        explicit ArcIt(const Digraph& g) { ignore_unused_variable_warning(g); }
         /// Sets the iterator to the given arc.
 …
       /// \brief The base node of the iterator.
       ///
       /// Returns the base node of the given incoming arc iterator
+      /// Returns the base node of the given incomming arc iterator
       /// (i.e. the target node of the corresponding arc).
       Node baseNode(InArcIt) const { return INVALID; }
 …
       /// \brief The running node of the iterator.
       ///
       /// Returns the running node of the given incoming arc iterator
+      /// Returns the running node of the given incomming arc iterator
       /// (i.e. the source node of the corresponding arc).
       Node runningNode(InArcIt) const { return INVALID; }

lemon/concepts/graph.h

-                      r1271
+                      r1186
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
         /// Sets the iterator to the first arc of the given graph.
         ///
+        explicit ArcIt(const Graph &g) {
+          ::lemon::ignore_unused_variable_warning(g);
+        }
+        explicit ArcIt(const Graph &g) { ignore_unused_variable_warning(g); }
         /// Sets the iterator to the given arc.
 …
         ///
         OutArcIt(const Graph& n, const Node& g) {
           ::lemon::ignore_unused_variable_warning(n);
           ::lemon::ignore_unused_variable_warning(g);
+          ignore_unused_variable_warning(n);
+          ignore_unused_variable_warning(g);
+        }
         /// Sets the iterator to the given arc.
 …
         ///
         InArcIt(const Graph& g, const Node& n) {
           ::lemon::ignore_unused_variable_warning(n);
           ::lemon::ignore_unused_variable_warning(g);
+          ignore_unused_variable_warning(n);
+          ignore_unused_variable_warning(g);
+        }
         /// Sets the iterator to the given arc.
 …
       /// \brief The base node of the iterator.
       ///
       /// Returns the base node of the given incoming arc iterator
+      /// Returns the base node of the given incomming arc iterator
       /// (i.e. the target node of the corresponding arc).
       Node baseNode(InArcIt) const { return INVALID; }
 …
       /// \brief The running node of the iterator.
       ///
       /// Returns the running node of the given incoming arc iterator
+      /// Returns the running node of the given incomming arc iterator
       /// (i.e. the source node of the corresponding arc).
       Node runningNode(InArcIt) const { return INVALID; }

lemon/concepts/graph_components.h

-                      r1270
+                      r1196
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
           bool b;
           ::lemon::ignore_unused_variable_warning(b);
+          ignore_unused_variable_warning(b);
           b = (ia == ib) && (ia != ib);
 …
             ue = e;
             bool d = graph.direction(e);
             ::lemon::ignore_unused_variable_warning(d);
+            ignore_unused_variable_warning(d);
+          }
+        }
 …
       /// \brief Gives back the red end node of the edge.
       ///
+      ///
       /// Gives back the red end node of the edge.
       RedNode redNode(const Edge&) const { return RedNode(); }
       /// \brief Gives back the blue end node of the edge.
       ///
+      ///
       /// Gives back the blue end node of the edge.
       BlueNode blueNode(const Edge&) const { return BlueNode(); }
 …
             rn = bpgraph.asRedNode(rnan);
             bn = bpgraph.asBlueNode(bnan);
             ::lemon::ignore_unused_variable_warning(b);
+            ignore_unused_variable_warning(b);
+          }
+        }
 …
           nid = digraph.maxNodeId();
           ::lemon::ignore_unused_variable_warning(nid);
+          ignore_unused_variable_warning(nid);
           eid = digraph.maxArcId();
           ::lemon::ignore_unused_variable_warning(eid);
+          ignore_unused_variable_warning(eid);
+        }
 …
           edge = graph.edgeFromId(ueid);
           ueid = graph.maxEdgeId();
           ::lemon::ignore_unused_variable_warning(ueid);
+          ignore_unused_variable_warning(ueid);
+        }
 …
           rid = bpgraph.maxRedId();
           bid = bpgraph.maxBlueId();
           ::lemon::ignore_unused_variable_warning(rid);
           ::lemon::ignore_unused_variable_warning(bid);
+          ignore_unused_variable_warning(rid);
+          ignore_unused_variable_warning(bid);
+        }
 …
           _GraphItemIt it3 = it1;
           _GraphItemIt it4 = INVALID;
           ::lemon::ignore_unused_variable_warning(it3);
           ::lemon::ignore_unused_variable_warning(it4);
+          ignore_unused_variable_warning(it3);
+          ignore_unused_variable_warning(it4);
           it2 = ++it1;
 …
           _GraphIncIt it3 = it1;
           _GraphIncIt it4 = INVALID;
           ::lemon::ignore_unused_variable_warning(it3);
           ::lemon::ignore_unused_variable_warning(it4);
+          ignore_unused_variable_warning(it3);
+          ignore_unused_variable_warning(it4);
           it2 = ++it1;
 …
       void next(Arc&) const {}
       /// \brief Return the first arc incoming to the given node.
       ///
       /// This function gives back the first arc incoming to the
+      /// \brief Return the first arc incomming to the given node.
+      ///
+      /// This function gives back the first arc incomming to the
       /// given node.
       void firstIn(Arc&, const Node&) const {}
       /// \brief Return the next arc incoming to the given node.
       ///
       /// This function gives back the next arc incoming to the
+      /// \brief Return the next arc incomming to the given node.
+      ///
+      /// This function gives back the next arc incomming to the
       /// given node.
       void nextIn(Arc&) const {}
 …
             n = digraph.baseNode(oait);
             n = digraph.runningNode(oait);
             ::lemon::ignore_unused_variable_warning(n);
+            ignore_unused_variable_warning(n);
+          }
+        }
 …
       typedef typename Base::Arc Arc;
       typedef typename Base::Edge Edge;
       typedef IterableBpGraphComponent BpGraph;
 …
           typename _BpGraph::RedNode rn(INVALID);
           bpgraph.first(rn);
           bpgraph.next(rn);
+          bpgraph.next(rn);
           typename _BpGraph::BlueNode bn(INVALID);
           bpgraph.first(bn);
 …
             = digraph.notifier(typename _Digraph::Arc());
           ::lemon::ignore_unused_variable_warning(nn);
           ::lemon::ignore_unused_variable_warning(en);
+          ignore_unused_variable_warning(nn);
+          ignore_unused_variable_warning(en);
+        }
 …
           typename _Graph::EdgeNotifier& uen
             = graph.notifier(typename _Graph::Edge());
           ::lemon::ignore_unused_variable_warning(uen);
+          ignore_unused_variable_warning(uen);
+        }
 …
           typename _BpGraph::BlueNodeNotifier& bnn
             = bpgraph.notifier(typename _BpGraph::BlueNode());
           ::lemon::ignore_unused_variable_warning(rnn);
           ::lemon::ignore_unused_variable_warning(bnn);
+          ignore_unused_variable_warning(rnn);
+          ignore_unused_variable_warning(bnn);
+        }
 …
           // m3 = cmap;
           ::lemon::ignore_unused_variable_warning(m1);
           ::lemon::ignore_unused_variable_warning(m2);
           // ::lemon::ignore_unused_variable_warning(m3);
+          ignore_unused_variable_warning(m1);
+          ignore_unused_variable_warning(m2);
+          // ignore_unused_variable_warning(m3);
+        }

lemon/concepts/heap.h

-                      r1270
+                      r1127
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
           item=Item();
           prio=Prio();
           ::lemon::ignore_unused_variable_warning(item);
           ::lemon::ignore_unused_variable_warning(prio);
+          ignore_unused_variable_warning(item);
+          ignore_unused_variable_warning(prio);
           OwnItem own_item;
 …
           own_item=Item();
           own_prio=Prio();
           ::lemon::ignore_unused_variable_warning(own_item);
           ::lemon::ignore_unused_variable_warning(own_prio);
           ::lemon::ignore_unused_variable_warning(own_state);
+          ignore_unused_variable_warning(own_item);
+          ignore_unused_variable_warning(own_prio);
+          ignore_unused_variable_warning(own_state);
           _Heap heap1(map);
           _Heap heap2 = heap1;
           ::lemon::ignore_unused_variable_warning(heap1);
           ::lemon::ignore_unused_variable_warning(heap2);
+          ignore_unused_variable_warning(heap1);
+          ignore_unused_variable_warning(heap2);
           int s = heap.size();
           ::lemon::ignore_unused_variable_warning(s);
+          ignore_unused_variable_warning(s);
           bool e = heap.empty();
           ::lemon::ignore_unused_variable_warning(e);
+          ignore_unused_variable_warning(e);
           prio = heap.prio();

lemon/concepts/maps.h

-                      r1270
+                      r1157
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2009
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
           own_val = m[own_key];
           ::lemon::ignore_unused_variable_warning(key);
           ::lemon::ignore_unused_variable_warning(val);
           ::lemon::ignore_unused_variable_warning(own_key);
           ::lemon::ignore_unused_variable_warning(own_val);
+          ignore_unused_variable_warning(key);
+          ignore_unused_variable_warning(val);
+          ignore_unused_variable_warning(own_key);
+          ignore_unused_variable_warning(own_val);
+        }
         const Key& key;
 …
           m.set(own_key, own_val);
           ::lemon::ignore_unused_variable_warning(key);
           ::lemon::ignore_unused_variable_warning(val);
           ::lemon::ignore_unused_variable_warning(own_key);
           ::lemon::ignore_unused_variable_warning(own_val);
+          ignore_unused_variable_warning(key);
+          ignore_unused_variable_warning(val);
+          ignore_unused_variable_warning(own_key);
+          ignore_unused_variable_warning(own_val);
+        }
         const Key& key;

lemon/concepts/path.h

-                      r1270
+                      r1127
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2009
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
       template <typename CPath>
       Path& operator=(const CPath& cpath) {
         ::lemon::ignore_unused_variable_warning(cpath);
+        ignore_unused_variable_warning(cpath);
         return *this;
+      }
 …
           e = (i < ii);
           ::lemon::ignore_unused_variable_warning(l);
           ::lemon::ignore_unused_variable_warning(pp);
           ::lemon::ignore_unused_variable_warning(e);
           ::lemon::ignore_unused_variable_warning(id);
           ::lemon::ignore_unused_variable_warning(ii);
           ::lemon::ignore_unused_variable_warning(ed);
+          ignore_unused_variable_warning(l);
+          ignore_unused_variable_warning(pp);
+          ignore_unused_variable_warning(e);
+          ignore_unused_variable_warning(id);
+          ignore_unused_variable_warning(ii);
+          ignore_unused_variable_warning(ed);
+        }
       };
 …
           e = (i != INVALID);
           ::lemon::ignore_unused_variable_warning(l);
           ::lemon::ignore_unused_variable_warning(e);
           ::lemon::ignore_unused_variable_warning(id);
           ::lemon::ignore_unused_variable_warning(ed);
+          ignore_unused_variable_warning(l);
+          ignore_unused_variable_warning(e);
+          ignore_unused_variable_warning(id);
+          ignore_unused_variable_warning(ed);
+        }
         _Path& p;
 …
           e = (i != INVALID);
           ::lemon::ignore_unused_variable_warning(l);
           ::lemon::ignore_unused_variable_warning(e);
           ::lemon::ignore_unused_variable_warning(id);
           ::lemon::ignore_unused_variable_warning(ed);
+          ignore_unused_variable_warning(l);
+          ignore_unused_variable_warning(e);
+          ignore_unused_variable_warning(id);
+          ignore_unused_variable_warning(ed);
+        }
         _Path& p;

lemon/config.h.in

-                      r1264
+                      r1133
 #cmakedefine LEMON_HAVE_GLPK 1
 #cmakedefine LEMON_HAVE_CPLEX 1
-#cmakedefine LEMON_HAVE_SOPLEX 1
 #cmakedefine LEMON_HAVE_CLP 1
 #cmakedefine LEMON_HAVE_CBC 1
-#cmakedefine LEMON_DEFAULT_LP @LEMON_DEFAULT_LP@
-#cmakedefine LEMON_DEFAULT_MIP @LEMON_DEFAULT_MIP@
 #cmakedefine LEMON_USE_PTHREAD 1
 #cmakedefine LEMON_USE_WIN32_THREADS 1

lemon/connectivity.h

-                      r1270
+                      r956
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   ///
   /// This function checks whether the given undirected graph is
+  /// bi-node-connected, i.e. a connected graph without articulation
+  /// node.
+  /// bi-node-connected, i.e. any two edges are on same circle.
   ///
   /// \return \c true if the graph bi-node-connected.
+  ///
+  /// \note By definition,
+  /// \li a graph consisting of zero or one node is bi-node-connected,
+  /// \li a graph consisting of two isolated nodes
+  /// is \e not bi-node-connected and
+  /// \li a graph consisting of two nodes connected by an edge
+  /// is bi-node-connected.
+  /// \note By definition, the empty graph is bi-node-connected.
   ///
   /// \see countBiNodeConnectedComponents(), biNodeConnectedComponents()
   template <typename Graph>
   bool biNodeConnected(const Graph& graph) {
-    bool hasNonIsolated = false, hasIsolated = false;
-    for (typename Graph::NodeIt n(graph); n != INVALID; ++n) {
-      if (typename Graph::OutArcIt(graph, n) == INVALID) {
-        if (hasIsolated || hasNonIsolated) {
-          return false;
-        } else {
-          hasIsolated = true;
+        }
-      } else {
-        if (hasIsolated) {
-          return false;
-        } else {
-          hasNonIsolated = true;
+        }
+      }
+    }
     return countBiNodeConnectedComponents(graph) <= 1;
+  }

lemon/core.h

-                      r1270
+                      r1195
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
 #ifdef _MSC_VER
 #pragma warning( disable : 4250 4355 4503 4800 4996 )
-#endif
-#ifdef __GNUC__
-#define GCC_VERSION (__GNUC__ * 10000                   \
-                     + __GNUC_MINOR__ * 100             \
-                     + __GNUC_PATCHLEVEL__)
-#endif
-#if GCC_VERSION >= 40800
-// Needed by the [DI]GRAPH_TYPEDEFS marcos for gcc 4.8
-#pragma GCC diagnostic ignored "-Wunused-local-typedefs"
 #endif
 …
   namespace _graph_utils_bits {
     template <typename Graph, typename Enable = void>
     struct CountRedNodesSelector {
 …
     template <typename Graph>
     struct CountRedNodesSelector<
       Graph, typename
       enable_if<typename Graph::NodeNumTag, void>::type>
+      Graph, typename
+      enable_if<typename Graph::NodeNumTag, void>::type>
+    {
       static int count(const Graph &g) {
         return g.redNum();
+      }
     };
+    };
+  }
 …
   /// graph structures it is specialized to run in O(1).
   ///
   /// If the graph contains a \e redNum() member function and a
+  /// If the graph contains a \e redNum() member function and a
   /// \e NodeNumTag tag then this function calls directly the member
   /// function to query the cardinality of the node set.
 …
   namespace _graph_utils_bits {
     template <typename Graph, typename Enable = void>
     struct CountBlueNodesSelector {
 …
     template <typename Graph>
     struct CountBlueNodesSelector<
       Graph, typename
       enable_if<typename Graph::NodeNumTag, void>::type>
+      Graph, typename
+      enable_if<typename Graph::NodeNumTag, void>::type>
+    {
       static int count(const Graph &g) {
         return g.blueNum();
+      }
     };
+    };
+  }
 …
   /// graph structures it is specialized to run in O(1).
   ///
   /// If the graph contains a \e blueNum() member function and a
+  /// If the graph contains a \e blueNum() member function and a
   /// \e NodeNumTag tag then this function calls directly the member
   /// function to query the cardinality of the node set.
 …
     /// The Digraph type
     typedef GR Digraph;
   protected:

lemon/cost_scaling.h

-                      r1298
+                      r1297
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   /// \ref CostScaling implements a cost scaling algorithm that performs
   /// push/augment and relabel operations for finding a \ref min_cost_flow
+  /// "minimum cost flow" \cite amo93networkflows,
+  /// \cite goldberg90approximation,
+  /// \cite goldberg97efficient, \cite bunnagel98efficient.
+  /// "minimum cost flow" \ref amo93networkflows, \ref goldberg90approximation,
+  /// \ref goldberg97efficient, \ref bunnagel98efficient.
   /// It is a highly efficient primal-dual solution method, which
   /// can be viewed as the generalization of the \ref Preflow
   /// "preflow push-relabel" algorithm for the maximum flow problem.
-  /// It is a polynomial algorithm, its running time complexity is
-  /// \f$O(n^2m\log(nK))\f$, where <i>K</i> denotes the maximum arc cost.
   ///
   /// In general, \ref NetworkSimplex and \ref CostScaling are the fastest
 …
     typedef typename TR::LargeCost LargeCost;
+    /// \brief The \ref lemon::CostScalingDefaultTraits "traits class"
+    /// of the algorithm
+    /// The \ref CostScalingDefaultTraits "traits class" of the algorithm
     typedef TR Traits;
 …
     typedef std::vector<LargeCost> LargeCostVector;
     typedef std::vector<char> BoolVector;
+    // Note: vector<char> is used instead of vector<bool>
+    // for efficiency reasons
+    // Note: vector<char> is used instead of vector<bool> for efficiency reasons
   private:
 …
     ///
     /// This function returns the total cost of the found flow.
     /// Its complexity is O(m).
+    /// Its complexity is O(e).
     ///
     /// \note The return type of the function can be specified as a
 …
       return OPTIMAL;
+    }
     // Check if the upper bound is greater than or equal to the lower bound
     // on each forward arc.
 …
           _buckets[r] = _bucket_next[u];
           // Search the incoming arcs of u
+          // Search the incomming arcs of u
           LargeCost pi_u = _pi[u];
           int last_out = _first_out[u+1];

lemon/cplex.cc

-                      r1270
+                      r1183
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
                    _message_enabled ? CPX_ON : CPX_OFF);
+  }
-  void CplexBase::_write(std::string file, std::string format) const
+  {
-    if(format == "MPS" || format == "LP")
-      CPXwriteprob(cplexEnv(), cplexLp(), file.c_str(), format.c_str());
-    else if(format == "SOL")
-      CPXsolwrite(cplexEnv(), cplexLp(), file.c_str());
-    else throw UnsupportedFormatError(format);
+  }
   // CplexLp members

lemon/cplex.h

-                      r1270
+                      r793
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2009
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
     bool _message_enabled;
-    void _write(std::string file, std::string format) const;
   public:
 …
     const cpxlp* cplexLp() const { return _prob; }
-#ifdef DOXYGEN
-    /// Write the problem or the solution to a file in the given format
-    /// This function writes the problem or the solution
-    /// to a file in the given format.
-    /// Trying to write in an unsupported format will trigger
-    /// \ref lemon::LpBase::UnsupportedFormatError "UnsupportedFormatError".
-    /// \param file The file path
-    /// \param format The output file format.
-    /// Supportted formats are "MPS", "LP" and "SOL".
-    void write(std::string file, std::string format = "MPS") const {}
-#endif
   };

lemon/cycle_canceling.h

-                      r1298
+                      r1297
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   /// \ref CycleCanceling implements three different cycle-canceling
   /// algorithms for finding a \ref min_cost_flow "minimum cost flow"
   /// \cite amo93networkflows, \cite klein67primal,
   /// \cite goldberg89cyclecanceling.
+  /// \ref amo93networkflows, \ref klein67primal,
+  /// \ref goldberg89cyclecanceling.
   /// The most efficent one is the \ref CANCEL_AND_TIGHTEN
   /// "Cancel-and-Tighten" algorithm, thus it is the default method.
   /// It runs in strongly polynomial time \f$O(n^2 m^2 \log n)\f$,
   /// but in practice, it is typically orders of magnitude slower than
   /// the scaling algorithms and \ref NetworkSimplex.
+  /// It runs in strongly polynomial time, but in practice, it is typically
+  /// orders of magnitude slower than the scaling algorithms and
+  /// \ref NetworkSimplex.
   /// (For more information, see \ref min_cost_flow_algs "the module page".)
   ///
 …
       /// The "Minimum Mean Cycle-Canceling" algorithm, which is a
       /// well-known strongly polynomial method
       /// \cite goldberg89cyclecanceling. It improves along a
+      /// \ref goldberg89cyclecanceling. It improves along a
       /// \ref min_mean_cycle "minimum mean cycle" in each iteration.
       /// Its running time complexity is \f$O(n^2 m^3 \log n)\f$.
+      /// Its running time complexity is O(n<sup>2</sup>e<sup>3</sup>log(n)).
       MINIMUM_MEAN_CYCLE_CANCELING,
       /// The "Cancel-and-Tighten" algorithm, which can be viewed as an
       /// improved version of the previous method
       /// \cite goldberg89cyclecanceling.
+      /// \ref goldberg89cyclecanceling.
       /// It is faster both in theory and in practice, its running time
       /// complexity is \f$O(n^2 m^2 \log n)\f$.
+      /// complexity is O(n<sup>2</sup>e<sup>2</sup>log(n)).
       CANCEL_AND_TIGHTEN
     };
 …
     ///
     /// This function returns the total cost of the found flow.
     /// Its complexity is O(m).
+    /// Its complexity is O(e).
     ///
     /// \note The return type of the function can be specified as a
 …
       return OPTIMAL;
+    }
     // Check if the upper bound is greater than or equal to the lower bound
     // on each forward arc.
 …
       buildResidualNetwork();
       while (true) {
         typename HwMmc::TerminationCause hw_tc =
             hw_mmc.findCycleMean(hw_iter_limit);
 …
           hw_mmc.findCycle();
+        }
         // Compute delta value
         Value delta = INF;

lemon/dfs.h

-                      r1270
+                      r1161
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
     typedef PredMapPath<Digraph, PredMap> Path;
     ///The \ref lemon::DfsDefaultTraits "traits class" of the algorithm.
+    ///The \ref DfsDefaultTraits "traits class" of the algorithm.
     typedef TR Traits;

lemon/dijkstra.h

-                      r1270
+                      r956
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
     ///The heap type used by the algorithm.
     typedef typename TR::Heap Heap;
     /// \brief The \ref lemon::DijkstraDefaultOperationTraits
     /// "operation traits class" of the algorithm.
+    ///\brief The \ref DijkstraDefaultOperationTraits "operation traits class"
+    ///of the algorithm.
     typedef typename TR::OperationTraits OperationTraits;
     ///The \ref lemon::DijkstraDefaultTraits "traits class" of the algorithm.
+    ///The \ref DijkstraDefaultTraits "traits class" of the algorithm.
     typedef TR Traits;

lemon/dimacs.h

r1270	r956
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2010
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/edge_set.h

r1270	r956
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2010
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/euler.h

r1270	r1023
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2010
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/fractional_matching.h

-                      r1270
+                      r956
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   public:
     /// \brief The \ref lemon::MaxFractionalMatchingDefaultTraits
     /// "traits class" of the algorithm.
+    /// \brief The \ref MaxFractionalMatchingDefaultTraits "traits
+    /// class" of the algorithm.
     typedef TR Traits;
     /// The type of the graph the algorithm runs on.

lemon/full_graph.h

-                      r1270
+                      r1193
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
     static int id(Arc e) { return e._id; }
     static int id(Edge e) { return e._id; }
     static Node nodeFromId(int id) { return Node(id);}
     static Arc arcFromId(int id) { return Arc(id);}
 …
       return n._id - _red_num;
+    }
     void clear() {
       _red_num = 0; _blue_num = 0;
 …
+    }
     Edge edge(const Node& u, const Node& v) const {
+    Edge edge(const Node& u, const Node& v) const {
       if (u._id < _red_num) {
         if (v._id < _red_num) {
 …
+    }
     Arc arc(const Node& u, const Node& v) const {
+    Arc arc(const Node& u, const Node& v) const {
       if (u._id < _red_num) {
         if (v._id < _red_num) {

lemon/glpk.cc

-                      r1270
+                      r1142
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
       break;
+    }
+  }
-  void GlpkBase::_write(std::string file, std::string format) const
+  {
-    if(format == "MPS")
-      glp_write_mps(lp, GLP_MPS_FILE, 0, file.c_str());
-    else if(format == "LP")
-      glp_write_lp(lp, 0, file.c_str());
-    else throw UnsupportedFormatError(format);
+  }
 …
   const char* GlpkMip::_solverName() const { return "GlpkMip"; }
 } //END OF NAMESPACE LEMON

lemon/glpk.h

-                      r1270
+                      r956
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
     virtual void _messageLevel(MessageLevel level);
-    virtual void _write(std::string file, std::string format) const;
   private:
 …
     int lpxCol(Col c) const { return cols(id(c)); }
-#ifdef DOXYGEN
-    /// Write the problem or the solution to a file in the given format
-    /// This function writes the problem or the solution
-    /// to a file in the given format.
-    /// Trying to write in an unsupported format will trigger
-    /// \ref LpBase::UnsupportedFormatError.
-    /// \param file The file path
-    /// \param format The output file format.
-    /// Supportted formats are "MPS" and "LP".
-    void write(std::string file, std::string format = "MPS") const {}
-#endif
   };

lemon/gomory_hu.h

-                      r1270
+                      r956
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   ///
   /// The algorithm calculates \e n-1 distinct minimum cuts (currently with
   /// the \ref Preflow algorithm), thus it has \f$O(n^3\sqrt{m})\f$ overall
+  /// the \ref Preflow algorithm), thus it has \f$O(n^3\sqrt{e})\f$ overall
   /// time complexity. It calculates a rooted Gomory-Hu tree.
   /// The structure of the tree and the edge weights can be

lemon/graph_to_eps.h

-                      r1291
+                      r1159
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   using T::_copyright;
+  using typename T::NodeTextColorType;
   using T::CUST_COL;
   using T::DIST_COL;

lemon/greedy_tsp.h

-                      r1270
+                      r1205
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
       Cost _sum;
       std::vector<Node> _path;
     private:
       // Functor class to compare edges by their costs
       class EdgeComp {
 …
       ///
       /// This function copies the found tour as a list of arcs/edges into
       /// the given \ref lemon::concepts::Path "path structure".
+      /// the given \ref concept::Path "path structure".
       ///
       /// \pre run() must be called before using this function.

lemon/grosso_locatelli_pullan_mc.h

-                      r1270
+                      r1022
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   /// \ref GrossoLocatelliPullanMc implements the iterated local search
   /// algorithm of Grosso, Locatelli, and Pullan for solving the \e maximum
   /// \e clique \e problem \cite grosso08maxclique.
+  /// \e clique \e problem \ref grosso08maxclique.
   /// It is to find the largest complete subgraph (\e clique) in an
   /// undirected graph, i.e., the largest set of nodes where each
 …
     BoolMatrix _gr;
     int _n;
     // Search options
     bool _delta_based_restart;
     int _restart_delta_limit;
     // Search limits
     int _iteration_limit;
 …
     /// \name Execution Control
     /// The \ref run() function can be used to execute the algorithm.\n
     /// The functions \ref iterationLimit(int), \ref stepLimit(int), and
+    /// The functions \ref iterationLimit(int), \ref stepLimit(int), and
     /// \ref sizeLimit(int) can be used to specify various limits for the
     /// search process.
     /// @{
     /// \brief Sets the maximum number of iterations.
     ///
 …
     /// likely finds larger cliques. For smaller values, the algorithm is
     /// faster but probably gives worse results.
     ///
+    ///
     /// The default value is \c 1000.
     /// \c -1 means that number of iterations is not limited.
 …
       return *this;
+    }
     /// \brief Sets the maximum number of search steps.
     ///
 …
     /// likely finds larger cliques. For smaller values, the algorithm is
     /// faster but probably gives worse results.
     ///
+    ///
     /// The default value is \c -1, which means that number of steps
     /// is not limited explicitly. However, the number of iterations is
 …
       return *this;
+    }
     /// \brief Sets the desired clique size.
     ///
 …
     /// limit. If a clique of this size (or a larger one) is found, then the
     /// algorithm terminates.
     ///
+    ///
     /// This function is especially useful if you know an exact upper bound
     /// for the size of the cliques in the graph or if any clique above
+    /// for the size of the cliques in the graph or if any clique above
     /// a certain size limit is sufficient for your application.
     ///
+    ///
     /// The default value is \c -1, which means that the size limit is set to
     /// the number of nodes in the graph.
 …
       return *this;
+    }
     /// \brief The maximum number of iterations.
     ///
 …
       return _iteration_limit;
+    }
     /// \brief The maximum number of search steps.
     ///
 …
       return _step_limit;
+    }
     /// \brief The desired clique size.
     ///
 …
     /// \name Query Functions
     /// The results of the algorithm can be obtained using these functions.\n
     /// The run() function must be called before using them.
+    /// The run() function must be called before using them.
     /// @{
 …
   private:
     // Initialize search options and limits
     void initOptions() {
 …
       _delta_based_restart = true;
       _restart_delta_limit = 4;
       // Search limits
       _iteration_limit = 1000;

lemon/hao_orlin.h

r1270	r1019
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2010
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/hartmann_orlin_mmc.h

-                      r1270
+                      r1164
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   /// This class implements the Hartmann-Orlin algorithm for finding
   /// a directed cycle of minimum mean cost in a digraph
+  /// \cite hartmann93finding, \cite dasdan98minmeancycle.
+  /// This method is based on \ref KarpMmc "Karp"'s original algorithm, but
+  /// applies an early termination scheme. It makes the algorithm
+  /// significantly faster for some problem instances, but slower for others.
+  /// The algorithm runs in time O(nm) and uses space O(n<sup>2</sup>+m).
+  /// \ref hartmann93finding, \ref dasdan98minmeancycle.
+  /// It is an improved version of \ref KarpMmc "Karp"'s original algorithm,
+  /// it applies an efficient early termination scheme.
+  /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e).
   ///
   /// \tparam GR The type of the digraph the algorithm runs on.
 …
     ///
     /// The path type of the found cycles.
+    /// Using the \ref lemon::HartmannOrlinMmcDefaultTraits
+    /// "default traits class",
+    /// Using the \ref HartmannOrlinMmcDefaultTraits "default traits class",
     /// it is \ref lemon::Path "Path<Digraph>".
     typedef typename TR::Path Path;
+    /// \brief The
+    /// \ref lemon::HartmannOrlinMmcDefaultTraits "traits class"
+    /// of the algorithm
+    /// The \ref HartmannOrlinMmcDefaultTraits "traits class" of the algorithm
     typedef TR Traits;
 …
     ///
     /// If you don't call this function before calling \ref run() or
     /// \ref findCycleMean(), a local \ref Path "path" structure
     /// will be allocated. The destuctor deallocates this automatically
+    /// \ref findCycleMean(), it will allocate a local \ref Path "path"
+    /// structure. The destuctor deallocates this automatically
     /// allocated object, of course.
     ///

lemon/howard_mmc.h

-                      r1271
+                      r1178
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   /// This class implements Howard's policy iteration algorithm for finding
   /// a directed cycle of minimum mean cost in a digraph
   /// \cite dasdan98minmeancycle, \cite dasdan04experimental.
+  /// \ref dasdan98minmeancycle, \ref dasdan04experimental.
   /// This class provides the most efficient algorithm for the
   /// minimum mean cycle problem, though the best known theoretical
 …
     ///
     /// The path type of the found cycles.
     /// Using the \ref lemon::HowardMmcDefaultTraits "default traits class",
+    /// Using the \ref HowardMmcDefaultTraits "default traits class",
     /// it is \ref lemon::Path "Path<Digraph>".
     typedef typename TR::Path Path;
     /// The \ref lemon::HowardMmcDefaultTraits "traits class" of the algorithm
+    /// The \ref HowardMmcDefaultTraits "traits class" of the algorithm
     typedef TR Traits;
 …
     /// these values.
     enum TerminationCause {
       /// No directed cycle can be found in the digraph.
       NO_CYCLE = 0,
       /// Optimal solution (minimum cycle mean) is found.
       OPTIMAL = 1,
 …
     ///
     /// If you don't call this function before calling \ref run() or
     /// \ref findCycleMean(), a local \ref Path "path" structure
     /// will be allocated. The destuctor deallocates this automatically
+    /// \ref findCycleMean(), it will allocate a local \ref Path "path"
+    /// structure. The destuctor deallocates this automatically
     /// allocated object, of course.
     ///
 …
     ///
     /// \param limit  The maximum allowed number of iterations during
     /// the search process. Its default value implies that the algorithm
+    /// the search process. Its default value implies that the algorithm
     /// runs until it finds the exact optimal solution.
     ///
     /// \return The termination cause of the search process.
+    /// For more information, see \ref TerminationCause.
+    TerminationCause findCycleMean(int limit =
+                                   std::numeric_limits<int>::max()) {
+    /// For more information, see \ref TerminationCause.
+    TerminationCause findCycleMean(int limit = std::numeric_limits<int>::max()) {
       // Initialize and find strongly connected components
       init();
 …
           _best_node = _curr_node;
+        }
         if (iter_limit_reached) break;
+      }

lemon/insertion_tsp.h

-                      r1270
+                      r1205
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
       ///
       /// This function copies the found tour as a list of arcs/edges into
       /// the given \ref lemon::concepts::Path "path structure".
+      /// the given \ref concept::Path "path structure".
       ///
       /// \pre run() must be called before using this function.
 …
               Node u = _notused[i];
               Cost min_cost = costDiff(_tour.back(), _tour.front(), u);
               int min_pos = 0;
+              int min_pos = 0;
               for (unsigned int j=1; j<_tour.size(); ++j) {
                 Cost curr_cost = costDiff(_tour[j-1], _tour[j], u);
 …
             _notused[min_node] = _notused.back();
             _notused.pop_back();
             // Insert the selected node into the tour
             const int ipos = _ins_pos[sn];
 …
               Cost nc1 = costDiff(_tour[ipos_prev], _tour[ipos], u);
               Cost nc2 = costDiff(_tour[ipos], _tour[ipos_next], u);
               if (nc1 <= curr_cost || nc2 <= curr_cost) {
                 // A new position is better than the old one
 …
                   // The minimum should be found again
                   curr_cost = costDiff(_tour.back(), _tour.front(), u);
                   curr_pos = 0;
+                  curr_pos = 0;
                   for (unsigned int j=1; j<_tour.size(); ++j) {
                     Cost tmp_cost = costDiff(_tour[j-1], _tour[j], u);
 …
+                }
+              }
               _ins_cost[u] = curr_cost;
               _ins_pos[u] = curr_pos;

lemon/karp_mmc.h

-                      r1270
+                      r1164
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   /// This class implements Karp's algorithm for finding a directed
   /// cycle of minimum mean cost in a digraph
   /// \cite karp78characterization, \cite dasdan98minmeancycle.
   /// It runs in time O(nm) and uses space O(n<sup>2</sup>+m).
+  /// \ref karp78characterization, \ref dasdan98minmeancycle.
+  /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e).
   ///
   /// \tparam GR The type of the digraph the algorithm runs on.
 …
     ///
     /// The path type of the found cycles.
     /// Using the \ref lemon::KarpMmcDefaultTraits "default traits class",
+    /// Using the \ref KarpMmcDefaultTraits "default traits class",
     /// it is \ref lemon::Path "Path<Digraph>".
     typedef typename TR::Path Path;
     /// The \ref lemon::KarpMmcDefaultTraits "traits class" of the algorithm
+    /// The \ref KarpMmcDefaultTraits "traits class" of the algorithm
     typedef TR Traits;
 …
     ///
     /// If you don't call this function before calling \ref run() or
     /// \ref findCycleMean(), a local \ref Path "path" structure
     /// will be allocated. The destuctor deallocates this automatically
+    /// \ref findCycleMean(), it will allocate a local \ref Path "path"
+    /// structure. The destuctor deallocates this automatically
     /// allocated object, of course.
     ///

lemon/kruskal.h

r1270	r1025
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2009
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/lgf_reader.h

-                      r1270
+                      r1198
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2011
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   /// \ingroup lemon_io
   ///
+  /// \brief Return a \ref lemon::DigraphReader "DigraphReader" class
+  ///
+  /// This function just returns a \ref lemon::DigraphReader
+  /// "DigraphReader" class.
+  /// \brief Return a \ref DigraphReader class
+  ///
+  /// This function just returns a \ref DigraphReader class.
   ///
   /// With this function a digraph can be read from an
 …
   ///\endcode
   ///
+  /// For a complete documentation, please see the
+  /// \ref lemon::DigraphReader "DigraphReader"
+  /// For a complete documentation, please see the \ref DigraphReader
   /// class documentation.
   /// \warning Don't forget to put the \ref lemon::DigraphReader::run() "run()"
+  /// \warning Don't forget to put the \ref DigraphReader::run() "run()"
   /// to the end of the parameter list.
   /// \relates DigraphReader
 …
   /// \ingroup lemon_io
   ///
   /// \brief Return a \ref lemon::GraphReader "GraphReader" class
   ///
   /// This function just returns a \ref lemon::GraphReader "GraphReader" class.
+  /// \brief Return a \ref GraphReader class
+  ///
+  /// This function just returns a \ref GraphReader class.
   ///
   /// With this function a graph can be read from an
 …
   ///\endcode
   ///
+  /// For a complete documentation, please see the
+  /// \ref lemon::GraphReader "GraphReader"
+  /// For a complete documentation, please see the \ref GraphReader
   /// class documentation.
   /// \warning Don't forget to put the \ref lemon::GraphReader::run() "run()"
+  /// \warning Don't forget to put the \ref GraphReader::run() "run()"
   /// to the end of the parameter list.
   /// \relates GraphReader
 …
         _red_node_index.insert(std::make_pair(converter(map[n]), n));
+      }
       for (BlueNodeIt n(_graph); n != INVALID; ++n) {
+      for (BlueNodeIt n(_graph); n != INVALID; ++n) {
         _blue_node_index.insert(std::make_pair(converter(map[n]), n));
+      }
 …
   /// \ingroup lemon_io
   ///
+  /// \brief Return a \ref lemon::BpGraphReader "BpGraphReader" class
+  ///
+  /// This function just returns a \ref lemon::BpGraphReader
+  /// "BpGraphReader" class.
+  /// \brief Return a \ref BpGraphReader class
+  ///
+  /// This function just returns a \ref BpGraphReader class.
   ///
   /// With this function a graph can be read from an
 …
   ///\endcode
   ///
+  /// For a complete documentation, please see the
+  /// \ref lemon::BpGraphReader "BpGraphReader"
+  /// For a complete documentation, please see the \ref BpGraphReader
   /// class documentation.
   /// \warning Don't forget to put the \ref lemon::BpGraphReader::run() "run()"
+  /// \warning Don't forget to put the \ref BpGraphReader::run() "run()"
   /// to the end of the parameter list.
   /// \relates BpGraphReader

lemon/lgf_writer.h

-                      r1270
+                      r1198
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
       ValueStorage(const Value& value, const Converter& converter = Converter())
         : _value(value), _converter(converter) {}
       virtual std::string get() {
         return _converter(_value);
 …
   /// \ingroup lemon_io
   ///
+  /// \brief Return a \ref lemon::DigraphWriter "DigraphWriter" class
+  ///
+  /// This function just returns a \ref lemon::DigraphWriter
+  /// "DigraphWriter" class.
+  /// \brief Return a \ref DigraphWriter class
+  ///
+  /// This function just returns a \ref DigraphWriter class.
   ///
   /// With this function a digraph can be write to a file or output
 …
   ///\endcode
   ///
+  /// For a complete documentation, please see the
+  /// \ref lemon::DigraphWriter "DigraphWriter"
+  /// For a complete documentation, please see the \ref DigraphWriter
   /// class documentation.
   /// \warning Don't forget to put the \ref lemon::DigraphWriter::run() "run()"
+  /// \warning Don't forget to put the \ref DigraphWriter::run() "run()"
   /// to the end of the parameter list.
   /// \relates DigraphWriter
 …
   /// \ingroup lemon_io
   ///
   /// \brief Return a \ref lemon::GraphWriter "GraphWriter" class
   ///
   /// This function just returns a \ref lemon::GraphWriter "GraphWriter" class.
+  /// \brief Return a \ref GraphWriter class
+  ///
+  /// This function just returns a \ref GraphWriter class.
   ///
   /// With this function a graph can be write to a file or output
 …
   ///\endcode
   ///
+  /// For a complete documentation, please see the
+  /// \ref lemon::GraphWriter "GraphWriter"
+  /// For a complete documentation, please see the \ref GraphWriter
   /// class documentation.
   /// \warning Don't forget to put the \ref lemon::GraphWriter::run() "run()"
+  /// \warning Don't forget to put the \ref GraphWriter::run() "run()"
   /// to the end of the parameter list.
   /// \relates GraphWriter
 …
   /// \ingroup lemon_io
   ///
+  /// \brief Return a \ref lemon::BpGraphWriter "BpGraphWriter" class
+  ///
+  /// This function just returns a \ref lemon::BpGraphWriter
+  /// "BpGraphWriter" class.
+  /// \brief Return a \ref BpGraphWriter class
+  ///
+  /// This function just returns a \ref BpGraphWriter class.
   ///
   /// With this function a bipartite graph can be write to a file or output
 …
   ///\endcode
   ///
+  /// For a complete documentation, please see the
+  /// \ref lemon::BpGraphWriter "BpGraphWriter"
+  /// For a complete documentation, please see the \ref BpGraphWriter
   /// class documentation.
   /// \warning Don't forget to put the \ref lemon::BpGraphWriter::run() "run()"
+  /// \warning Don't forget to put the \ref BpGraphWriter::run() "run()"
   /// to the end of the parameter list.
   /// \relates BpGraphWriter

lemon/list_graph.h

-                      r1270
+                      r1193
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
     ///or changeTarget(), thus \c ArcIt and \c OutArcIt iterators are
     ///invalidated for the outgoing arcs of node \c v and \c InArcIt
     ///iterators are invalidated for the incoming arcs of \c v.
+    ///iterators are invalidated for the incomming arcs of \c v.
     ///Moreover all iterators referencing node \c v or the removed
     ///loops are also invalidated. Other iterators remain valid.
 …
     void next(BlueNode& node) const {
       node.id = nodes[node.id].partition_next;
+    }
+    }
     void first(Arc& e) const {

lemon/lp.h

-                      r1270
+                      r956
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   ///\ingroup lp_group
   ///
   ///Currently, the possible values are \c GLPK, \c CPLEX or \c CBC
+  ///Currently, the possible values are \c GLPK or \c CPLEX
 #define LEMON_DEFAULT_MIP SOLVER
   ///The default MIP solver.
 …
   ///\ingroup lp_group
   ///
   ///Currently, it is either \c GlpkMip, \c CplexMip , \c CbcMip
+  ///Currently, it is either \c GlpkMip or \c CplexMip
   typedef GlpkMip Mip;
 #else
+#if LEMON_DEFAULT_LP == GLPK
+#ifdef LEMON_HAVE_GLPK
+# define LEMON_DEFAULT_LP GLPK
   typedef GlpkLp Lp;
+#elif LEMON_DEFAULT_LP == CPLEX
+# define LEMON_DEFAULT_MIP GLPK
+  typedef GlpkMip Mip;
+#elif LEMON_HAVE_CPLEX
+# define LEMON_DEFAULT_LP CPLEX
   typedef CplexLp Lp;
+#elif LEMON_DEFAULT_LP == SOPLEX
+# define LEMON_DEFAULT_MIP CPLEX
+  typedef CplexMip Mip;
+#elif LEMON_HAVE_SOPLEX
+# define DEFAULT_LP SOPLEX
   typedef SoplexLp Lp;
+#elif LEMON_DEFAULT_LP == CLP
+#elif LEMON_HAVE_CLP
+# define DEFAULT_LP CLP
   typedef ClpLp Lp;
-#endif
-#if LEMON_DEFAULT_MIP == GLPK
-  typedef GlpkLp Mip;
-#elif LEMON_DEFAULT_MIP == CPLEX
-  typedef CplexMip Mip;
-#elif LEMON_DEFAULT_MIP == CBC
-  typedef CbcMip Mip;
 #endif
 #endif

lemon/lp_base.cc

r1270	r956
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2010
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/lp_base.h

-                      r1270
+                      r1143
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   public:
-    ///Unsupported file format exception
-    class UnsupportedFormatError : public Exception
+    {
-      std::string _format;
-      mutable std::string _what;
-    public:
-      explicit UnsupportedFormatError(std::string format) throw()
-        : _format(format) { }
-      virtual ~UnsupportedFormatError() throw() {}
-      virtual const char* what() const throw() {
-        try {
-          _what.clear();
-          std::ostringstream oss;
-          oss << "lemon::UnsupportedFormatError: " << _format;
-          _what = oss.str();
+        }
-        catch (...) {}
-        if (!_what.empty()) return _what.c_str();
-        else return "lemon::UnsupportedFormatError";
+      }
-    };
-  protected:
-    virtual void _write(std::string, std::string format) const
+    {
-      throw UnsupportedFormatError(format);
+    }
-  public:
     /// Virtual destructor
     virtual ~LpBase() {}
 …
     void min() { _setSense(MIN); }
     ///Clear the problem
+    ///Clears the problem
     void clear() { _clear(); rows.clear(); cols.clear(); }
     /// Set the message level of the solver
+    /// Sets the message level of the solver
     void messageLevel(MessageLevel level) { _messageLevel(level); }
-    /// Write the problem to a file in the given format
-    /// This function writes the problem to a file in the given format.
-    /// Different solver backends may support different formats.
-    /// Trying to write in an unsupported format will trigger
-    /// \ref UnsupportedFormatError. For the supported formats,
-    /// visit the documentation of the base class of the related backends
-    /// (\ref CplexBase, \ref GlpkBase etc.)
-    /// \param file The file path
-    /// \param format The output file format.
-    void write(std::string file, std::string format = "MPS") const
+    {
-      _write(file.c_str(),format.c_str());
+    }
     ///@}

lemon/lp_skeleton.cc

-                      r1270
+                      r956
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   void SkeletonSolverBase::_messageLevel(MessageLevel) {}
-  void SkeletonSolverBase::_write(std::string, std::string) const {}
   LpSkeleton::SolveExitStatus LpSkeleton::_solve() { return SOLVED; }

lemon/lp_skeleton.h

-                      r1270
+                      r956
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
     ///\e
     virtual void _messageLevel(MessageLevel);
-    ///\e
-    virtual void _write(std::string file, std::string format) const;
   };
 …
     ///\e
     virtual const char* _solverName() const;
   };

lemon/maps.h

r1270	r1057
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2010
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/matching.h

r1270	r956
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2010
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/math.h

-                      r1270
+                      r956
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
+    }
-  ///Round a value to its closest integer
-  inline double round(double r) {
-    return (r > 0.0) ? floor(r + 0.5) : ceil(r - 0.5);
+  }
   /// @}
 } //namespace lemon
 #endif //LEMON_MATH_H
+#endif //LEMON_TOLERANCE_H

lemon/max_cardinality_search.h

-                      r1271
+                      r1129
 /* -*- mode: C++; indent-tabs-mode: nil; -*-
+/* -*- C++ -*-
+ *
  * This file is a part of LEMON, a generic C++ optimization library.
+ * This file is a part of LEMON, a generic C++ optimization library
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
 /// \ingroup search
 /// \file
+/// \file
 /// \brief Maximum cardinality search in undirected digraphs.
 …
   template <typename GR, typename CAP>
   struct MaxCardinalitySearchDefaultTraits {
     /// The digraph type the algorithm runs on.
+    /// The digraph type the algorithm runs on.
     typedef GR Digraph;
 …
       static CapacityMap *createCapacityMap(const Digraph& g) {
         return new CapacityMap(g);
+        return new CapacityMap(g);
+      }
     };
 …
       static CapacityMap *createCapacityMap(const Digraph&) {
         return new CapacityMap;
+        return new CapacityMap;
+      }
     };
 …
     /// \brief Instantiates a HeapCrossRef.
     ///
     /// This function instantiates a \ref HeapCrossRef.
     /// \param digraph is the digraph, to which we would like to define the
+    /// This function instantiates a \ref HeapCrossRef.
+    /// \param digraph is the digraph, to which we would like to define the
     /// HeapCrossRef.
     static HeapCrossRef *createHeapCrossRef(const Digraph &digraph) {
       return new HeapCrossRef(digraph);
+    }
     template <typename CapacityMap>
     struct HeapSelector {
       template <typename Value, typename Ref>
       struct Selector {
+      struct Selector {
         typedef BinHeap<Value, Ref, std::greater<Value> > Heap;
       };
 …
     /// \brief Instantiates a Heap.
     ///
     /// This function instantiates a \ref Heap.
+    /// This function instantiates a \ref Heap.
     /// \param crossref The cross reference of the heap.
     static Heap *createHeap(HeapCrossRef& crossref) {
 …
     /// \brief Instantiates a ProcessedMap.
     ///
     /// This function instantiates a \ref ProcessedMap.
+    /// This function instantiates a \ref ProcessedMap.
     /// \param digraph is the digraph, to which
     /// we would like to define the \ref ProcessedMap
 …
     /// \brief The type of the map that stores the cardinalities of the nodes.
     ///
+    ///
     /// The type of the map that stores the cardinalities of the nodes.
     /// It must meet the \ref concepts::WriteMap "WriteMap" concept.
 …
     /// \brief Instantiates a CardinalityMap.
     ///
     /// This function instantiates a \ref CardinalityMap.
     /// \param digraph is the digraph, to which we would like to
     /// define the \ref CardinalityMap
+    /// This function instantiates a \ref CardinalityMap.
+    /// \param digraph is the digraph, to which we would like to define the \ref
+    /// CardinalityMap
     static CardinalityMap *createCardinalityMap(const Digraph &digraph) {
       return new CardinalityMap(digraph);
 …
   };
   /// \ingroup search
   ///
   /// \brief Maximum Cardinality Search algorithm class.
   ///
   /// This class provides an efficient implementation of Maximum Cardinality
   /// Search algorithm. The maximum cardinality search first chooses any
+  /// This class provides an efficient implementation of Maximum Cardinality
+  /// Search algorithm. The maximum cardinality search first chooses any
   /// node of the digraph. Then every time it chooses one unprocessed node
+  /// with maximum cardinality, i.e the sum of capacities on out arcs
+  /// to the nodes
+  /// with maximum cardinality, i.e the sum of capacities on out arcs to the nodes
   /// which were previusly processed.
   /// If there is a cut in the digraph the algorithm should choose
 …
   /// The arc capacities are passed to the algorithm using a
   /// \ref concepts::ReadMap "ReadMap", so it is easy to change it to any
+  /// \ref concepts::ReadMap "ReadMap", so it is easy to change it to any
   /// kind of capacity.
   ///
   /// The type of the capacity is determined by the \ref
+  /// The type of the capacity is determined by the \ref
   /// concepts::ReadMap::Value "Value" of the capacity map.
   ///
 …
   ///
   /// \param GR The digraph type the algorithm runs on. The value of
   /// Digraph is not used directly by the search algorithm, it
+  /// Digraph is not used directly by the search algorithm, it
   /// is only passed to \ref MaxCardinalitySearchDefaultTraits.
   /// \param CAP This read-only ArcMap determines the capacities of
+  /// \param CAP This read-only ArcMap determines the capacities of
   /// the arcs. It is read once for each arc, so the map may involve in
   /// relatively time consuming process to compute the arc capacity if
   /// it is necessary. The default map type is \ref
   /// ConstMap "ConstMap<concepts::Digraph::Arc, Const<int,1> >". The value
   /// of CapacityMap is not used directly by search algorithm, it is only
   /// passed to \ref MaxCardinalitySearchDefaultTraits.
   /// \param TR Traits class to set various data types used by the
   /// algorithm.  The default traits class is
   /// \ref MaxCardinalitySearchDefaultTraits
   /// "MaxCardinalitySearchDefaultTraits<GR, CAP>".
   /// See \ref MaxCardinalitySearchDefaultTraits
+  /// of CapacityMap is not used directly by search algorithm, it is only
+  /// passed to \ref MaxCardinalitySearchDefaultTraits.
+  /// \param TR Traits class to set various data types used by the
+  /// algorithm.  The default traits class is
+  /// \ref MaxCardinalitySearchDefaultTraits
+  /// "MaxCardinalitySearchDefaultTraits<GR, CAP>".
+  /// See \ref MaxCardinalitySearchDefaultTraits
   /// for the documentation of a MaxCardinalitySearch traits class.
 …
   template <typename GR, typename CAP, typename TR>
 #else
   template <typename GR, typename CAP =
             ConstMap<typename GR::Arc, Const<int,1> >,
+            typename TR =
+  template <typename GR, typename CAP =
+            ConstMap<typename GR::Arc, Const<int,1> >,
+            typename TR =
             MaxCardinalitySearchDefaultTraits<GR, CAP> >
 #endif
 …
     ///The type of the underlying digraph.
     typedef typename Traits::Digraph Digraph;
     ///The type of the capacity of the arcs.
     typedef typename Traits::CapacityMap::Value Value;
 …
     typedef MaxCardinalitySearch Create;
     ///\name Named template parameters
 …
       typedef T CapacityMap;
       static CapacityMap *createCapacityMap(const Digraph &) {
                LEMON_ASSERT(false,"Uninitialized parameter.");
         return 0;
+      }
     };
     /// \brief \ref named-templ-param "Named parameter" for setting
+        LEMON_ASSERT(false,"Uninitialized parameter.");
+        return 0;
+      }
+    };
+    /// \brief \ref named-templ-param "Named parameter" for setting
     /// CapacityMap type
     ///
 …
     /// for the algorithm.
     template <class T>
     struct SetCapacityMap
       : public MaxCardinalitySearch<Digraph, CapacityMap,
                                     DefCapacityMapTraits<T> > {
       typedef MaxCardinalitySearch<Digraph, CapacityMap,
+    struct SetCapacityMap
+      : public MaxCardinalitySearch<Digraph, CapacityMap,
+                                    DefCapacityMapTraits<T> > {
+      typedef MaxCardinalitySearch<Digraph, CapacityMap,
                                    DefCapacityMapTraits<T> > Create;
     };
 …
     struct DefCardinalityMapTraits : public Traits {
       typedef T CardinalityMap;
       static CardinalityMap *createCardinalityMap(const Digraph &)
+      static CardinalityMap *createCardinalityMap(const Digraph &)
+      {
         LEMON_ASSERT(false,"Uninitialized parameter.");
         return 0;
+      }
     };
     /// \brief \ref named-templ-param "Named parameter" for setting
+        LEMON_ASSERT(false,"Uninitialized parameter.");
+        return 0;
+      }
+    };
+    /// \brief \ref named-templ-param "Named parameter" for setting
     /// CardinalityMap type
     ///
     /// \ref named-templ-param "Named parameter" for setting CardinalityMap
+    /// \ref named-templ-param "Named parameter" for setting CardinalityMap
     /// type for the algorithm.
     template <class T>
     struct SetCardinalityMap
       : public MaxCardinalitySearch<Digraph, CapacityMap,
                                     DefCardinalityMapTraits<T> > {
       typedef MaxCardinalitySearch<Digraph, CapacityMap,
+    struct SetCardinalityMap
+      : public MaxCardinalitySearch<Digraph, CapacityMap,
+                                    DefCardinalityMapTraits<T> > {
+      typedef MaxCardinalitySearch<Digraph, CapacityMap,
                                    DefCardinalityMapTraits<T> > Create;
     };
     template <class T>
     struct DefProcessedMapTraits : public Traits {
       typedef T ProcessedMap;
       static ProcessedMap *createProcessedMap(const Digraph &) {
                LEMON_ASSERT(false,"Uninitialized parameter.");
         return 0;
+      }
     };
     /// \brief \ref named-templ-param "Named parameter" for setting
+        LEMON_ASSERT(false,"Uninitialized parameter.");
+        return 0;
+      }
+    };
+    /// \brief \ref named-templ-param "Named parameter" for setting
     /// ProcessedMap type
     ///
 …
     /// for the algorithm.
     template <class T>
     struct SetProcessedMap
       : public MaxCardinalitySearch<Digraph, CapacityMap,
                                     DefProcessedMapTraits<T> > {
       typedef MaxCardinalitySearch<Digraph, CapacityMap,
+    struct SetProcessedMap
+      : public MaxCardinalitySearch<Digraph, CapacityMap,
+                                    DefProcessedMapTraits<T> > {
+      typedef MaxCardinalitySearch<Digraph, CapacityMap,
                                    DefProcessedMapTraits<T> > Create;
     };
     template <class H, class CR>
     struct DefHeapTraits : public Traits {
 …
       typedef H Heap;
       static HeapCrossRef *createHeapCrossRef(const Digraph &) {
              LEMON_ASSERT(false,"Uninitialized parameter.");
         return 0;
+        LEMON_ASSERT(false,"Uninitialized parameter.");
+        return 0;
+      }
       static Heap *createHeap(HeapCrossRef &) {
                LEMON_ASSERT(false,"Uninitialized parameter.");
         return 0;
+      }
     };
     /// \brief \ref named-templ-param "Named parameter" for setting heap
+        LEMON_ASSERT(false,"Uninitialized parameter.");
+        return 0;
+      }
+    };
+    /// \brief \ref named-templ-param "Named parameter" for setting heap
     /// and cross reference type
     ///
     /// \ref named-templ-param "Named parameter" for setting heap and cross
+    /// \ref named-templ-param "Named parameter" for setting heap and cross
     /// reference type for the algorithm.
     template <class H, class CR = typename Digraph::template NodeMap<int> >
     struct SetHeap
       : public MaxCardinalitySearch<Digraph, CapacityMap,
                                     DefHeapTraits<H, CR> > {
       typedef MaxCardinalitySearch< Digraph, CapacityMap,
+      : public MaxCardinalitySearch<Digraph, CapacityMap,
+                                    DefHeapTraits<H, CR> > {
+      typedef MaxCardinalitySearch< Digraph, CapacityMap,
                                     DefHeapTraits<H, CR> > Create;
     };
 …
       typedef H Heap;
       static HeapCrossRef *createHeapCrossRef(const Digraph &digraph) {
         return new HeapCrossRef(digraph);
+        return new HeapCrossRef(digraph);
+      }
       static Heap *createHeap(HeapCrossRef &crossref) {
         return new Heap(crossref);
+      }
     };
     /// \brief \ref named-templ-param "Named parameter" for setting heap and
+        return new Heap(crossref);
+      }
+    };
+    /// \brief \ref named-templ-param "Named parameter" for setting heap and
     /// cross reference type with automatic allocation
     ///
     /// \ref named-templ-param "Named parameter" for setting heap and cross
     /// reference type. It can allocate the heap and the cross reference
     /// object if the cross reference's constructor waits for the digraph as
+    /// \ref named-templ-param "Named parameter" for setting heap and cross
+    /// reference type. It can allocate the heap and the cross reference
+    /// object if the cross reference's constructor waits for the digraph as
     /// parameter and the heap's constructor waits for the cross reference.
     template <class H, class CR = typename Digraph::template NodeMap<int> >
     struct SetStandardHeap
       : public MaxCardinalitySearch<Digraph, CapacityMap,
                                     DefStandardHeapTraits<H, CR> > {
       typedef MaxCardinalitySearch<Digraph, CapacityMap,
                                    DefStandardHeapTraits<H, CR> >
+      : public MaxCardinalitySearch<Digraph, CapacityMap,
+                                    DefStandardHeapTraits<H, CR> > {
+      typedef MaxCardinalitySearch<Digraph, CapacityMap,
+                                   DefStandardHeapTraits<H, CR> >
       Create;
     };
     ///@}
 …
     MaxCardinalitySearch() {}
   public:
+  public:
     /// \brief Constructor.
     ///
 …
     ///\param capacity the capacity map used by the algorithm.
     MaxCardinalitySearch(const Digraph& digraph,
                          const CapacityMap& capacity) :
+                         const CapacityMap& capacity) :
       _graph(&digraph),
       _capacity(&capacity), local_capacity(false),
 …
     MaxCardinalitySearch &capacityMap(const CapacityMap &m) {
       if (local_capacity) {
         delete _capacity;
         local_capacity=false;
+        delete _capacity;
+        local_capacity=false;
+      }
       _capacity=&m;
 …
+    }
     /// \brief Sets the map storing the cardinalities calculated by the
+    /// \brief Sets the map storing the cardinalities calculated by the
     /// algorithm.
     ///
 …
     MaxCardinalitySearch &cardinalityMap(CardinalityMap &m) {
       if(local_cardinality) {
         delete _cardinality;
         local_cardinality=false;
+        delete _cardinality;
+        local_cardinality=false;
+      }
       _cardinality = &m;
 …
     /// automatically allocated map, of course.
     /// \return <tt> (*this) </tt>
     MaxCardinalitySearch &processedMap(ProcessedMap &m)
+    MaxCardinalitySearch &processedMap(ProcessedMap &m)
+    {
       if(local_processed) {
         delete _processed;
         local_processed=false;
+        delete _processed;
+        local_processed=false;
+      }
       _processed = &m;
 …
     MaxCardinalitySearch &heap(Heap& hp, HeapCrossRef &cr) {
       if(local_heap_cross_ref) {
         delete _heap_cross_ref;
         local_heap_cross_ref = false;
+        delete _heap_cross_ref;
+        local_heap_cross_ref = false;
+      }
       _heap_cross_ref = &cr;
       if(local_heap) {
         delete _heap;
         local_heap = false;
+        delete _heap;
+        local_heap = false;
+      }
       _heap = &hp;
 …
     void create_maps() {
       if(!_capacity) {
         local_capacity = true;
         _capacity = Traits::createCapacityMap(*_graph);
+        local_capacity = true;
+        _capacity = Traits::createCapacityMap(*_graph);
+      }
       if(!_cardinality) {
         local_cardinality = true;
         _cardinality = Traits::createCardinalityMap(*_graph);
+        local_cardinality = true;
+        _cardinality = Traits::createCardinalityMap(*_graph);
+      }
       if(!_processed) {
         local_processed = true;
         _processed = Traits::createProcessedMap(*_graph);
+        local_processed = true;
+        _processed = Traits::createProcessedMap(*_graph);
+      }
       if (!_heap_cross_ref) {
         local_heap_cross_ref = true;
         _heap_cross_ref = Traits::createHeapCrossRef(*_graph);
+        local_heap_cross_ref = true;
+        _heap_cross_ref = Traits::createHeapCrossRef(*_graph);
+      }
       if (!_heap) {
         local_heap = true;
         _heap = Traits::createHeap(*_heap_cross_ref);
+      }
+    }
+        local_heap = true;
+        _heap = Traits::createHeap(*_heap_cross_ref);
+      }
+    }
     void finalizeNodeData(Node node, Value capacity) {
       _processed->set(node, true);
 …
       _heap->clear();
       for (NodeIt it(*_graph) ; it != INVALID ; ++it) {
         _processed->set(it, false);
         _heap_cross_ref->set(it, Heap::PRE_HEAP);
+      }
+    }
+        _processed->set(it, false);
+        _heap_cross_ref->set(it, Heap::PRE_HEAP);
+      }
+    }
     /// \brief Adds a new source node.
     ///
+    ///
     /// Adds a new source node to the priority heap.
     ///
 …
     void addSource(Node source, Value capacity = 0) {
       if(_heap->state(source) == Heap::PRE_HEAP) {
         _heap->push(source, capacity);
+      }
+    }
+        _heap->push(source, capacity);
+      }
+    }
     /// \brief Processes the next node in the priority heap
     ///
 …
     /// \warning The priority heap must not be empty!
     Node processNextNode() {
       Node node = _heap->top();
+      Node node = _heap->top();
       finalizeNodeData(node, _heap->prio());
       _heap->pop();
       for (InArcIt it(*_graph, node); it != INVALID; ++it) {
         Node source = _graph->source(it);
         switch (_heap->state(source)) {
         case Heap::PRE_HEAP:
           _heap->push(source, (*_capacity)[it]);
           break;
         case Heap::IN_HEAP:
           _heap->decrease(source, (*_heap)[source] + (*_capacity)[it]);
           break;
         case Heap::POST_HEAP:
           break;
+        }
+        Node source = _graph->source(it);
+        switch (_heap->state(source)) {
+        case Heap::PRE_HEAP:
+          _heap->push(source, (*_capacity)[it]);
+          break;
+        case Heap::IN_HEAP:
+          _heap->decrease(source, (*_heap)[source] + (*_capacity)[it]);
+          break;
+        case Heap::POST_HEAP:
+          break;
+        }
+      }
       return node;
 …
     /// Next node to be processed.
     ///
     /// \return The next node to be processed or INVALID if the
+    /// \return The next node to be processed or INVALID if the
     /// priority heap is empty.
     Node nextNode() {
+    Node nextNode() {
       return !_heap->empty() ? _heap->top() : INVALID;
+    }
     /// \brief Returns \c false if there are nodes
     /// to be processed in the priority heap
 …
     /// to be processed in the priority heap
     bool emptyQueue() { return _heap->empty(); }
     /// \brief Returns the number of the nodes to be processed
+    /// \brief Returns the number of the nodes to be processed
     /// in the priority heap
     ///
     /// Returns the number of the nodes to be processed in the priority heap
     int emptySize() { return _heap->size(); }
     /// \brief Executes the algorithm.
     ///
 …
     /// with addSource() before using this function.
     ///
     /// This method runs the Maximum Cardinality Search algorithm from the
+    /// This method runs the Maximum Cardinality Search algorithm from the
     /// source node(s).
     void start() {
       while ( !_heap->empty() ) processNextNode();
+    }
     /// \brief Executes the algorithm until \c dest is reached.
     ///
 …
     /// with addSource() before using this function.
     ///
     /// This method runs the %MaxCardinalitySearch algorithm from the source
+    /// This method runs the %MaxCardinalitySearch algorithm from the source
     /// nodes.
     void start(Node dest) {
 …
       if ( !_heap->empty() ) finalizeNodeData(_heap->top(), _heap->prio());
+    }
     /// \brief Executes the algorithm until a condition is met.
     ///
 …
       if ( !_heap->empty() ) finalizeNodeData(_heap->top(),_heap->prio());
+    }
     /// \brief Runs the maximum cardinality search algorithm from node \c s.
     ///
     /// This method runs the %MaxCardinalitySearch algorithm from a root
+    /// This method runs the %MaxCardinalitySearch algorithm from a root
     /// node \c s.
     ///
 …
+    }
     /// \brief Runs the maximum cardinality search algorithm for the
+    /// \brief Runs the maximum cardinality search algorithm for the
     /// whole digraph.
     ///
     /// This method runs the %MaxCardinalitySearch algorithm from all
+    /// This method runs the %MaxCardinalitySearch algorithm from all
     /// unprocessed node of the digraph.
     ///
 …
+      }
+    }
     ///@}
     /// \name Query Functions
     /// The results of the maximum cardinality search algorithm can be
+    /// The results of the maximum cardinality search algorithm can be
     /// obtained using these functions.
     /// \n
     /// Before the use of these functions, either run() or start() must be
+    /// Before the use of these functions, either run() or start() must be
     /// called.
     ///@{
 …
     /// \brief Returns a reference to the NodeMap of cardinalities.
     ///
     /// Returns a reference to the NodeMap of cardinalities. \pre \ref run()
+    /// Returns a reference to the NodeMap of cardinalities. \pre \ref run()
     /// must be called before using this function.
     const CardinalityMap &cardinalityMap() const { return *_cardinality;}
     /// \brief Checks if a node is reachable from the root.
     ///
 …
     /// \pre \ref run() must be called before using this function.
     bool processed(Node v) { return (*_heap_cross_ref)[v] == Heap::POST_HEAP; }
     ///@}
   };

lemon/min_cost_arborescence.h

-                      r1270
+                      r956
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   /// the minimum cost subgraph that is the union of arborescences with the
   /// given sources and spans all the nodes which are reachable from the
   /// sources. The time complexity of the algorithm is O(n<sup>2</sup>+m).
+  /// sources. The time complexity of the algorithm is O(n<sup>2</sup>+e).
   ///
   /// The algorithm also provides an optimal dual solution, therefore
 …
   public:
     /// \brief The \ref lemon::MinCostArborescenceDefaultTraits "traits class"
+    /// \brief The \ref MinCostArborescenceDefaultTraits "traits class"
     /// of the algorithm.
     typedef TR Traits;

lemon/nagamochi_ibaraki.h

-                      r1270
+                      r1130
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
     //This is here to avoid a gcc-3.3 compilation error.
     //It should never be called.
     NagamochiIbaraki() {}
+    NagamochiIbaraki() {}
   public:
 …
         for (typename Graph::OutArcIt a(_graph, n); a != INVALID; ++a) {
           typename Graph::Node m = _graph.target(a);
           if (!(n < m)) continue;
           (*_nodes)[n].sum += (*_capacity)[a];
           (*_nodes)[m].sum += (*_capacity)[a];
           int c = (*_nodes)[m].curr_arc;
           if (c != -1 && _arcs[c ^ 1].target == n) {
 …
           } else {
             _edges[index].capacity = (*_capacity)[a];
             _arcs[index << 1].prev = -1;
             if ((*_nodes)[n].first_arc != -1) {
 …
             (*_nodes)[m].curr_arc = (index << 1);
             _arcs[(index << 1) | 1].prev = -1;
             if ((*_nodes)[m].first_arc != -1) {
 …
             (*_nodes)[m].first_arc = ((index << 1) | 1);
             _arcs[(index << 1) | 1].target = n;
             ++index;
+          }
 …
       _min_cut = std::numeric_limits<Value>::max();
       for (typename Graph::Node n = _first_node;
+      for (typename Graph::Node n = _first_node;
            n != INVALID; n = (*_nodes)[n].next) {
         if ((*_nodes)[n].sum < _min_cut) {
 …
       _heap->clear();
       for (typename Graph::Node n = _first_node;
+      for (typename Graph::Node n = _first_node;
            n != INVALID; n = (*_nodes)[n].next) {
         (*_heap_cross_ref)[n] = Heap::PRE_HEAP;
 …
         for (int a = (*_nodes)[n].first_arc; a != -1; a = _arcs[a].next) {
           switch (_heap->state(_arcs[a].target)) {
           case Heap::PRE_HEAP:
+          case Heap::PRE_HEAP:
+            {
               Value nv = _edges[a >> 1].capacity;
 …
             if (!merged) {
               for (int b = (*_nodes)[n].first_arc; b != -1; b = _arcs[b].next) {
                 (*_nodes)[_arcs[b].target].curr_arc = b;
+                (*_nodes)[_arcs[b].target].curr_arc = b;
+              }
               merged = true;
 …
               if ((b ^ a) == 1) continue;
               typename Graph::Node o = _arcs[b].target;
               int c = (*_nodes)[o].curr_arc;
+              int c = (*_nodes)[o].curr_arc;
               if (c != -1 && _arcs[c ^ 1].target == n) {
                 _edges[c >> 1].capacity += _edges[b >> 1].capacity;
 …
             } else {
               (*_nodes)[n].first_arc = _arcs[a].next;
+            }
+            }
             if (_arcs[a].next != -1) {
               _arcs[_arcs[a].next].prev = _arcs[a].prev;
 …
             (*_next_rep)[(*_nodes)[n].last_rep] = m;
             (*_nodes)[n].last_rep = (*_nodes)[m].last_rep;
             if ((*_nodes)[m].prev != INVALID) {
               (*_nodes)[(*_nodes)[m].prev].next = (*_nodes)[m].next;

lemon/nearest_neighbor_tsp.h

-                      r1294
+                      r1205
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
             for (IncEdgeIt e(_gr, n1); e != INVALID; ++e) {
               if (!used[_gr.runningNode(e)] &&
                   (min_edge1 == INVALID || _cost[e] < _cost[min_edge1])) {
+                  (_cost[e] < _cost[min_edge1] || min_edge1 == INVALID)) {
                 min_edge1 = e;
+              }
 …
             for (IncEdgeIt e(_gr, n2); e != INVALID; ++e) {
               if (!used[_gr.runningNode(e)] &&
                   (min_edge2 == INVALID||_cost[e] < _cost[min_edge2])) {
+                  (_cost[e] < _cost[min_edge2] || min_edge2 == INVALID)) {
                 min_edge2 = e;
+              }
 …
       ///
       /// This function copies the found tour as a list of arcs/edges into
       /// the given \ref lemon::concepts::Path "path structure".
+      /// the given \ref concept::Path "path structure".
       ///
       /// \pre run() must be called before using this function.

lemon/network_simplex.h

-                      r1298
+                      r1297
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   /// \ref NetworkSimplex implements the primal Network Simplex algorithm
   /// for finding a \ref min_cost_flow "minimum cost flow"
   /// \cite amo93networkflows, \cite dantzig63linearprog,
   /// \cite kellyoneill91netsimplex.
+  /// \ref amo93networkflows, \ref dantzig63linearprog,
+  /// \ref kellyoneill91netsimplex.
   /// This algorithm is a highly efficient specialized version of the
   /// linear programming simplex method directly for the minimum cost
 …
     ///
     /// This function returns the total cost of the found flow.
     /// Its complexity is O(m).
+    /// Its complexity is O(e).
     ///
     /// \note The return type of the function can be specified as a
 …
       return true;
+    }
     // Check if the upper bound is greater than or equal to the lower bound
     // on each arc.
 …
+          }
         } else {
           // Find the min. cost incoming arc for each demand node
+          // Find the min. cost incomming arc for each demand node
           for (int i = 0; i != int(demand_nodes.size()); ++i) {
             Node v = demand_nodes[i];

lemon/opt2_tsp.h

-                      r1270
+                      r1205
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
       ///
       /// This function copies the found tour as a list of arcs/edges into
       /// the given \ref lemon::concepts::Path "path structure".
+      /// the given \ref concept::Path "path structure".
       ///
       /// \pre run() must be called before using this function.

lemon/path.h

-                      r1270
+                      r1162
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
       /// Constructor with starting point
       ArcIt(const SimplePath &_path, int _idx)
         : path(&_path), idx(_idx) {}
+        : idx(_idx), path(&_path) {}
     public:

lemon/planarity.h

r1270	r1160
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2010
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/preflow.h

-                      r1270
+                      r1111
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   /// This class provides an implementation of Goldberg-Tarjan's \e preflow
   /// \e push-relabel algorithm producing a \ref max_flow
   /// "flow of maximum value" in a digraph \cite clrs01algorithms,
   /// \cite amo93networkflows, \cite goldberg88newapproach.
+  /// "flow of maximum value" in a digraph \ref clrs01algorithms,
+  /// \ref amo93networkflows, \ref goldberg88newapproach.
   /// The preflow algorithms are the fastest known maximum
   /// flow algorithms. The current implementation uses a mixture of the
   /// \e "highest label" and the \e "bound decrease" heuristics.
   /// The worst case time complexity of the algorithm is \f$O(n^2\sqrt{m})\f$.
+  /// The worst case time complexity of the algorithm is \f$O(n^2\sqrt{e})\f$.
   ///
   /// The algorithm consists of two phases. After the first phase
 …
   public:
     ///The \ref lemon::PreflowDefaultTraits "traits class" of the algorithm.
+    ///The \ref PreflowDefaultTraits "traits class" of the algorithm.
     typedef TR Traits;
     ///The type of the digraph the algorithm runs on.
 …
+        }
+      }
       for (NodeIt n(_graph); n != INVALID; ++n)
+      for (NodeIt n(_graph); n != INVALID; ++n)
         if(n!=_source && n!=_target && _tolerance.positive((*_excess)[n]))
           _level->activate(n);
       return true;
+    }
 …
           level = _level->highestActiveLevel();
           --num;
           Value excess = (*_excess)[n];
           int new_level = _level->maxLevel();

lemon/radix_sort.h

r1270	r1210
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2009
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/smart_graph.h

-                      r1270
+                      r1193
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
             max_red = -1;
+          }
           Parent::notifier(RedNode()).erase(asRedNodeUnsafe(node));
+          Parent::notifier(RedNode()).erase(asRedNodeUnsafe(node));
         } else {
           first_blue = nodes[n].partition_next;

lemon/soplex.cc

r1270	r956
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2010
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/soplex.h

r1270	r956
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2010
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

lemon/suurballe.h

-                      r1270
+                      r956
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
     typedef typename TR::Heap Heap;
     /// The \ref lemon::SuurballeDefaultTraits "traits class" of the algorithm.
+    /// The \ref SuurballeDefaultTraits "traits class" of the algorithm.
     typedef TR Traits;
 …
     /// This function returns the total length of the found paths, i.e.
     /// the total cost of the found flow.
     /// The complexity of the function is O(m).
+    /// The complexity of the function is O(e).
     ///
     /// \pre \ref run() or \ref findFlow() must be called before using

lemon/time_measure.h

-                      r1270
+                      r833
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2009
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
 #include <fstream>
 #include <iostream>
-#include <lemon/math.h>
 namespace lemon {
 …
     double rtime;
-  public:
-    ///Display format specifier
-    ///\e
-    ///
-    enum Format {
-      /// Reports all measured values
-      NORMAL = 0,
-      /// Only real time and an error indicator is displayed
-      SHORT = 1
-    };
-  private:
-    static Format _format;
     void _reset() {
       utime = stime = cutime = cstime = rtime = 0;
 …
   public:
-    ///Set output format
-    ///Set output format.
-    ///
-    ///The output format is global for all timestamp instances.
-    static void format(Format f) { _format = f; }
-    ///Retrieve the current output format
-    ///Retrieve the current output format
-    ///
-    ///The output format is global for all timestamp instances.
-    static Format format() { return _format; }
     ///Read the current time values of the process
 …
   inline std::ostream& operator<<(std::ostream& os,const TimeStamp &t)
+  {
+    switch(t._format)
+      {
+      case TimeStamp::NORMAL:
+        os << "u: " << t.userTime() <<
+          "s, s: " << t.systemTime() <<
+          "s, cu: " << t.cUserTime() <<
+          "s, cs: " << t.cSystemTime() <<
+          "s, real: " << t.realTime() << "s";
+        break;
+      case TimeStamp::SHORT:
+        double total = t.userTime()+t.systemTime()+
+          t.cUserTime()+t.cSystemTime();
+        os << t.realTime()
+           << "s (err: " << round((t.realTime()-total)/
+                                  t.realTime()*10000)/100
+           << "%)";
+        break;
+      }
+    os << "u: " << t.userTime() <<
+      "s, s: " << t.systemTime() <<
+      "s, cu: " << t.cUserTime() <<
+      "s, cs: " << t.cSystemTime() <<
+      "s, real: " << t.realTime() << "s";
     return os;
+  }
 …
     std::string _title;
     std::ostream &_os;
-    bool _active;
   public:
     ///Constructor
 …
     ///\param os The stream to print the report to.
     ///\param run Sets whether the timer should start immediately.
+    ///\param active Sets whether the report should actually be printed
+    ///       on destruction.
+    TimeReport(std::string title,std::ostream &os=std::cerr,bool run=true,
+               bool active=true)
+      : Timer(run), _title(title), _os(os), _active(active) {}
+    TimeReport(std::string title,std::ostream &os=std::cerr,bool run=true)
+      : Timer(run), _title(title), _os(os){}
     ///Destructor that prints the ellapsed time
     ~TimeReport()
+    {
+      if(_active) _os << _title << *this << std::endl;
+    }
+    ///Retrieve the activity status
+    ///\e
+    ///
+    bool active() const { return _active; }
+    ///Set the activity status
+    /// This function set whether the time report should actually be printed
+    /// on destruction.
+    void active(bool a) { _active=a; }
+      _os << _title << *this << std::endl;
+    }
   };

lemon/unionfind.h

r1270	r956
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2010
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

test/CMakeLists.txt

-                      r1264
+                      r1206
   max_cardinality_search_test
   max_clique_test
-  max_flow_test
   min_cost_arborescence_test
   min_cost_flow_test
 …
   path_test
   planarity_test
+  preflow_test
   radix_sort_test
   random_test
 …
   ENDIF()
   IF(LEMON_HAVE_CPLEX)
     SET(LP_TEST_LIBS ${LP_TEST_LIBS} ${ILOG_LIBRARIES})
+    SET(LP_TEST_LIBS ${LP_TEST_LIBS} ${CPLEX_LIBRARIES})
   ENDIF()
   IF(LEMON_HAVE_CLP)
     SET(LP_TEST_LIBS ${LP_TEST_LIBS} ${COIN_CLP_LIBRARIES})
-  ENDIF()
-  IF(LEMON_HAVE_SOPLEX)
-    SET(LP_TEST_LIBS ${LP_TEST_LIBS} ${SOPLEX_LIBRARIES})
   ENDIF()
 …
     GET_FILENAME_COMPONENT(TARGET_PATH ${TARGET_LOC} PATH)
     ADD_CUSTOM_COMMAND(TARGET lp_test POST_BUILD
       COMMAND ${CMAKE_COMMAND} -E copy ${ILOG_CPLEX_DLL} ${TARGET_PATH}
+      COMMAND ${CMAKE_COMMAND} -E copy ${CPLEX_BIN_DIR}/cplex.dll ${TARGET_PATH}
+    )
   ENDIF()
 …
   ENDIF()
   IF(LEMON_HAVE_CPLEX)
     SET(MIP_TEST_LIBS ${MIP_TEST_LIBS} ${ILOG_LIBRARIES})
+    SET(MIP_TEST_LIBS ${MIP_TEST_LIBS} ${CPLEX_LIBRARIES})
   ENDIF()
   IF(LEMON_HAVE_CBC)
 …
     GET_FILENAME_COMPONENT(TARGET_PATH ${TARGET_LOC} PATH)
     ADD_CUSTOM_COMMAND(TARGET mip_test POST_BUILD
       COMMAND ${CMAKE_COMMAND} -E copy ${ILOG_CPLEX_DLL} ${TARGET_PATH}
+      COMMAND ${CMAKE_COMMAND} -E copy ${CPLEX_BIN_DIR}/cplex.dll ${TARGET_PATH}
+    )
   ENDIF()

test/adaptors_test.cc

-                      r1270
+                      r1159
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2009
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   Digraph::Arc a2 = digraph.addArc(n1, n3);
   Digraph::Arc a3 = digraph.addArc(n2, n3);
   ::lemon::ignore_unused_variable_warning(a3);
+  ignore_unused_variable_warning(a3);
   // Check the adaptor
 …
   Adaptor::Arc a7 = adaptor.addArc(n1, n4);
   Adaptor::Arc a8 = adaptor.addArc(n1, n2);
   ::lemon::ignore_unused_variable_warning(a6,a7,a8);
+  ignore_unused_variable_warning(a6,a7,a8);
   adaptor.erase(a1);
 …
   Digraph::Arc a2 = digraph.addArc(n1, n3);
   Digraph::Arc a3 = digraph.addArc(n2, n3);
   ::lemon::ignore_unused_variable_warning(a1,a2,a3);
+  ignore_unused_variable_warning(a1,a2,a3);
   checkGraphNodeList(adaptor, 6);

test/arc_look_up_test.cc

-                      r1270
+                      r1149
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2009
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   std::istringstream lgfs(lgf);
   DigraphReader<ListDigraph>(graph, lgfs).run();
   AllArcLookUp<ListDigraph> lookup(graph);
   int numArcs = countArcs(graph);
   int arcCnt = 0;
   for(ListDigraph::NodeIt n1(graph); n1 != INVALID; ++n1)
     for(ListDigraph::NodeIt n2(graph); n2 != INVALID; ++n2)
       for(ListDigraph::Arc a = lookup(n1, n2); a != INVALID;
           a = lookup(n1, n2, a))
         ++arcCnt;
+          a = lookup(n1, n2, a))
+        ++arcCnt;
   check(arcCnt==numArcs, "Wrong total number of arcs");

test/bellman_ford_test.cc

-                      r1270
+                      r1174
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   Arc e;
   Value l;
   ::lemon::ignore_unused_variable_warning(l);
+  ignore_unused_variable_warning(l);
   int k=3;
   bool b;
   ::lemon::ignore_unused_variable_warning(b);
+  ignore_unused_variable_warning(b);
   BF::DistMap d(gr);
   BF::PredMap p(gr);
 …
   Digraph g;
   bool b;
   ::lemon::ignore_unused_variable_warning(b);
+  ignore_unused_variable_warning(b);
   bellmanFord(g,LengthMap()).run(Node());

test/bfs_test.cc

-                      r1270
+                      r1173
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   Arc e;
   int l, i;
   ::lemon::ignore_unused_variable_warning(l,i);
+  ignore_unused_variable_warning(l,i);
   bool b;
   BType::DistMap d(G);
 …
   Digraph g;
   bool b;
   ::lemon::ignore_unused_variable_warning(b);
+  ignore_unused_variable_warning(b);
   bfs(g).run(Node());

test/bpgraph_test.cc

-                      r1292
+                      r1194
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
     e2 = G.addEdge(bn1, rn1),
     e3 = G.addEdge(rn1, bn2);
-  ::lemon::ignore_unused_variable_warning(e2,e3);
   checkGraphNodeList(G, 3);
 …
   BpGraph G;
   RedNode
     n1 = G.addRedNode(), n4 = G.addRedNode();
+    n1 = G.addRedNode(), n4 = G.addRedNode();
   BlueNode
     n2 = G.addBlueNode(), n3 = G.addBlueNode();
 …
     e1 = G.addEdge(n1, n2), e2 = G.addEdge(n1, n3),
     e3 = G.addEdge(n4, n2), e4 = G.addEdge(n4, n3);
-  ::lemon::ignore_unused_variable_warning(e1,e3,e4);
   // Check edge deletion
 …
   BpGraph G;
   RedNode
     n1 = G.addRedNode(), n4 = G.addRedNode();
+    n1 = G.addRedNode(), n4 = G.addRedNode();
   BlueNode
     n2 = G.addBlueNode(), n3 = G.addBlueNode();
 …
     e1 = G.addEdge(n1, n2), e2 = G.addEdge(n1, n3),
     e3 = G.addEdge(n4, n2), e4 = G.addEdge(n4, n3);
-  ::lemon::ignore_unused_variable_warning(e1,e3,e4);
   G.changeRed(e2, n4);
 …
     n2 = G.addBlueNode(),
     n3 = G.addBlueNode();
   Edge
+  Edge
     e1 = G.addEdge(n1, n2),
     e2 = G.addEdge(n1, n3);
-  ::lemon::ignore_unused_variable_warning(e1,e2);
   checkGraphNodeList(G, 3);
 …
     e1 = g.addEdge(n1, n2),
     e2 = g.addEdge(n1, n3);
-  ::lemon::ignore_unused_variable_warning(e2);
   check(g.valid(n1), "Wrong validity check");

test/circulation_test.cc

-                      r1270
+                      r1173
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   VType v;
   bool b;
   ::lemon::ignore_unused_variable_warning(v,b);
+  ignore_unused_variable_warning(v,b);
   typedef Circulation<Digraph, CapMap, CapMap, SupplyMap>
 …
   const_circ_test.barrierMap(bar);
   ::lemon::ignore_unused_variable_warning(fm);
+  ignore_unused_variable_warning(fm);
+}

test/connectivity_test.cc

-                      r1270
+                      r1159
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
     Graph g(d);
     Digraph::Node n = d.addNode();
     ::lemon::ignore_unused_variable_warning(n);
+    ignore_unused_variable_warning(n);
     check(stronglyConnected(d), "This digraph is strongly connected");
 …
     check(simpleGraph(g), "This graph is simple.");
+  }
+  {
-    ListGraph g;
-    ListGraph::NodeMap<bool> map(g);
-    ListGraph::Node n1 = g.addNode();
-    ListGraph::Node n2 = g.addNode();
-    ListGraph::Edge e1 = g.addEdge(n1, n2);
-    ::lemon::ignore_unused_variable_warning(e1);
-    check(biNodeConnected(g), "Graph is bi-node-connected");
-    ListGraph::Node n3 = g.addNode();
-    ::lemon::ignore_unused_variable_warning(n3);
-    check(!biNodeConnected(g), "Graph is not bi-node-connected");
+  }
+  {
 …
     Digraph::Node watch = d.addNode();
     Digraph::Node pants = d.addNode();
     ::lemon::ignore_unused_variable_warning(watch);
+    ignore_unused_variable_warning(watch);
     d.addArc(socks, shoe);

test/dfs_test.cc

-                      r1270
+                      r1176
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   int l, i;
   bool b;
   ::lemon::ignore_unused_variable_warning(l,i,b);
+  ignore_unused_variable_warning(l,i,b);
   DType::DistMap d(G);
 …
   Digraph g;
   bool b;
   ::lemon::ignore_unused_variable_warning(b);
+  ignore_unused_variable_warning(b);
   dfs(g).run(Node());
 …
   check(dfs.run(s1,t1) && dfs.reached(t1),"Node 3 is reachable from Node 6.");
+  }
+  {
     NullMap<Node,Arc> myPredMap;

test/digraph_test.cc

-                      r1270
+                      r1160
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
       a3 = G.addArc(n2, n3),
       a4 = G.addArc(n2, n3);
   ::lemon::ignore_unused_variable_warning(a2,a3,a4);
+  ignore_unused_variable_warning(a2,a3,a4);
   checkGraphNodeList(G, 3);
 …
   Arc a1 = G.addArc(n1, n2), a2 = G.addArc(n2, n1),
       a3 = G.addArc(n2, n3), a4 = G.addArc(n2, n3);
   ::lemon::ignore_unused_variable_warning(a1,a2,a3,a4);
+  ignore_unused_variable_warning(a1,a2,a3,a4);
   Node n4 = G.split(n2);
 …
       a3 = G.addArc(n4, n3), a4 = G.addArc(n4, n3),
       a5 = G.addArc(n2, n4);
   ::lemon::ignore_unused_variable_warning(a1,a2,a3,a5);
+  ignore_unused_variable_warning(a1,a2,a3,a5);
   checkGraphNodeList(G, 4);
 …
       a3 = G.addArc(n4, n3), a4 = G.addArc(n3, n1),
       a5 = G.addArc(n2, n4);
   ::lemon::ignore_unused_variable_warning(a2,a3,a4,a5);
+  ignore_unused_variable_warning(a2,a3,a4,a5);
   // Check arc deletion
 …
   Arc a1 = G.addArc(n1, n2), a2 = G.addArc(n2, n1),
       a3 = G.addArc(n2, n3), a4 = G.addArc(n2, n3);
   ::lemon::ignore_unused_variable_warning(a1,a2,a3,a4);
+  ignore_unused_variable_warning(a1,a2,a3,a4);
   typename Digraph::Snapshot snapshot(G);
 …
     e1 = g.addArc(n1, n2),
     e2 = g.addArc(n2, n3);
   ::lemon::ignore_unused_variable_warning(e2);
+  ignore_unused_variable_warning(e2);
   check(g.valid(n1), "Wrong validity check");
 …
     a3 = g.addArc(n2, n3),
     a4 = g.addArc(n2, n3);
   ::lemon::ignore_unused_variable_warning(a2,a3,a4);
+  ignore_unused_variable_warning(a2,a3,a4);
   digraphCopy(g, G).nodeRef(nref).run();

test/dijkstra_test.cc

-                      r1270
+                      r1173
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   int i;
   bool b;
   ::lemon::ignore_unused_variable_warning(l,i,b);
+  ignore_unused_variable_warning(l,i,b);
   DType::DistMap d(G);
 …
   Digraph g;
   bool b;
   ::lemon::ignore_unused_variable_warning(b);
+  ignore_unused_variable_warning(b);
   dijkstra(g,LengthMap()).run(Node());

test/edge_set_test.cc

-                      r1270
+                      r1159
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   Digraph::Arc ga1 = digraph.addArc(n1, n2);
   ::lemon::ignore_unused_variable_warning(ga1);
+  ignore_unused_variable_warning(ga1);
   ArcSet arc_set(digraph);
   Digraph::Arc ga2 = digraph.addArc(n2, n1);
   ::lemon::ignore_unused_variable_warning(ga2);
+  ignore_unused_variable_warning(ga2);
   checkGraphNodeList(arc_set, 2);
 …
     a3 = arc_set.addArc(n2, n3),
     a4 = arc_set.addArc(n2, n3);
   ::lemon::ignore_unused_variable_warning(a2,a3,a4);
+  ignore_unused_variable_warning(a2,a3,a4);
   checkGraphNodeList(arc_set, 3);
 …
   Digraph::Arc ga1 = digraph.addArc(n1, n2);
   ::lemon::ignore_unused_variable_warning(ga1);
+  ignore_unused_variable_warning(ga1);
   ArcSet arc_set(digraph);
   Digraph::Arc ga2 = digraph.addArc(n2, n1);
   ::lemon::ignore_unused_variable_warning(ga2);
+  ignore_unused_variable_warning(ga2);
   checkGraphNodeList(arc_set, 2);
 …
     a3 = arc_set.addArc(n2, n3),
     a4 = arc_set.addArc(n2, n3);
   ::lemon::ignore_unused_variable_warning(a2,a3,a4);
+  ignore_unused_variable_warning(a2,a3,a4);
   checkGraphNodeList(arc_set, 3);
 …
   Digraph::Arc ga1 = digraph.addArc(n1, n2);
   ::lemon::ignore_unused_variable_warning(ga1);
+  ignore_unused_variable_warning(ga1);
   EdgeSet edge_set(digraph);
   Digraph::Arc ga2 = digraph.addArc(n2, n1);
   ::lemon::ignore_unused_variable_warning(ga2);
+  ignore_unused_variable_warning(ga2);
   checkGraphNodeList(edge_set, 2);
 …
     e3 = edge_set.addEdge(n2, n3),
     e4 = edge_set.addEdge(n2, n3);
   ::lemon::ignore_unused_variable_warning(e2,e3,e4);
+  ignore_unused_variable_warning(e2,e3,e4);
   checkGraphNodeList(edge_set, 3);
 …
   Digraph::Arc ga1 = digraph.addArc(n1, n2);
   ::lemon::ignore_unused_variable_warning(ga1);
+  ignore_unused_variable_warning(ga1);
   EdgeSet edge_set(digraph);
   Digraph::Arc ga2 = digraph.addArc(n2, n1);
   ::lemon::ignore_unused_variable_warning(ga2);
+  ignore_unused_variable_warning(ga2);
   checkGraphNodeList(edge_set, 2);
 …
     e3 = edge_set.addEdge(n2, n3),
     e4 = edge_set.addEdge(n2, n3);
   ::lemon::ignore_unused_variable_warning(e2,e3,e4);
+  ignore_unused_variable_warning(e2,e3,e4);
   checkGraphNodeList(edge_set, 3);

test/euler_test.cc

-                      r1270
+                      r1159
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
     Graph g(d);
     Digraph::Node n = d.addNode();
     ::lemon::ignore_unused_variable_warning(n);
+    ignore_unused_variable_warning(n);
     checkDiEulerIt(d);
     checkDiEulerIt(g);
 …
     Digraph::Node n4 = d.addNode();
     Digraph::Node n5 = d.addNode();
     ::lemon::ignore_unused_variable_warning(n0,n4,n5);
+    ignore_unused_variable_warning(n0,n4,n5);
     d.addArc(n1, n2);

test/fractional_matching_test.cc

-                      r1270
+                      r1160
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
       pv += weight[mwfm.matching(n)];
       SmartGraph::Node o = graph.target(mwfm.matching(n));
       ::lemon::ignore_unused_variable_warning(o);
+      ignore_unused_variable_warning(o);
     } else {
       check(mwfm.nodeValue(n) == 0, "Invalid matching");
 …
     pv += weight[mwpfm.matching(n)];
     SmartGraph::Node o = graph.target(mwpfm.matching(n));
     ::lemon::ignore_unused_variable_warning(o);
+    ignore_unused_variable_warning(o);
+  }

test/gomory_hu_test.cc

-                      r1270
+                      r1173
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   Value v;
   int d;
   ::lemon::ignore_unused_variable_warning(v,d);
+  ignore_unused_variable_warning(v,d);
   GomoryHu<Graph, CapMap> gh_test(g, cap);

test/graph_copy_test.cc

-                      r1270
+                      r1194
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2009
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
+    }
+  }
   // Test digraph copy
   GR to;
 …
     nodeCrossRef(ncr).arcCrossRef(ecr).
     node(fn, tn).arc(fa, ta).run();
   check(countNodes(from) == countNodes(to), "Wrong copy.");
   check(countArcs(from) == countArcs(to), "Wrong copy.");
 …
   // Test repeated copy
   digraphCopy(from, to).run();
   check(countNodes(from) == countNodes(to), "Wrong copy.");
   check(countArcs(from) == countArcs(to), "Wrong copy.");
 …
   // Test repeated copy
   graphCopy(from, to).run();
   check(countNodes(from) == countNodes(to), "Wrong copy.");
   check(countEdges(from) == countEdges(to), "Wrong copy.");
 …
   // Test repeated copy
   bpGraphCopy(from, to).run();
   check(countNodes(from) == countNodes(to), "Wrong copy.");
   check(countRedNodes(from) == countRedNodes(to), "Wrong copy.");

test/graph_test.cc

-                      r1270
+                      r1159
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   Edge e2 = G.addEdge(n2, n1),
        e3 = G.addEdge(n2, n3);
   ::lemon::ignore_unused_variable_warning(e2,e3);
+  ignore_unused_variable_warning(e2,e3);
   checkGraphNodeList(G, 3);
 …
        e3 = G.addEdge(n2, n3), e4 = G.addEdge(n1, n4),
        e5 = G.addEdge(n4, n3);
   ::lemon::ignore_unused_variable_warning(e1,e3,e4,e5);
+  ignore_unused_variable_warning(e1,e3,e4,e5);
   checkGraphNodeList(G, 4);
 …
        e3 = G.addEdge(n2, n3), e4 = G.addEdge(n1, n4),
        e5 = G.addEdge(n4, n3);
   ::lemon::ignore_unused_variable_warning(e1,e3,e4,e5);
+  ignore_unused_variable_warning(e1,e3,e4,e5);
   // Check edge deletion
 …
   Edge e1 = G.addEdge(n1, n2), e2 = G.addEdge(n2, n1),
        e3 = G.addEdge(n2, n3);
   ::lemon::ignore_unused_variable_warning(e1,e2,e3);
+  ignore_unused_variable_warning(e1,e2,e3);
   checkGraphNodeList(G, 3);
 …
     e1 = g.addEdge(n1, n2),
     e2 = g.addEdge(n2, n3);
   ::lemon::ignore_unused_variable_warning(e2);
+  ignore_unused_variable_warning(e2);
   check(g.valid(n1), "Wrong validity check");
 …
   Node n = G.nodeFromId(dim);
   ::lemon::ignore_unused_variable_warning(n);
+  ignore_unused_variable_warning(n);
   for (NodeIt n(G); n != INVALID; ++n) {

test/graph_test.h

r1270	r1195
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2009
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

test/hao_orlin_test.cc

-                      r1270
+                      r1173
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   CutMap cut;
   Value v;
   ::lemon::ignore_unused_variable_warning(v);
+  ignore_unused_variable_warning(v);
   HaoOrlin<Digraph, CapMap> ho_test(g, cap);

test/heap_test.cc

r1270	r1065
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2009
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

test/lgf_reader_writer_test.cc

-                      r1270
+                      r1198
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   writer.arcMap("arc_map1", arc_map);
   writer.arcMap("arc_map2", arc_map, WriterConverter());
   writer.node("node", n2);
+  writer.node("node", n2);
   writer.edge("edge", e1);
   writer.arc("arc", graph.direct(e1, false));
 …
   writer.arcMap("arc_map2", arc_map, WriterConverter());
   writer.node("node", n);
   writer.redNode("red_node", rn1);
+  writer.redNode("red_node", rn1);
   writer.blueNode("blue_node", bn2);
   writer.edge("edge", e1);

test/lgf_test.cc

-                      r1270
+                      r1087
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2011
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
 int main()
+int main()
+{
+  {
     ListDigraph d;
+    ListDigraph d;
     ListDigraph::Node s,t;
     ListDigraph::ArcMap<int> label(d);
 …
+  {
     ListDigraph d;
+    ListDigraph d;
     std::istringstream input(test_lgf_nomap);
     digraphReader(d, input).
 …
+  {
     ListDigraph d;
+    ListDigraph d;
     std::istringstream input(test_lgf_bad1);
     bool ok=false;
 …
         run();
+    }
     catch (FormatError&)
+    catch (FormatError&)
+      {
         ok = true;
 …
+  {
     ListDigraph d;
+    ListDigraph d;
     std::istringstream input(test_lgf_bad2);
     bool ok=false;

test/lp_test.cc

-                      r1270
+                      r1140
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2009
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
       c = c <= 4;
       LP::Constr c2;
-#if ( __GNUC__ == 4 ) && ( __GNUC_MINOR__ == 3 )
-      c2 = ( -3 <= v ) <= 4;
-#else
       c2 = -3 <= v <= 4;
-#endif
+    }
 …
+  {
     LP::DualExpr e,f,g;
+    LP::Row p1 = INVALID, p2 = INVALID;
+    LP::Row p1 = INVALID, p2 = INVALID, p3 = INVALID,
+      p4 = INVALID, p5 = INVALID;
     e[p1]=2;

test/maps_test.cc

-                      r1270
+                      r1159
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
     NullMap<A,B> map1;
     NullMap<A,B> map2 = map1;
     ::lemon::ignore_unused_variable_warning(map2);
+    ignore_unused_variable_warning(map2);
     map1 = nullMap<A,B>();
+  }
 …
     ConstMap<A,B> map2 = B();
     ConstMap<A,B> map3 = map1;
     ::lemon::ignore_unused_variable_warning(map2,map3);
+    ignore_unused_variable_warning(map2,map3);
     map1 = constMap<A>(B());
 …
     ConstMap<A,C> map4(C(1));
     ConstMap<A,C> map5 = map4;
     ::lemon::ignore_unused_variable_warning(map5);
+    ignore_unused_variable_warning(map5);
     map4 = constMap<A>(C(2));
 …
     IdentityMap<A> map1;
     IdentityMap<A> map2 = map1;
     ::lemon::ignore_unused_variable_warning(map2);
+    ignore_unused_variable_warning(map2);
     map1 = identityMap<A>();
 …
     checkConcept<ReadMap<B,double>, CompMap>();
     CompMap map1 = CompMap(DoubleMap(),ReadMap<B,A>());
     ::lemon::ignore_unused_variable_warning(map1);
+    ignore_unused_variable_warning(map1);
     CompMap map2 = composeMap(DoubleMap(), ReadMap<B,A>());
     ::lemon::ignore_unused_variable_warning(map2);
+    ignore_unused_variable_warning(map2);
     SparseMap<double, bool> m1(false); m1[3.14] = true;
 …
     checkConcept<ReadMap<A,double>, CombMap>();
     CombMap map1 = CombMap(DoubleMap(), DoubleMap());
     ::lemon::ignore_unused_variable_warning(map1);
+    ignore_unused_variable_warning(map1);
     CombMap map2 = combineMap(DoubleMap(), DoubleMap(), std::plus<double>());
     ::lemon::ignore_unused_variable_warning(map2);
+    ignore_unused_variable_warning(map2);
     check(combineMap(constMap<B,int,2>(), identityMap<B>(), &binc)[B()] == 3,
 …
     FunctorToMap<F> map1;
     FunctorToMap<F> map2 = FunctorToMap<F>(F());
     ::lemon::ignore_unused_variable_warning(map2);
+    ignore_unused_variable_warning(map2);
     B b = functorToMap(F())[A()];
     ::lemon::ignore_unused_variable_warning(b);
+    ignore_unused_variable_warning(b);
     checkConcept<ReadMap<A,B>, MapToFunctor<ReadMap<A,B> > >();
     MapToFunctor<ReadMap<A,B> > map =
       MapToFunctor<ReadMap<A,B> >(ReadMap<A,B>());
     ::lemon::ignore_unused_variable_warning(map);
+    ignore_unused_variable_warning(map);
     check(functorToMap(&func)[A()] == 3,
 …
       ConvertMap<ReadMap<double, int>, double> >();
     ConvertMap<RangeMap<bool>, int> map1(rangeMap(1, true));
     ::lemon::ignore_unused_variable_warning(map1);
+    ignore_unused_variable_warning(map1);
     ConvertMap<RangeMap<bool>, int> map2 = convertMap<int>(rangeMap(2, false));
     ::lemon::ignore_unused_variable_warning(map2);
+    ignore_unused_variable_warning(map2);
+  }
 …
     typedef Orienter<Graph, const ConstMap<Edge, bool> > Digraph;
+    ConstMap<Edge, bool> true_edge_map(true);
+    Digraph dgr(gr, true_edge_map);
+    Digraph dgr(gr, constMap<Edge, bool>(true));
     OutDegMap<Digraph> odm(dgr);
     InDegMap<Digraph> idm(dgr);

test/matching_test.cc

-                      r1270
+                      r1173
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   MaxMatching<Graph>::Status stat =
     const_mat_test.status(n);
   ::lemon::ignore_unused_variable_warning(stat);
+  ignore_unused_variable_warning(stat);
   const MaxMatching<Graph>::StatusMap& smap =
     const_mat_test.statusMap();

test/max_cardinality_search_test.cc

-                      r1270
+                      r1088
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   ProcMap proc;
   HeapCrossRef crossref(g);
   typedef MaxCardinalitySearch<Digraph,CapMap>
     ::SetCapacityMap<CapMap>
 …
   MaxCardType::Heap& heap = const_cast<MaxCardType::Heap&>(heap_const);
   maxcard.heap(heap,crossref);
   maxcard.capacityMap(cap).cardinalityMap(card).processedMap(proc);

test/max_clique_test.cc

-                      r1270
+                      r1022
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   "5 7    14\n"
   "6 7    15\n";
 // Check with general graphs
 …
   typedef GrossoLocatelliPullanMc<GR> McAlg;
   typedef McAlg::CliqueNodeIt CliqueIt;
   // Basic tests
+  {
 …
     check(static_cast<GR::Node>(it1) == u && ++it1 == INVALID,
           "Wrong CliqueNodeIt");
     GR::Node v = g.addNode();
     check(mc.run(rule) == McAlg::ITERATION_LIMIT, "Wrong termination cause");
 …
       .nodeMap("max_clique", max_clique)
       .run();
     McAlg mc(g);
     mc.iterationLimit(50);
 …
   typedef GrossoLocatelliPullanMc<FullGraph> McAlg;
   typedef McAlg::CliqueNodeIt CliqueIt;
   for (int size = 0; size <= 40; size = size * 3 + 1) {
     GR g(size);
 …
   GridGraph::NodeMap<char> map(g);
   GrossoLocatelliPullanMc<GridGraph> mc(g);
   mc.iterationLimit(100);
   check(mc.run(rule) == mc.ITERATION_LIMIT, "Wrong termination cause");
 …
   checkMaxCliqueFullGraph(GrossoLocatelliPullanMc<FullGraph>::DEGREE_BASED);
   checkMaxCliqueFullGraph(GrossoLocatelliPullanMc<FullGraph>::PENALTY_BASED);
   checkMaxCliqueGridGraph(GrossoLocatelliPullanMc<GridGraph>::RANDOM);
   checkMaxCliqueGridGraph(GrossoLocatelliPullanMc<GridGraph>::DEGREE_BASED);
   checkMaxCliqueGridGraph(GrossoLocatelliPullanMc<GridGraph>::PENALTY_BASED);
   return 0;
+}

test/min_cost_arborescence_test.cc

-                      r1270
+                      r1173
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   VType c;
   bool b;
   ::lemon::ignore_unused_variable_warning(c,b);
+  ignore_unused_variable_warning(c,b);
   int i;
   CostMap cost;
 …
   c = const_mcarb_test.dualValue(i);
   ::lemon::ignore_unused_variable_warning(am);
   ::lemon::ignore_unused_variable_warning(pm);
+  ignore_unused_variable_warning(am);
+  ignore_unused_variable_warning(pm);
+}

test/min_cost_flow_test.cc

r1270	r956
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2010
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).

test/min_mean_cycle_test.cc

-                      r1270
+                      r1178
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
     checkMmcAlg<HowardMmc<GR, IntArcMap> >(gr, l3, c3,  0, 1);
     checkMmcAlg<HowardMmc<GR, IntArcMap> >(gr, l4, c4, -1, 1);
     // Howard with iteration limit
     HowardMmc<GR, IntArcMap> mmc(gr, l1);

test/nagamochi_ibaraki_test.cc

-                      r1270
+                      r1177
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   Value v;
   bool b;
   ::lemon::ignore_unused_variable_warning(v,b);
+  ignore_unused_variable_warning(v,b);
   NagamochiIbaraki<Graph, CapMap> ni_test(g, cap);

test/path_test.cc

-                      r1270
+                      r1144
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2009
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
 #include <lemon/concepts/path.h>
 #include <lemon/concepts/digraph.h>
-#include <lemon/concept_check.h>
 #include <lemon/path.h>
 …
 using namespace lemon;
+template <typename GR>
+void checkConcepts() {
+  checkConcept<concepts::Path<GR>, concepts::Path<GR> >();
+  checkConcept<concepts::Path<GR>, Path<GR> >();
+  checkConcept<concepts::Path<GR>, SimplePath<GR> >();
+  checkConcept<concepts::Path<GR>, StaticPath<GR> >();
+  checkConcept<concepts::Path<GR>, ListPath<GR> >();
+}
+// Conecpt checking for path structures
+void checkPathConcepts() {
+  checkConcepts<concepts::Digraph>();
+  checkConcepts<ListDigraph>();
+void check_concepts() {
+  checkConcept<concepts::Path<ListDigraph>, concepts::Path<ListDigraph> >();
+  checkConcept<concepts::Path<ListDigraph>, Path<ListDigraph> >();
+  checkConcept<concepts::Path<ListDigraph>, SimplePath<ListDigraph> >();
+  checkConcept<concepts::Path<ListDigraph>, StaticPath<ListDigraph> >();
+  checkConcept<concepts::Path<ListDigraph>, ListPath<ListDigraph> >();
+}
 // Check if proper copy consructor is called (use valgrind for testing)
+template <typename GR, typename P1, typename P2>
+void checkCopy(typename GR::Arc a) {
+  P1 p;
+template<class _Path>
+void checkCopy()
+{
+  ListDigraph g;
+  ListDigraph::Arc a  = g.addArc(g.addNode(), g.addNode());
+  _Path p,q;
   p.addBack(a);
+  P1 q;
+  q = p;
+  P1 r(p);
+  P2 q2;
+  q2 = p;
+  P2 r2(p);
+  q=p;
+  _Path r(p);
+  StaticPath<ListDigraph> s(r);
+}
+int main() {
+  check_concepts();
+// Tests for copy constructors and assignment operators of paths
+void checkPathCopy() {
+  checkCopy<Path<ListDigraph> >();
+  checkCopy<SimplePath<ListDigraph> >();
+  checkCopy<ListPath<ListDigraph> >();
   ListDigraph g;
+  ListDigraph::Arc a = g.addArc(g.addNode(), g.addNode());
+  typedef Path<ListDigraph> Path1;
+  typedef SimplePath<ListDigraph> Path2;
+  typedef ListPath<ListDigraph> Path3;
+  typedef StaticPath<ListDigraph> Path4;
+  checkCopy<ListDigraph, Path1, Path2>(a);
+  checkCopy<ListDigraph, Path1, Path3>(a);
+  checkCopy<ListDigraph, Path1, Path4>(a);
+  checkCopy<ListDigraph, Path2, Path1>(a);
+  checkCopy<ListDigraph, Path2, Path3>(a);
+  checkCopy<ListDigraph, Path2, Path4>(a);
+  checkCopy<ListDigraph, Path3, Path1>(a);
+  checkCopy<ListDigraph, Path3, Path2>(a);
+  checkCopy<ListDigraph, Path3, Path4>(a);
+}
+// Class for testing path functions
+class CheckPathFunctions {
+  typedef ListDigraph GR;
+  DIGRAPH_TYPEDEFS(GR);
+  GR gr;
+  const GR& cgr;
+  Node n1, n2, n3, n4;
+  Node tmp_n;
+  Arc a1, a2, a3, a4;
+  Arc tmp_a;
+public:
+  CheckPathFunctions() : cgr(gr) {
+    n1 = gr.addNode();
+    n2 = gr.addNode();
+    n3 = gr.addNode();
+    n4 = gr.addNode();
+    a1 = gr.addArc(n1, n2);
+    a2 = gr.addArc(n2, n3);
+    a3 = gr.addArc(n3, n4);
+    a4 = gr.addArc(n4, n1);
+  }
+  void run() {
+    checkBackAndFrontInsertablePath<Path<GR> >();
+    checkBackAndFrontInsertablePath<ListPath<GR> >();
+    checkBackInsertablePath<SimplePath<GR> >();
+    checkListPathSplitAndSplice();
+  }
+private:
+  template <typename P>
+  void checkBackInsertablePath() {
+    // Create and check empty path
+    P p;
+    const P& cp = p;
+    check(cp.empty(), "The path is not empty");
+    check(cp.length() == 0, "The path is not empty");
+//    check(cp.front() == INVALID, "Wrong front()");
+//    check(cp.back() == INVALID, "Wrong back()");
+    typename P::ArcIt ai(cp);
+    check(ai == INVALID, "Wrong ArcIt");
+    check(pathSource(cgr, cp) == INVALID, "Wrong pathSource()");
+    check(pathTarget(cgr, cp) == INVALID, "Wrong pathTarget()");
+    check(checkPath(cgr, cp), "Wrong checkPath()");
+    PathNodeIt<P> ni(cgr, cp);
+    check(ni == INVALID, "Wrong PathNodeIt");
+    // Check single-arc path
+    p.addBack(a1);
+    check(!cp.empty(), "Wrong empty()");
+    check(cp.length() == 1, "Wrong length");
+    check(cp.front() == a1, "Wrong front()");
+    check(cp.back() == a1, "Wrong back()");
+    check(cp.nth(0) == a1, "Wrong nth()");
+    ai = cp.nthIt(0);
+    check((tmp_a = ai) == a1, "Wrong nthIt()");
+    check(++ai == INVALID, "Wrong nthIt()");
+    typename P::ArcIt ai2(cp);
+    check((tmp_a = ai2) == a1, "Wrong ArcIt");
+    check(++ai2 == INVALID, "Wrong ArcIt");
+    check(pathSource(cgr, cp) == n1, "Wrong pathSource()");
+    check(pathTarget(cgr, cp) == n2, "Wrong pathTarget()");
+    check(checkPath(cgr, cp), "Wrong checkPath()");
+    PathNodeIt<P> ni2(cgr, cp);
+    check((tmp_n = ni2) == n1, "Wrong PathNodeIt");
+    check((tmp_n = ++ni2) == n2, "Wrong PathNodeIt");
+    check(++ni2 == INVALID, "Wrong PathNodeIt");
+    // Check adding more arcs
+    p.addBack(a2);
+    p.addBack(a3);
+    check(!cp.empty(), "Wrong empty()");
+    check(cp.length() == 3, "Wrong length");
+    check(cp.front() == a1, "Wrong front()");
+    check(cp.back() == a3, "Wrong back()");
+    check(cp.nth(0) == a1, "Wrong nth()");
+    check(cp.nth(1) == a2, "Wrong nth()");
+    check(cp.nth(2) == a3, "Wrong nth()");
+    typename P::ArcIt ai3(cp);
+    check((tmp_a = ai3) == a1, "Wrong ArcIt");
+    check((tmp_a = ++ai3) == a2, "Wrong nthIt()");
+    check((tmp_a = ++ai3) == a3, "Wrong nthIt()");
+    check(++ai3 == INVALID, "Wrong nthIt()");
+    ai = cp.nthIt(0);
+    check((tmp_a = ai) == a1, "Wrong nthIt()");
+    check((tmp_a = ++ai) == a2, "Wrong nthIt()");
+    ai = cp.nthIt(2);
+    check((tmp_a = ai) == a3, "Wrong nthIt()");
+    check(++ai == INVALID, "Wrong nthIt()");
+    check(pathSource(cgr, cp) == n1, "Wrong pathSource()");
+    check(pathTarget(cgr, cp) == n4, "Wrong pathTarget()");
+    check(checkPath(cgr, cp), "Wrong checkPath()");
+    PathNodeIt<P> ni3(cgr, cp);
+    check((tmp_n = ni3) == n1, "Wrong PathNodeIt");
+    check((tmp_n = ++ni3) == n2, "Wrong PathNodeIt");
+    check((tmp_n = ++ni3) == n3, "Wrong PathNodeIt");
+    check((tmp_n = ++ni3) == n4, "Wrong PathNodeIt");
+    check(++ni3 == INVALID, "Wrong PathNodeIt");
+    // Check arc removal and addition
+    p.eraseBack();
+    p.eraseBack();
+    p.addBack(a2);
+    check(!cp.empty(), "Wrong empty()");
+    check(cp.length() == 2, "Wrong length");
+    check(cp.front() == a1, "Wrong front()");
+    check(cp.back() == a2, "Wrong back()");
+    check(pathSource(cgr, cp) == n1, "Wrong pathSource()");
+    check(pathTarget(cgr, cp) == n3, "Wrong pathTarget()");
+    check(checkPath(cgr, cp), "Wrong checkPath()");
+    // Check clear()
+    p.clear();
+    check(cp.empty(), "The path is not empty");
+    check(cp.length() == 0, "The path is not empty");
+    // Check inconsistent path
+    p.addBack(a4);
+    p.addBack(a2);
+    p.addBack(a1);
+    check(!cp.empty(), "Wrong empty()");
+    check(cp.length() == 3, "Wrong length");
+    check(cp.front() == a4, "Wrong front()");
+    check(cp.back() == a1, "Wrong back()");
+    check(pathSource(cgr, cp) == n4, "Wrong pathSource()");
+    check(pathTarget(cgr, cp) == n2, "Wrong pathTarget()");
+    check(!checkPath(cgr, cp), "Wrong checkPath()");
+  }
+  template <typename P>
+  void checkBackAndFrontInsertablePath() {
+    // Include back insertable test cases
+    checkBackInsertablePath<P>();
+    // Check front and back insertion
+    P p;
+    const P& cp = p;
+    p.addFront(a4);
+    p.addBack(a1);
+    p.addFront(a3);
+    check(!cp.empty(), "Wrong empty()");
+    check(cp.length() == 3, "Wrong length");
+    check(cp.front() == a3, "Wrong front()");
+    check(cp.back() == a1, "Wrong back()");
+    check(cp.nth(0) == a3, "Wrong nth()");
+    check(cp.nth(1) == a4, "Wrong nth()");
+    check(cp.nth(2) == a1, "Wrong nth()");
+    typename P::ArcIt ai(cp);
+    check((tmp_a = ai) == a3, "Wrong ArcIt");
+    check((tmp_a = ++ai) == a4, "Wrong nthIt()");
+    check((tmp_a = ++ai) == a1, "Wrong nthIt()");
+    check(++ai == INVALID, "Wrong nthIt()");
+    ai = cp.nthIt(0);
+    check((tmp_a = ai) == a3, "Wrong nthIt()");
+    check((tmp_a = ++ai) == a4, "Wrong nthIt()");
+    ai = cp.nthIt(2);
+    check((tmp_a = ai) == a1, "Wrong nthIt()");
+    check(++ai == INVALID, "Wrong nthIt()");
+    check(pathSource(cgr, cp) == n3, "Wrong pathSource()");
+    check(pathTarget(cgr, cp) == n2, "Wrong pathTarget()");
+    check(checkPath(cgr, cp), "Wrong checkPath()");
+    // Check eraseFront()
+    p.eraseFront();
+    p.addBack(a2);
+    check(!cp.empty(), "Wrong empty()");
+    check(cp.length() == 3, "Wrong length");
+    check(cp.front() == a4, "Wrong front()");
+    check(cp.back() == a2, "Wrong back()");
+    check(cp.nth(0) == a4, "Wrong nth()");
+    check(cp.nth(1) == a1, "Wrong nth()");
+    check(cp.nth(2) == a2, "Wrong nth()");
+    typename P::ArcIt ai2(cp);
+    check((tmp_a = ai2) == a4, "Wrong ArcIt");
+    check((tmp_a = ++ai2) == a1, "Wrong nthIt()");
+    check((tmp_a = ++ai2) == a2, "Wrong nthIt()");
+    check(++ai2 == INVALID, "Wrong nthIt()");
+    ai = cp.nthIt(0);
+    check((tmp_a = ai) == a4, "Wrong nthIt()");
+    check((tmp_a = ++ai) == a1, "Wrong nthIt()");
+    ai = cp.nthIt(2);
+    check((tmp_a = ai) == a2, "Wrong nthIt()");
+    check(++ai == INVALID, "Wrong nthIt()");
+    check(pathSource(cgr, cp) == n4, "Wrong pathSource()");
+    check(pathTarget(cgr, cp) == n3, "Wrong pathTarget()");
+    check(checkPath(cgr, cp), "Wrong checkPath()");
+  }
+  void checkListPathSplitAndSplice() {
+    // Build a path with spliceFront() and spliceBack()
+    ListPath<GR> p1, p2, p3, p4;
+    p1.addBack(a3);
+    p1.addFront(a2);
+    p2.addBack(a1);
+    p1.spliceFront(p2);
+    p3.addFront(a4);
+    p1.spliceBack(p3);
+    check(p1.length() == 4, "Wrong length");
+    check(p1.front() == a1, "Wrong front()");
+    check(p1.back() == a4, "Wrong back()");
+    ListPath<GR>::ArcIt ai(p1);
+    check((tmp_a = ai) == a1, "Wrong ArcIt");
+    check((tmp_a = ++ai) == a2, "Wrong nthIt()");
+    check((tmp_a = ++ai) == a3, "Wrong nthIt()");
+    check((tmp_a = ++ai) == a4, "Wrong nthIt()");
+    check(++ai == INVALID, "Wrong nthIt()");
+    check(checkPath(cgr, p1), "Wrong checkPath()");
+    // Check split()
+    p1.split(p1.nthIt(2), p2);
+    check(p1.length() == 2, "Wrong length");
+    ai = p1.nthIt(0);
+    check((tmp_a = ai) == a1, "Wrong ArcIt");
+    check((tmp_a = ++ai) == a2, "Wrong nthIt()");
+    check(++ai == INVALID, "Wrong nthIt()");
+    check(checkPath(cgr, p1), "Wrong checkPath()");
+    check(p2.length() == 2, "Wrong length");
+    ai = p2.nthIt(0);
+    check((tmp_a = ai) == a3, "Wrong ArcIt");
+    check((tmp_a = ++ai) == a4, "Wrong nthIt()");
+    check(++ai == INVALID, "Wrong nthIt()");
+    check(checkPath(cgr, p2), "Wrong checkPath()");
+    // Check split() and splice()
+    p1.spliceFront(p2);
+    p1.split(p1.nthIt(2), p2);
+    p2.split(p2.nthIt(1), p3);
+    p2.spliceBack(p1);
+    p2.splice(p2.nthIt(1), p3);
+    check(p2.length() == 4, "Wrong length");
+    check(p2.front() == a1, "Wrong front()");
+    check(p2.back() == a4, "Wrong back()");
+    ai = p2.nthIt(0);
+    check((tmp_a = ai) == a1, "Wrong ArcIt");
+    check((tmp_a = ++ai) == a2, "Wrong nthIt()");
+    check((tmp_a = ++ai) == a3, "Wrong nthIt()");
+    check((tmp_a = ++ai) == a4, "Wrong nthIt()");
+    check(++ai == INVALID, "Wrong nthIt()");
+    check(checkPath(cgr, p2), "Wrong checkPath()");
+  }
+};
+int main() {
+  checkPathConcepts();
+  checkPathCopy();
+  CheckPathFunctions cpf;
+  cpf.run();
+  ListDigraph::Arc a  = g.addArc(g.addNode(), g.addNode());
+  Path<ListDigraph> p;
+  StaticPath<ListDigraph> q,r;
+  p.addBack(a);
+  q=p;
+  r=q;
+  StaticPath<ListDigraph> s(q);
   return 0;

test/radix_sort_test.cc

-                      r1270
+                      r1211
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2009
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
 template<class T>
 T listsort(typename T::iterator b, typename T::iterator e)
+{
+{
   if(b==e) return T();
   typename T::iterator bn=b;

test/suurballe_test.cc

-                      r1270
+                      r1173
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   int f;
   VType c;
   ::lemon::ignore_unused_variable_warning(f,c);
+  ignore_unused_variable_warning(f,c);
   c = const_suurb_test.totalLength();
 …
   Path<Digraph> p = const_suurb_test.path(k);
   ::lemon::ignore_unused_variable_warning(fm);
   ::lemon::ignore_unused_variable_warning(pm);
+  ignore_unused_variable_warning(fm);
+  ignore_unused_variable_warning(pm);
+}

test/time_measure_test.cc

r1270	r1157
3	3	* This file is a part of LEMON, a generic C++ optimization library.
4	4	*
5		* Copyright (C) 2003-2013
	5	* Copyright (C) 2003-2009
6	6	* Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
7	7	* (Egervary Research Group on Combinatorial Optimization, EGRES).
…	…
36	36	{
37	37	TimeStamp x(T);
38		~~::lemon::~~ignore_unused_variable_warning(x);
	38	ignore_unused_variable_warning(x);
39	39	}
40	40	}

test/tsp_test.cc

-                      r1271
+                      r1205
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
 //   check(checkMetricCost(g, constMap<Edge>(1)), "Wrong checkMetricCost()");
 //   check(!checkMetricCost(g, constMap<Edge>(-1)), "Wrong checkMetricCost()");
 //
+//
 //   FullGraph::EdgeMap<float> cost(g);
 //   for (NodeIt u(g); u != INVALID; ++u) {
 …
 bool checkTour(const FullGraph &gr, const Container &p) {
   FullGraph::NodeMap<bool> used(gr, false);
   int node_cnt = 0;
+  for (typename Container::const_iterator it = p.begin(); it != p.end(); ++it)
+    {
+      FullGraph::Node node = *it;
+      if (used[node]) return false;
+      used[node] = true;
+      ++node_cnt;
+    }
+  for (typename Container::const_iterator it = p.begin(); it != p.end(); ++it) {
+    FullGraph::Node node = *it;
+    if (used[node]) return false;
+    used[node] = true;
+    ++node_cnt;
+  }
   return (node_cnt == gr.nodeNum());
+}
 …
 bool checkTourPath(const FullGraph &gr, const Path<FullGraph> &p) {
   FullGraph::NodeMap<bool> used(gr, false);
   if (!checkPath(gr, p)) return false;
   if (gr.nodeNum() <= 1 && p.length() != 0) return false;
 …
+      }
+    }
     check(alg.run() > 0, alg_name + ": Wrong total cost");
 …
     check(checkCost(g, path, cost, alg.tourCost()),
       alg_name + ": Wrong tour cost");
     check(!Tolerance<double>().less(alg.tourCost(), opt2.run(alg.tourNodes())),
       "2-opt improvement: Wrong total cost");
 …
     check(checkCost(g, opt2.tourNodes(), cost, opt2.tourCost()),
       "2-opt improvement: Wrong tour cost");
     check(!Tolerance<double>().less(alg.tourCost(), opt2.run(path)),
       "2-opt improvement: Wrong total cost");
 …
+}
 // Algorithm class for Nearest Insertion
+// Algorithm class for Nearest Insertion
 template <typename CM>
 class NearestInsertionTsp : public InsertionTsp<CM> {
 …
 };
 // Algorithm class for Farthest Insertion
+// Algorithm class for Farthest Insertion
 template <typename CM>
 class FarthestInsertionTsp : public InsertionTsp<CM> {
 …
 };
 // Algorithm class for Cheapest Insertion
+// Algorithm class for Cheapest Insertion
 template <typename CM>
 class CheapestInsertionTsp : public InsertionTsp<CM> {
 …
 };
 // Algorithm class for Random Insertion
+// Algorithm class for Random Insertion
 template <typename CM>
 class RandomInsertionTsp : public InsertionTsp<CM> {
 …
   tspTestSmall<GreedyTsp<ConstMap<Edge, int> > >("Greedy");
   tspTestSmall<NearestInsertionTsp<ConstMap<Edge, int> > >("Nearest Insertion");
+  tspTestSmall<FarthestInsertionTsp<ConstMap<Edge, int> > >
+    ("Farthest Insertion");
+  tspTestSmall<CheapestInsertionTsp<ConstMap<Edge, int> > >
+    ("Cheapest Insertion");
+  tspTestSmall<FarthestInsertionTsp<ConstMap<Edge, int> > >("Farthest Insertion");
+  tspTestSmall<CheapestInsertionTsp<ConstMap<Edge, int> > >("Cheapest Insertion");
   tspTestSmall<RandomInsertionTsp<ConstMap<Edge, int> > >("Random Insertion");
   tspTestSmall<ChristofidesTsp<ConstMap<Edge, int> > >("Christofides");

tools/dimacs-solver.cc

-                      r1271
+                      r1169
  * This file is a part of LEMON, a generic C++ optimization library.
+ *
  * Copyright (C) 2003-2013
+ * Copyright (C) 2003-2010
  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
  * (Egervary Research Group on Combinatorial Optimization, EGRES).
 …
   if (report) {
     std::cerr << "Run NetworkSimplex: " << ti << "\n\n";
+    std::cerr << "Feasible flow: " << (res == MCF::OPTIMAL ? "found" :
+                                       "not found") << '\n';
+    std::cerr << "Feasible flow: " << (res == MCF::OPTIMAL ? "found" : "not found") << '\n';
     if (res) std::cerr << "Min flow cost: "
                        << ns.template totalCost<LargeValue>() << '\n';

Context Navigation

Changes in / [1298:a78e5b779b69:1297:c0c2f5c87aa6] in lemon

Legend:

Download in other formats: