COIN-OR::LEMON - Graph Library

About

Downloads

Documentation

Development

Issue Tracker

Browse Tickets

Custom Query

Roadmap

Browse Source

Local Info

Mailing Lists

Search

Changes in / [51:90201bb15a8d:48:93ae269876de] in lemon-main


Ignore:
Files:
8 deleted
17 edited

Legend:

Unmodified
Added
Removed

  • lemon/base.cc

    r49 r7  
    33 * This file is a part of LEMON, a generic C++ optimization library
    44 *
    5  * Copyright (C) 2003-2008
     5 * Copyright (C) 2003-2007
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
    … …  
    1818
    1919///\file
    20 ///\brief Some basic non-inline functions and static global data.
     20///\brief Some basic non inline function and static global data.
    2121
    2222#include<lemon/tolerance.h>

  • lemon/bits/invalid.h

    r49 r13  
    33 * This file is a part of LEMON, a generic C++ optimization library
    44 *
    5  * Copyright (C) 2003-2008
     5 * Copyright (C) 2003-2007
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
    … …  
    2727  /// \brief Dummy type to make it easier to create invalid iterators.
    2828  ///
    29   /// Dummy type to make it easier to create invalid iterators.
    3029  /// See \ref INVALID for the usage.
    3130  struct Invalid {

  • lemon/bits/utility.h

    r39 r7  
    33 * This file is a part of LEMON, a generic C++ optimization library
    44 *
    5  * Copyright (C) 2003-2008
     5 * Copyright (C) 2003-2007
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).

  • lemon/concept_check.h

    r39 r27  
    33 * This file is a part of LEMON, a generic C++ optimization library
    44 *
    5  * Copyright (C) 2003-2008
     5 * Copyright (C) 2003-2007
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).

  • lemon/concepts/maps.h

    r51 r48  
    33 * This file is a part of LEMON, a generic C++ optimization library
    44 *
    5  * Copyright (C) 2003-2008
     5 * Copyright (C) 2003-2007
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).

  • lemon/dim2.h

    r49 r15  
    33 * This file is a part of LEMON, a generic C++ optimization library
    44 *
    5  * Copyright (C) 2003-2008
     5 * Copyright (C) 2003-2007
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
    … …  
    2828///
    2929/// The class \ref lemon::dim2::Point "dim2::Point" implements
    30 /// a two dimensional vector with the usual operations.
     30///a two dimensional vector with the usual
     31/// operations.
    3132///
    3233/// The class \ref lemon::dim2::BoundingBox "dim2::BoundingBox"
    … …  
    4950
    5051  /// A simple two dimensional vector (plainvector) implementation
    51   /// with the usual vector operations.
     52  ///with the usual vector
     53  /// operators.
     54  ///
    5255  template<typename T>
    5356    class Point {
    … …  
    6871      Point(T a, T b) : x(a), y(b) { }
    6972
    70       ///Returns the dimension of the vector (i.e. returns 2).
     73      ///The dimension of the vector.
    7174
    7275      ///The dimension of the vector.
    … …  
    9497      }
    9598 
    96       ///Increment the left hand side by \c u
     99      ///Increment the left hand side by u
    97100      Point<T>& operator +=(const Point<T>& u) {
    98101        x += u.x;
    … …  
    101104      }
    102105 
    103       ///Decrement the left hand side by \c u
     106      ///Decrement the left hand side by u
    104107      Point<T>& operator -=(const Point<T>& u) {
    105108        x -= u.x;
    … …  
    313316      ///if at least one point was added to the box or the coordinates of
    314317      ///the box were set).
    315       ///
    316318      ///The coordinates of an empty bounding box are not defined.
    317319      bool empty() const {
    … …  
    324326      }
    325327
    326       ///Give back the bottom left corner of the box
    327 
    328       ///Give back the bottom left corner of the box.
     328      ///Give back the bottom left corner
     329
     330      ///Give back the bottom left corner.
    329331      ///If the bounding box is empty, then the return value is not defined.
    330332      Point<T> bottomLeft() const {
    … …  
    332334      }
    333335
    334       ///Set the bottom left corner of the box
    335 
    336       ///Set the bottom left corner of the box.
     336      ///Set the bottom left corner
     337
     338      ///Set the bottom left corner.
    337339      ///It should only be used for non-empty box.
    338340      void bottomLeft(Point<T> p) {
    … …  
    340342      }
    341343
    342       ///Give back the top right corner of the box
    343 
    344       ///Give back the top right corner of the box.
     344      ///Give back the top right corner
     345
     346      ///Give back the top right corner.
    345347      ///If the bounding box is empty, then the return value is not defined.
    346348      Point<T> topRight() const {
    … …  
    348350      }
    349351
    350       ///Set the top right corner of the box
    351 
    352       ///Set the top right corner of the box.
     352      ///Set the top right corner
     353
     354      ///Set the top right corner.
    353355      ///It should only be used for non-empty box.
    354356      void topRight(Point<T> p) {
    … …  
    356358      }
    357359
    358       ///Give back the bottom right corner of the box
    359 
    360       ///Give back the bottom right corner of the box.
     360      ///Give back the bottom right corner
     361
     362      ///Give back the bottom right corner.
    361363      ///If the bounding box is empty, then the return value is not defined.
    362364      Point<T> bottomRight() const {
    … …  
    364366      }
    365367
    366       ///Set the bottom right corner of the box
    367 
    368       ///Set the bottom right corner of the box.
     368      ///Set the bottom right corner
     369
     370      ///Set the bottom right corner.
    369371      ///It should only be used for non-empty box.
    370372      void bottomRight(Point<T> p) {
    … …  
    373375      }
    374376 
    375       ///Give back the top left corner of the box
    376 
    377       ///Give back the top left corner of the box.
     377      ///Give back the top left corner
     378
     379      ///Give back the top left corner.
    378380      ///If the bounding box is empty, then the return value is not defined.
    379381      Point<T> topLeft() const {
    … …  
    381383      }
    382384
    383       ///Set the top left corner of the box
    384 
    385       ///Set the top left corner of the box.
     385      ///Set the top left corner
     386
     387      ///Set the top left corner.
    386388      ///It should only be used for non-empty box.
    387389      void topLeft(Point<T> p) {
    … …  
    667669
    668670
    669   ///\brief Map of the \ref Point::normSquare() "normSquare()"
    670   ///of a \ref Point "Point"-map
    671   ///
    672   ///Map of the \ref Point::normSquare() "normSquare()"
    673   ///of a \ref Point "Point"-map.
    674   ///\ingroup maps
     671    ///\brief Map of the \ref Point::normSquare() "normSquare()"
     672    ///of a \ref Point "Point"-map
     673    ///
     674    ///Map of the \ref Point::normSquare() "normSquare()"
     675    ///of a \ref Point "Point"-map.
     676    ///\ingroup maps
     677    ///
    675678  template<class M>
    676679  class NormSquareMap

  • lemon/list_graph.h

    r39 r2  
    1 /* -*- C++ -*-
    2  *
    3  * This file is a part of LEMON, a generic C++ optimization library
    4  *
    5  * Copyright (C) 2003-2008
    6  * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    7  * (Egervary Research Group on Combinatorial Optimization, EGRES).
    8  *
    9  * Permission to use, modify and distribute this software is granted
    10  * provided that this copyright notice appears in all copies. For
    11  * precise terms see the accompanying LICENSE file.
    12  *
    13  * This software is provided "AS IS" with no warranty of any kind,
    14  * express or implied, and with no claim as to its suitability for any
    15  * purpose.
    16  *
    17  */
    18 

  • lemon/maps.h

    r51 r47  
    33 * This file is a part of LEMON, a generic C++ optimization library
    44 *
    5  * Copyright (C) 2003-2008
     5 * Copyright (C) 2003-2007
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
    … …  
    173173
    174174    typedef MapBase<K, T> Parent;
    175     ///Key type
    176     typedef typename Parent::Key Key;
    177     ///Value type
    178     typedef typename Parent::Value Value;
    179     ///Reference Type
     175    ///\e
     176    typedef typename Parent::Key Key;
     177    ///\e
     178    typedef typename Parent::Value Value;
     179    ///\e
    180180    typedef T& Reference;
    181     ///Const reference type
     181    ///\e
    182182    typedef const T& ConstReference;
    183183

  • lemon/random.cc

    r39 r16  
    33 * This file is a part of LEMON, a generic C++ optimization library
    44 *
    5  * Copyright (C) 2003-2008
     5 * Copyright (C) 2003-2007
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).

  • lemon/random.h

    r49 r23  
    33 * This file is a part of LEMON, a generic C++ optimization library
    44 *
    5  * Copyright (C) 2003-2008
     5 * Copyright (C) 2003-2007
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
    … …  
    511511  ///\endcode
    512512  ///
    513   /// LEMON provides a global instance of the random number
     513  /// The lemon provides a global instance of the random number
    514514  /// generator which name is \ref lemon::rnd "rnd". Usually it is a
    515515  /// good programming convenience to use this global generator to get
    … …  
    527527  public:
    528528
    529     /// \brief Default constructor
     529    /// \brief Constructor
    530530    ///
    531531    /// Constructor with constant seeding.
    532532    Random() { core.initState(); }
    533533
    534     /// \brief Constructor with seed
     534    /// \brief Constructor
    535535    ///
    536536    /// Constructor with seed. The current number type will be converted
    … …  
    541541    }
    542542
    543     /// \brief Constructor with array seeding
     543    /// \brief Constructor
    544544    ///
    545545    /// Constructor with array seeding. The given range should contain
    … …  
    578578    ///
    579579    /// It returns a random real number from the range [0, 1). The
    580     /// default Number type is \c double.
     580    /// default Number type is double.
    581581    template <typename Number>
    582582    Number real() {
    … …  
    654654    ///
    655655    /// It returns a random non-negative integer uniformly from the
    656     /// whole range of the current \c Number type. The default result
    657     /// type of this function is <tt>unsigned int</tt>.
     656    /// whole range of the current \c Number type.  The default result
     657    /// type of this function is unsigned int.
    658658    template <typename Number>
    659659    Number uinteger() {
    … …  
    669669    /// It returns a random integer uniformly from the whole range of
    670670    /// the current \c Number type. The default result type of this
    671     /// function is \c int.
     671    /// function is int.
    672672    template <typename Number>
    673673    Number integer() {
    … …  
    690690    }
    691691
    692     ///\name Non-uniform distributions
     692    ///\name Nonuniform distributions
    693693    ///
    694694   

  • lemon/tolerance.h

    r49 r16  
    33 * This file is a part of LEMON, a generic C++ optimization library
    44 *
    5  * Copyright (C) 2003-2008
     5 * Copyright (C) 2003-2007
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
    … …  
    3737  ///as a result of a probably inexact computation.
    3838  ///
    39   ///\ref Tolerance is a class to provide a basic way to
     39  ///Tolerance is a class to provide a basic way to
    4040  ///handle the comparison of numbers that are obtained
    4141  ///as a result of a probably inexact computation.
    4242  ///
    4343  ///This is an abstract class, it should be specialized for all numerical
    44   ///data types. These specialized classes like \ref Tolerance<double>
     44  ///data types. These specialized classes like \ref Tolerance\<double\>
    4545  ///may offer additional tuning parameters.
    4646  ///
    … …  
    4949  ///\sa Tolerance<long double>
    5050  ///\sa Tolerance<int>
     51#if defined __GNUC__ && !defined __STRICT_ANSI__ 
    5152  ///\sa Tolerance<long long int>
     53#endif
    5254  ///\sa Tolerance<unsigned int>
     55#if defined __GNUC__ && !defined __STRICT_ANSI__ 
    5356  ///\sa Tolerance<unsigned long long int>
     57#endif
    5458
    5559  template<class T>
    … …  
    6064
    6165    ///\name Comparisons
    62     ///The concept is that these bool functions return \c true only if
     66    ///The concept is that these bool functions return with \c true only if
    6367    ///the related comparisons hold even if some numerical error appeared
    6468    ///during the computations.
    … …  
    8892
    8993
    90   ///Float specialization of Tolerance.
    91 
    92   ///Float specialization of Tolerance.
     94  ///Float specialization of \ref Tolerance.
     95
     96  ///Float specialization of \ref Tolerance.
    9397  ///\sa Tolerance
    9498  ///\relates Tolerance
    … …  
    104108    ///Constructor setting the epsilon tolerance to the default value.
    105109    Tolerance() : _epsilon(def_epsilon) {}
    106     ///Constructor setting the epsilon tolerance to the given value.
     110    ///Constructor setting the epsilon tolerance.
    107111    Tolerance(float e) : _epsilon(e) {}
    108112
    109     ///Returns the epsilon value.
     113    ///Return the epsilon value.
    110114    Value epsilon() const {return _epsilon;}
    111     ///Sets the epsilon value.
     115    ///Set the epsilon value.
    112116    void epsilon(Value e) {_epsilon=e;}
    113117
    114     ///Returns the default epsilon value.
     118    ///Return the default epsilon value.
    115119    static Value defaultEpsilon() {return def_epsilon;}
    116     ///Sets the default epsilon value.
     120    ///Set the default epsilon value.
    117121    static void defaultEpsilon(Value e) {def_epsilon=e;}
    118122
    119123    ///\name Comparisons
    120     ///See \ref Tolerance for more details.
     124    ///See class Tolerance for more details.
    121125
    122126    ///@{
    … …  
    139143  };
    140144
    141   ///Double specialization of Tolerance.
    142 
    143   ///Double specialization of Tolerance.
     145  ///Double specialization of \ref Tolerance.
     146
     147  ///Double specialization of \ref Tolerance.
    144148  ///\sa Tolerance
    145149  ///\relates Tolerance
    … …  
    155159    ///Constructor setting the epsilon tolerance to the default value.
    156160    Tolerance() : _epsilon(def_epsilon) {}
    157     ///Constructor setting the epsilon tolerance to the given value.
     161    ///Constructor setting the epsilon tolerance.
    158162    Tolerance(double e) : _epsilon(e) {}
    159163
    160     ///Returns the epsilon value.
     164    ///Return the epsilon value.
    161165    Value epsilon() const {return _epsilon;}
    162     ///Sets the epsilon value.
     166    ///Set the epsilon value.
    163167    void epsilon(Value e) {_epsilon=e;}
    164168
    165     ///Returns the default epsilon value.
     169    ///Return the default epsilon value.
    166170    static Value defaultEpsilon() {return def_epsilon;}
    167     ///Sets the default epsilon value.
     171    ///Set the default epsilon value.
    168172    static void defaultEpsilon(Value e) {def_epsilon=e;}
    169173
    170174    ///\name Comparisons
    171     ///See \ref Tolerance for more details.
     175    ///See class Tolerance for more details.
    172176
    173177    ///@{
    … …  
    190194  };
    191195
    192   ///Long double specialization of Tolerance.
    193 
    194   ///Long double specialization of Tolerance.
     196  ///Long double specialization of \ref Tolerance.
     197
     198  ///Long double specialization of \ref Tolerance.
    195199  ///\sa Tolerance
    196200  ///\relates Tolerance
    … …  
    206210    ///Constructor setting the epsilon tolerance to the default value.
    207211    Tolerance() : _epsilon(def_epsilon) {}
    208     ///Constructor setting the epsilon tolerance to the given value.
     212    ///Constructor setting the epsilon tolerance.
    209213    Tolerance(long double e) : _epsilon(e) {}
    210214
    211     ///Returns the epsilon value.
     215    ///Return the epsilon value.
    212216    Value epsilon() const {return _epsilon;}
    213     ///Sets the epsilon value.
     217    ///Set the epsilon value.
    214218    void epsilon(Value e) {_epsilon=e;}
    215219
    216     ///Returns the default epsilon value.
     220    ///Return the default epsilon value.
    217221    static Value defaultEpsilon() {return def_epsilon;}
    218     ///Sets the default epsilon value.
     222    ///Set the default epsilon value.
    219223    static void defaultEpsilon(Value e) {def_epsilon=e;}
    220224
    221225    ///\name Comparisons
    222     ///See \ref Tolerance for more details.
     226    ///See class Tolerance for more details.
    223227
    224228    ///@{
    … …  
    241245  };
    242246
    243   ///Integer specialization of Tolerance.
    244 
    245   ///Integer specialization of Tolerance.
     247  ///Integer specialization of \ref Tolerance.
     248
     249  ///Integer specialization of \ref Tolerance.
    246250  ///\sa Tolerance
    247251  template<>
    … …  
    274278  };
    275279
    276   ///Unsigned integer specialization of Tolerance.
    277 
    278280  ///Unsigned integer specialization of \ref Tolerance.
     281
     282  ///Unsigned integer specialization of \ref Tolerance.
    279283  ///\sa Tolerance
    280284  template<>
    … …  
    308312 
    309313
    310   ///Long integer specialization of Tolerance.
    311 
    312   ///Long integer specialization of Tolerance.
     314  ///Long integer specialization of \ref Tolerance.
     315
     316  ///Long integer specialization of \ref Tolerance.
    313317  ///\sa Tolerance
    314318  template<>
    … …  
    341345  };
    342346
    343   ///Unsigned long integer specialization of Tolerance.
    344 
    345347  ///Unsigned long integer specialization of \ref Tolerance.
     348
     349  ///Unsigned long integer specialization of \ref Tolerance.
    346350  ///\sa Tolerance
    347351  template<>
    … …  
    376380#if defined __GNUC__ && !defined __STRICT_ANSI__
    377381
    378   ///Long long integer specialization of Tolerance.
     382  ///Long long integer specialization of \ref Tolerance.
    379383
    380384  ///Long long integer specialization of \ref Tolerance.
    … …  
    411415  };
    412416
    413   ///Unsigned long long integer specialization of Tolerance.
     417  ///Unsigned long long integer specialization of \ref Tolerance.
    414418
    415419  ///Unsigned long long integer specialization of \ref Tolerance.

  • test/dim_test.cc

    r39 r14  
    33 * This file is a part of LEMON, a generic C++ optimization library
    44 *
    5  * Copyright (C) 2003-2008
     5 * Copyright (C) 2003-2007
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).

  • test/maps_test.cc

    r39 r25  
    33 * This file is a part of LEMON, a generic C++ optimization library
    44 *
    5  * Copyright (C) 2003-2008
     5 * Copyright (C) 2003-2007
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).

  • test/random_test.cc

    r39 r10  
    33 * This file is a part of LEMON, a generic C++ optimization library
    44 *
    5  * Copyright (C) 2003-2008
     5 * Copyright (C) 2003-2007
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).

  • test/test_tools.h

    r39 r4  
    33 * This file is a part of LEMON, a generic C++ optimization library
    44 *
    5  * Copyright (C) 2003-2008
     5 * Copyright (C) 2003-2007
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).

  • test/test_tools_fail.cc

    r39 r4  
    33 * This file is a part of LEMON, a generic C++ optimization library
    44 *
    5  * Copyright (C) 2003-2008
     5 * Copyright (C) 2003-2007
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).

  • test/test_tools_pass.cc

    r39 r4  
    33 * This file is a part of LEMON, a generic C++ optimization library
    44 *
    5  * Copyright (C) 2003-2008
     5 * Copyright (C) 2003-2007
    66 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
    77 * (Egervary Research Group on Combinatorial Optimization, EGRES).
Note: See TracChangeset for help on using the changeset viewer.