# HG changeset patch
# User Akos Ladanyi <ladanyi@tmit.bme.hu>
# Date 1217245198 -3600
# Node ID da953e387d31b09feb8008172fd2aa318db62d89
# Parent ad6b8c47bd56c03d587feab33d875a72b2adfd6f
Unify the spelling of LEMON (#103).
diff --git a/CMakeLists.txt b/CMakeLists.txt
|
a
|
b
|
|
| 5 | 5 | # OUTPUT_VARIABLE HG_REVISION |
| 6 | 6 | # OUTPUT_STRIP_TRAILING_WHITESPACE) |
| 7 | 7 | |
| 8 | | SET(PROJECT_NAME "Lemon") |
| | 8 | SET(PROJECT_NAME "LEMON") |
| 9 | 9 | SET(PROJECT_VERSION_MAJOR "0") |
| 10 | 10 | SET(PROJECT_VERSION_MINOR "99") |
| 11 | 11 | SET(PROJECT_VERSION_PATCH "0") |
| … |
… |
|
| 36 | 36 | SET(CPACK_PACKAGE_VENDOR |
| 37 | 37 | "EGRES - Egervary Research Group on Combinatorial Optimization") |
| 38 | 38 | SET(CPACK_PACKAGE_DESCRIPTION_SUMMARY |
| 39 | | "Lemon - Library of Efficient Models and Optimization in Networks") |
| | 39 | "LEMON - Library of Efficient Models and Optimization in Networks") |
| 40 | 40 | SET(CPACK_RESOURCE_FILE_LICENSE "${CMAKE_SOURCE_DIR}/LICENSE") |
| 41 | 41 | |
| 42 | 42 | SET(CPACK_PACKAGE_VERSION_MAJOR ${PROJECT_VERSION_MAJOR}) |
| … |
… |
|
| 57 | 57 | #SET(CPACK_COMPONENT_HTML_DOCUMENTATION_DISPLAY_NAME "HTML documentation") |
| 58 | 58 | |
| 59 | 59 | #SET(CPACK_COMPONENT_HEADERS_DESCRIPTION |
| 60 | | # "C++ header files for use with the Lemon library") |
| | 60 | # "C++ header files for use with the LEMON library") |
| 61 | 61 | #SET(CPACK_COMPONENT_LIBRARY_DESCRIPTION |
| 62 | | # "Static library used to build programs with Lemon") |
| | 62 | # "Static library used to build programs with LEMON") |
| 63 | 63 | #SET(CPACK_COMPONENT_HTML_DOCUMENTATION_DESCRIPTION |
| 64 | 64 | # "Doxygen generated documentation") |
| 65 | 65 | |
| … |
… |
|
| 70 | 70 | #SET(CPACK_COMPONENT_HTML_DOCUMENTATION_GROUP "Documentation") |
| 71 | 71 | |
| 72 | 72 | #SET(CPACK_COMPONENT_GROUP_DEVELOPMENT_DESCRIPTION |
| 73 | | # "Components needed to develop software using Lemon") |
| | 73 | # "Components needed to develop software using LEMON") |
| 74 | 74 | #SET(CPACK_COMPONENT_GROUP_DOCUMENTATION_DESCRIPTION |
| 75 | | # "Documentation of Lemon") |
| | 75 | # "Documentation of LEMON") |
| 76 | 76 | |
| 77 | 77 | #SET(CPACK_ALL_INSTALL_TYPES Full Developer) |
| 78 | 78 | |
diff --git a/configure.ac b/configure.ac
|
a
|
b
|
|
| 6 | 6 | m4_define([lemon_version], [ifelse(lemon_version_number(), [], [lemon_hg_revision()], [lemon_version_number()])]) |
| 7 | 7 | |
| 8 | 8 | AC_PREREQ([2.59]) |
| 9 | | AC_INIT([Lemon], [lemon_version()], [lemon-user@lemon.cs.elte.hu], [lemon]) |
| | 9 | AC_INIT([LEMON], [lemon_version()], [lemon-user@lemon.cs.elte.hu], [lemon]) |
| 10 | 10 | AC_CONFIG_AUX_DIR([build-aux]) |
| 11 | 11 | AC_CONFIG_MACRO_DIR([m4]) |
| 12 | 12 | AM_INIT_AUTOMAKE([-Wall -Werror foreign subdir-objects nostdinc]) |
diff --git a/doc/groups.dox b/doc/groups.dox
|
a
|
b
|
|
| 325 | 325 | matching. The search can be constrained to find perfect or |
| 326 | 326 | maximum cardinality matching. |
| 327 | 327 | |
| 328 | | Lemon contains the next algorithms: |
| | 328 | LEMON contains the next algorithms: |
| 329 | 329 | - \ref lemon::MaxBipartiteMatching "MaxBipartiteMatching" Hopcroft-Karp |
| 330 | 330 | augmenting path algorithm for calculate maximum cardinality matching in |
| 331 | 331 | bipartite graphs |
| … |
… |
|
| 476 | 476 | */ |
| 477 | 477 | |
| 478 | 478 | /** |
| 479 | | @defgroup lemon_io Lemon Input-Output |
| | 479 | @defgroup lemon_io LEMON Input-Output |
| 480 | 480 | @ingroup io_group |
| 481 | | \brief Reading and writing \ref lgf-format "Lemon Graph Format". |
| | 481 | \brief Reading and writing \ref lgf-format "LEMON Graph Format". |
| 482 | 482 | |
| 483 | 483 | This group describes methods for reading and writing |
| 484 | | \ref lgf-format "Lemon Graph Format". |
| | 484 | \ref lgf-format "LEMON Graph Format". |
| 485 | 485 | */ |
| 486 | 486 | |
| 487 | 487 | /** |
diff --git a/doc/lgf.dox b/doc/lgf.dox
|
a
|
b
|
|
| 21 | 21 | |
| 22 | 22 | |
| 23 | 23 | |
| 24 | | \page lgf-format Lemon Graph Format (LGF) |
| | 24 | \page lgf-format LEMON Graph Format (LGF) |
| 25 | 25 | |
| 26 | 26 | The \e LGF is a <em>column oriented</em> |
| 27 | 27 | file format for storing graphs and associated data like |
diff --git a/lemon/bits/alteration_notifier.h b/lemon/bits/alteration_notifier.h
|
a
|
b
|
|
| 41 | 41 | /// value containers which are the node and edge maps. |
| 42 | 42 | /// |
| 43 | 43 | /// The graph's node and edge sets can be changed as we add or erase |
| 44 | | /// nodes and edges in the graph. Lemon would like to handle easily |
| | 44 | /// nodes and edges in the graph. LEMON would like to handle easily |
| 45 | 45 | /// that the node and edge maps should contain values for all nodes or |
| 46 | 46 | /// edges. If we want to check on every indicing if the map contains |
| 47 | 47 | /// the current indicing key that cause a drawback in the performance |
diff --git a/lemon/concepts/path.h b/lemon/concepts/path.h
|
a
|
b
|
|
| 77 | 77 | /// Resets the path to an empty path. |
| 78 | 78 | void clear() {} |
| 79 | 79 | |
| 80 | | /// \brief Lemon style iterator for path arcs |
| | 80 | /// \brief LEMON style iterator for path arcs |
| 81 | 81 | /// |
| 82 | 82 | /// This class is used to iterate on the arcs of the paths. |
| 83 | 83 | class ArcIt { |
| … |
… |
|
| 200 | 200 | /// algorithms can enumerate easily the arcs in reverse order. |
| 201 | 201 | /// If we would like to give back a real path from these |
| 202 | 202 | /// algorithms then we should create a temporarly path object. In |
| 203 | | /// Lemon such algorithms gives back a path dumper what can |
| | 203 | /// LEMON such algorithms gives back a path dumper what can |
| 204 | 204 | /// assigned to a real path and the dumpers can be implemented as |
| 205 | 205 | /// an adaptor class to the predecessor map. |
| 206 | 206 | |
| … |
… |
|
| 232 | 232 | /// dumper. |
| 233 | 233 | typedef False RevPathTag; |
| 234 | 234 | |
| 235 | | /// \brief Lemon style iterator for path arcs |
| | 235 | /// \brief LEMON style iterator for path arcs |
| 236 | 236 | /// |
| 237 | 237 | /// This class is used to iterate on the arcs of the paths. |
| 238 | 238 | class ArcIt { |
| … |
… |
|
| 259 | 259 | |
| 260 | 260 | }; |
| 261 | 261 | |
| 262 | | /// \brief Lemon style iterator for path arcs |
| | 262 | /// \brief LEMON style iterator for path arcs |
| 263 | 263 | /// |
| 264 | 264 | /// This class is used to iterate on the arcs of the paths in |
| 265 | 265 | /// reverse direction. |
diff --git a/lemon/lgf_reader.h b/lemon/lgf_reader.h
|
a
|
b
|
|
| 18 | 18 | |
| 19 | 19 | ///\ingroup lemon_io |
| 20 | 20 | ///\file |
| 21 | | ///\brief \ref lgf-format "Lemon Graph Format" reader. |
| | 21 | ///\brief \ref lgf-format "LEMON Graph Format" reader. |
| 22 | 22 | |
| 23 | 23 | |
| 24 | 24 | #ifndef LEMON_LGF_READER_H |
| … |
… |
|
| 2301 | 2301 | /// \brief Reader for the contents of the \ref lgf-format "LGF" file |
| 2302 | 2302 | /// |
| 2303 | 2303 | /// This class can be used to read the sections, the map names and |
| 2304 | | /// the attributes from a file. Usually, the Lemon programs know |
| | 2304 | /// the attributes from a file. Usually, the LEMON programs know |
| 2305 | 2305 | /// that, which type of graph, which maps and which attributes |
| 2306 | 2306 | /// should be read from a file, but in general tools (like glemon) |
| 2307 | 2307 | /// the contents of an LGF file should be guessed somehow. This class |
diff --git a/lemon/lgf_writer.h b/lemon/lgf_writer.h
|
a
|
b
|
|
| 18 | 18 | |
| 19 | 19 | ///\ingroup lemon_io |
| 20 | 20 | ///\file |
| 21 | | ///\brief \ref lgf-format "Lemon Graph Format" writer. |
| | 21 | ///\brief \ref lgf-format "LEMON Graph Format" writer. |
| 22 | 22 | |
| 23 | 23 | |
| 24 | 24 | #ifndef LEMON_LGF_WRITER_H |
diff --git a/lemon/path.h b/lemon/path.h
|
a
|
b
|
|
| 82 | 82 | return *this; |
| 83 | 83 | } |
| 84 | 84 | |
| 85 | | /// \brief Lemon style iterator for path arcs |
| | 85 | /// \brief LEMON style iterator for path arcs |
| 86 | 86 | /// |
| 87 | 87 | /// This class is used to iterate on the arcs of the paths. |
| 88 | 88 | class ArcIt { |
diff --git a/lemon/unionfind.h b/lemon/unionfind.h
|
a
|
b
|
|
| 497 | 497 | firstFreeItem = fdx; |
| 498 | 498 | } |
| 499 | 499 | |
| 500 | | /// \brief Lemon style iterator for the representant items. |
| | 500 | /// \brief LEMON style iterator for the representant items. |
| 501 | 501 | /// |
| 502 | 502 | /// ClassIt is a lemon style iterator for the components. It iterates |
| 503 | 503 | /// on the ids of the classes. |
| … |
… |
|
| 549 | 549 | int cdx; |
| 550 | 550 | }; |
| 551 | 551 | |
| 552 | | /// \brief Lemon style iterator for the items of a component. |
| | 552 | /// \brief LEMON style iterator for the items of a component. |
| 553 | 553 | /// |
| 554 | 554 | /// ClassIt is a lemon style iterator for the components. It iterates |
| 555 | 555 | /// on the items of a class. By example if you want to iterate on |
| … |
… |
|
| 807 | 807 | firstFreeClass = cdx; |
| 808 | 808 | } |
| 809 | 809 | |
| 810 | | /// \brief Lemon style iterator for the classes. |
| | 810 | /// \brief LEMON style iterator for the classes. |
| 811 | 811 | /// |
| 812 | 812 | /// ClassIt is a lemon style iterator for the components. It iterates |
| 813 | 813 | /// on the ids of classes. |
| … |
… |
|
| 859 | 859 | int cdx; |
| 860 | 860 | }; |
| 861 | 861 | |
| 862 | | /// \brief Lemon style iterator for the items of a component. |
| | 862 | /// \brief LEMON style iterator for the items of a component. |
| 863 | 863 | /// |
| 864 | 864 | /// ClassIt is a lemon style iterator for the components. It iterates |
| 865 | 865 | /// on the items of a class. By example if you want to iterate on |
| … |
… |
|
| 1655 | 1655 | return nodes[parent >= 0 ? classes[id].depth : leftNode(id)].item; |
| 1656 | 1656 | } |
| 1657 | 1657 | |
| 1658 | | /// \brief Lemon style iterator for the items of a class. |
| | 1658 | /// \brief LEMON style iterator for the items of a class. |
| 1659 | 1659 | /// |
| 1660 | 1660 | /// ClassIt is a lemon style iterator for the components. It iterates |
| 1661 | 1661 | /// on the items of a class. By example if you want to iterate on |