COIN-OR::LEMON - Graph Library

Changeset 430:60e4627e8c74 in lemon-0.x


Ignore:
Timestamp:
04/26/04 20:08:46 (16 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@570
Message:

Many new modules (groups) in the documentation.

Files:
5 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r424 r430  
    1 /// @defgroup misc Miscellaneous tools
     1/// @defgroup datas Data Structures
     2/// This group describes the several graph structures implemented in HugoLib.
     3
     4/// @defgroup graphs Graph Structures
     5/// @ingroup datas
     6/// This group describes the graph structures implemented in HugoLib.
     7
     8/// @defgroup auxdat Auxiliary Data Structures
     9/// @ingroup datas
     10/// This group describes the data structures implemented in HugoLib in
     11/// order to make it easier to implement combinatorial algorithms.
     12
     13/// @defgroup gwrappers Wrapper Classes for Graphs
     14/// @ingroup graphs
     15/// This group contains several wrapper classes for graphs
     16
     17/// @defgroup galgs Graph Algorithms
     18/// This group describes the several graph algorithms implemented in HugoLib.
     19
     20/// @defgroup misc Miscellaneous Tools
    221/// Here you can find several useful tools for development,
    322/// debugging and testing.
    423
    5 /// @defgroup experimental Experimental structures and algorithms
     24/// @defgroup experimental Experimental Structures and Algorithms
    625/// This group contains some Experimental structures and algorithms.
    726/// The stuffs here are subject to change.
    827
    9 /// @defgroup gwrappers Wrapper classes for graphs
    10 /// @ingroup experimental
    11 /// This group contains several wrapper classes for graphs
    12 
    13 /// @defgroup graphs Graph structures
    14 /// @ingroup experimental
    15 /// This group describes the several graph structures implemented in HugoLib.
    1628
    1729/// \ingroup misc experimental
  • src/include/bin_heap.h

    r274 r430  
    6262#define BIN_HEAP_HH
    6363
     64///ingroup auxdat
    6465///\file
    6566///\brief Binary Heap implementation.
     
    7172namespace hugo {
    7273
    73   /// A Binary Heap implementation.
     74  /// \addtogroup auxdat
     75  /// @{
     76
     77   /// A Binary Heap implementation.
    7478  template <typename Item, typename Prio, typename ItemIntMap,
    7579            typename Compare = std::less<Prio> >
     
    236240  }
    237241
     242  ///@}
     243
    238244} // namespace hugo
    239245
  • src/include/dijkstra.h

    r421 r430  
    33#define HUGO_DIJKSTRA_H
    44
     5///ingroup galgs
    56///\file
    67///\brief Dijkstra algorithm.
     
    1011
    1112namespace hugo {
     13
     14/// \addtogroup galgs
     15/// @{
    1216
    1317  ///%Dijkstra algorithm class.
     
    190194      }
    191195  }
     196
     197/// @}
    192198 
    193199} //END OF NAMESPACE HUGO
  • src/include/fib_heap.h

    r387 r430  
    44#define HUGO_FIB_HEAP_H
    55
     6///ingroup auxdat
    67///\file
    78///\brief Fibonacci Heap implementation.
     
    1314namespace hugo {
    1415 
     16  /// \addtogroup auxdat
     17  /// @{
     18
    1519  /// An implementation of the Fibonacci Heap.
    1620
     
    491495  }
    492496 
     497  ///@}
     498
    493499} //namespace hugo
    494500#endif
  • src/work/athos/minlengthpaths.h

    r330 r430  
    33#define HUGO_MINLENGTHPATHS_H
    44
     5///ingroup galgs
    56///\file
    67///\brief An algorithm for finding k paths of minimal total length.
     
    1516namespace hugo {
    1617
    17 
     18/// \addtogroup galgs
     19/// @{
    1820
    1921  ///\brief Implementation of an algorithm for finding k paths between 2 nodes
     
    161163  }; //class MinLengthPaths
    162164
     165  ///@}
    163166
    164167} //namespace hugo
Note: See TracChangeset for help on using the changeset viewer.