COIN-OR::LEMON - Graph Library

Ticket #103: spelling-da953e387d31.patch

File spelling-da953e387d31.patch, 8.6 KB (added by Akos Ladanyi, 16 years ago)
  • CMakeLists.txt

    # 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  
    55#  OUTPUT_VARIABLE HG_REVISION
    66#  OUTPUT_STRIP_TRAILING_WHITESPACE)
    77
    8 SET(PROJECT_NAME "Lemon")
     8SET(PROJECT_NAME "LEMON")
    99SET(PROJECT_VERSION_MAJOR "0")
    1010SET(PROJECT_VERSION_MINOR "99")
    1111SET(PROJECT_VERSION_PATCH "0")
     
    3636  SET(CPACK_PACKAGE_VENDOR
    3737    "EGRES - Egervary Research Group on Combinatorial Optimization")
    3838  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")
    4040  SET(CPACK_RESOURCE_FILE_LICENSE "${CMAKE_SOURCE_DIR}/LICENSE")
    4141
    4242  SET(CPACK_PACKAGE_VERSION_MAJOR ${PROJECT_VERSION_MAJOR})
     
    5757  #SET(CPACK_COMPONENT_HTML_DOCUMENTATION_DISPLAY_NAME "HTML documentation")
    5858
    5959  #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")
    6161  #SET(CPACK_COMPONENT_LIBRARY_DESCRIPTION
    62   #  "Static library used to build programs with Lemon")
     62  #  "Static library used to build programs with LEMON")
    6363  #SET(CPACK_COMPONENT_HTML_DOCUMENTATION_DESCRIPTION
    6464  #  "Doxygen generated documentation")
    6565
     
    7070  #SET(CPACK_COMPONENT_HTML_DOCUMENTATION_GROUP "Documentation")
    7171
    7272  #SET(CPACK_COMPONENT_GROUP_DEVELOPMENT_DESCRIPTION
    73   #  "Components needed to develop software using Lemon")
     73  #  "Components needed to develop software using LEMON")
    7474  #SET(CPACK_COMPONENT_GROUP_DOCUMENTATION_DESCRIPTION
    75   #  "Documentation of Lemon")
     75  #  "Documentation of LEMON")
    7676
    7777  #SET(CPACK_ALL_INSTALL_TYPES Full Developer)
    7878
  • configure.ac

    diff --git a/configure.ac b/configure.ac
    a b  
    66m4_define([lemon_version], [ifelse(lemon_version_number(), [], [lemon_hg_revision()], [lemon_version_number()])])
    77
    88AC_PREREQ([2.59])
    9 AC_INIT([Lemon], [lemon_version()], [lemon-user@lemon.cs.elte.hu], [lemon])
     9AC_INIT([LEMON], [lemon_version()], [lemon-user@lemon.cs.elte.hu], [lemon])
    1010AC_CONFIG_AUX_DIR([build-aux])
    1111AC_CONFIG_MACRO_DIR([m4])
    1212AM_INIT_AUTOMAKE([-Wall -Werror foreign subdir-objects nostdinc])
  • doc/groups.dox

    diff --git a/doc/groups.dox b/doc/groups.dox
    a b  
    325325matching. The search can be constrained to find perfect or
    326326maximum cardinality matching.
    327327
    328 Lemon contains the next algorithms:
     328LEMON contains the next algorithms:
    329329- \ref lemon::MaxBipartiteMatching "MaxBipartiteMatching" Hopcroft-Karp
    330330  augmenting path algorithm for calculate maximum cardinality matching in
    331331  bipartite graphs
     
    476476*/
    477477
    478478/**
    479 @defgroup lemon_io Lemon Input-Output
     479@defgroup lemon_io LEMON Input-Output
    480480@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".
    482482
    483483This group describes methods for reading and writing
    484 \ref lgf-format "Lemon Graph Format".
     484\ref lgf-format "LEMON Graph Format".
    485485*/
    486486
    487487/**
  • doc/lgf.dox

    diff --git a/doc/lgf.dox b/doc/lgf.dox
    a b  
    2121
    2222
    2323
    24 \page lgf-format Lemon Graph Format (LGF)
     24\page lgf-format LEMON Graph Format (LGF)
    2525
    2626The \e LGF is a <em>column oriented</em>
    2727file format for storing graphs and associated data like
  • lemon/bits/alteration_notifier.h

    diff --git a/lemon/bits/alteration_notifier.h b/lemon/bits/alteration_notifier.h
    a b  
    4141  /// value containers which are the node and edge maps.
    4242  ///
    4343  /// 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
    4545  /// that the node and edge maps should contain values for all nodes or
    4646  /// edges. If we want to check on every indicing if the map contains
    4747  /// the current indicing key that cause a drawback in the performance
  • lemon/concepts/path.h

    diff --git a/lemon/concepts/path.h b/lemon/concepts/path.h
    a b  
    7777      /// Resets the path to an empty path.
    7878      void clear() {}
    7979
    80       /// \brief Lemon style iterator for path arcs
     80      /// \brief LEMON style iterator for path arcs
    8181      ///
    8282      /// This class is used to iterate on the arcs of the paths.
    8383      class ArcIt {
     
    200200    /// algorithms can enumerate easily the arcs in reverse order.
    201201    /// If we would like to give back a real path from these
    202202    /// 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
    204204    /// assigned to a real path and the dumpers can be implemented as
    205205    /// an adaptor class to the predecessor map.
    206206
     
    232232      /// dumper.
    233233      typedef False RevPathTag;
    234234
    235       /// \brief Lemon style iterator for path arcs
     235      /// \brief LEMON style iterator for path arcs
    236236      ///
    237237      /// This class is used to iterate on the arcs of the paths.
    238238      class ArcIt {
     
    259259
    260260      };
    261261
    262       /// \brief Lemon style iterator for path arcs
     262      /// \brief LEMON style iterator for path arcs
    263263      ///
    264264      /// This class is used to iterate on the arcs of the paths in
    265265      /// reverse direction.
  • lemon/lgf_reader.h

    diff --git a/lemon/lgf_reader.h b/lemon/lgf_reader.h
    a b  
    1818
    1919///\ingroup lemon_io
    2020///\file
    21 ///\brief \ref lgf-format "Lemon Graph Format" reader.
     21///\brief \ref lgf-format "LEMON Graph Format" reader.
    2222
    2323
    2424#ifndef LEMON_LGF_READER_H
     
    23012301  /// \brief Reader for the contents of the \ref lgf-format "LGF" file
    23022302  ///
    23032303  /// 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
    23052305  /// that, which type of graph, which maps and which attributes
    23062306  /// should be read from a file, but in general tools (like glemon)
    23072307  /// the contents of an LGF file should be guessed somehow. This class
  • lemon/lgf_writer.h

    diff --git a/lemon/lgf_writer.h b/lemon/lgf_writer.h
    a b  
    1818
    1919///\ingroup lemon_io
    2020///\file
    21 ///\brief \ref lgf-format "Lemon Graph Format" writer.
     21///\brief \ref lgf-format "LEMON Graph Format" writer.
    2222
    2323
    2424#ifndef LEMON_LGF_WRITER_H
  • lemon/path.h

    diff --git a/lemon/path.h b/lemon/path.h
    a b  
    8282      return *this;
    8383    }
    8484
    85     /// \brief Lemon style iterator for path arcs
     85    /// \brief LEMON style iterator for path arcs
    8686    ///
    8787    /// This class is used to iterate on the arcs of the paths.
    8888    class ArcIt {
  • lemon/unionfind.h

    diff --git a/lemon/unionfind.h b/lemon/unionfind.h
    a b  
    497497      firstFreeItem = fdx;
    498498    }
    499499
    500     /// \brief Lemon style iterator for the representant items.
     500    /// \brief LEMON style iterator for the representant items.
    501501    ///
    502502    /// ClassIt is a lemon style iterator for the components. It iterates
    503503    /// on the ids of the classes.
     
    549549      int cdx;
    550550    };
    551551
    552     /// \brief Lemon style iterator for the items of a component.
     552    /// \brief LEMON style iterator for the items of a component.
    553553    ///
    554554    /// ClassIt is a lemon style iterator for the components. It iterates
    555555    /// on the items of a class. By example if you want to iterate on
     
    807807      firstFreeClass = cdx;
    808808    }
    809809
    810     /// \brief Lemon style iterator for the classes.
     810    /// \brief LEMON style iterator for the classes.
    811811    ///
    812812    /// ClassIt is a lemon style iterator for the components. It iterates
    813813    /// on the ids of classes.
     
    859859      int cdx;
    860860    };
    861861
    862     /// \brief Lemon style iterator for the items of a component.
     862    /// \brief LEMON style iterator for the items of a component.
    863863    ///
    864864    /// ClassIt is a lemon style iterator for the components. It iterates
    865865    /// on the items of a class. By example if you want to iterate on
     
    16551655      return nodes[parent >= 0 ? classes[id].depth : leftNode(id)].item;
    16561656    }
    16571657
    1658     /// \brief Lemon style iterator for the items of a class.
     1658    /// \brief LEMON style iterator for the items of a class.
    16591659    ///
    16601660    /// ClassIt is a lemon style iterator for the components. It iterates
    16611661    /// on the items of a class. By example if you want to iterate on