COIN-OR::LEMON - Graph Library

Changeset 491:4804c967543d in lemon-0.x


Ignore:
Timestamp:
04/30/04 03:02:22 (16 years ago)
Author:
Mihaly Barasz
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@649
Message:

ingroup bug

Location:
src
Files:
11 edited

Legend:

Unmodified
Added
Removed
  • src/include/bin_heap.h

    r430 r491  
    6262#define BIN_HEAP_HH
    6363
    64 ///ingroup auxdat
     64///\ingroup auxdat
    6565///\file
    6666///\brief Binary Heap implementation.
  • src/include/dijkstra.h

    r459 r491  
    33#define HUGO_DIJKSTRA_H
    44
    5 ///ingroup galgs
     5///\ingroup galgs
    66///\file
    77///\brief Dijkstra algorithm.
  • src/include/error.h

    r490 r491  
    44#define HUGO_ERROR_H
    55
     6//! \ingroup misc
    67//! \file
    78//! \brief Basic error handling (signaling) routines.
  • src/include/fib_heap.h

    r477 r491  
    44#define HUGO_FIB_HEAP_H
    55
    6 ///ingroup auxdat
     6///\ingroup auxdat
    77///\file
    88///\brief Fibonacci Heap implementation.
  • src/include/smart_graph.h

    r456 r491  
    44#define HUGO_SMART_GRAPH_H
    55
    6 ///ingroup graphs
     6///\ingroup graphs
    77///\file
    88///\brief SmartGraph and SymSmartGraph classes.
  • src/include/time_measure.h

    r458 r491  
    33#define HUGO_TIME_MEASURE_H
    44
    5 ///ingroup misc
     5///\ingroup misc
    66///\file
    77///\brief Tools for measuring cpu usage
  • src/include/unionfind.h

    r483 r491  
    33#define HUGO_UNION_FIND_H
    44
    5 //!ingroup auxdat
     5//!\ingroup auxdat
    66//!\file
    77//!\brief Union-Find data structures.
  • src/include/xy.h

    r458 r491  
    55#include <iostream>
    66
    7 ///ingroup misc
     7///\ingroup misc
    88///\file
    99///\brief A simple two dimensional vector and a bounding box implementation
  • src/work/alpar/list_graph.h

    r408 r491  
    44#define HUGO_LIST_GRAPH_H
    55
    6 ///ingroup graphs
     6///\ingroup graphs
    77///\file
    88///\brief ListGraph, SymListGraph, NodeSet and EdgeSet classes.
  • src/work/athos/minlengthpaths.h

    r456 r491  
    33#define HUGO_MINLENGTHPATHS_H
    44
    5 ///ingroup galgs
     5///\ingroup galgs
    66///\file
    77///\brief An algorithm for finding k paths of minimal total length.
  • src/work/marci/graph_wrapper.h

    r457 r491  
    33#define HUGO_GRAPH_WRAPPER_H
    44
    5 ///ingroup gwrappers
     5///\ingroup gwrappers
    66///\file
    77///\brief Several graph wrappers.
Note: See TracChangeset for help on using the changeset viewer.