COIN-OR::LEMON - Graph Library

Changeset 785:a9b0863c2265 in lemon-0.x


Ignore:
Timestamp:
09/02/04 17:13:21 (16 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1078
Message:

Changes in doc. (New module name for array/vector maps added.)

Files:
7 edited

Legend:

Unmodified
Added
Removed
  • doc/groups.dox

    r774 r785  
    3434
    3535/**
     36@defgroup graphmapfactory Tools to Make It Easier to Make Graph Maps
     37@ingroup auxdat
     38\brief Tools to Make It Easier to Make Graph Maps.
     39
     40This group describes the tools that makes it easier to make graph maps that
     41dynamically update with the graph changes.
     42*/
     43
     44/**
    3645@defgroup gwrappers Wrapper Classes for Graphs
    3746\brief This group contains several wrapper classes for graphs
  • src/hugo/array_map_factory.h

    r783 r785  
    77#include <hugo/extended_pair.h>
    88
     9///\ingroup graphmapfactory
     10///\file
     11///\brief Graph maps that construates and destruates
     12///their elements dynamically.
     13
    914namespace hugo {
    1015       
     16/// \addtogroup graphmapfactory
     17/// @{
     18
     19  ///.
    1120  template <typename MapRegistry> class ArrayMapFactory {
    1221               
     
    363372    };         
    364373  };
     374 
     375/// @}
     376 
     377
    365378}
    366379
  • src/hugo/dijkstra.h

    r780 r785  
    8888    Node source;
    8989
    90     ///Initialize maps
     90    ///Initializes the maps.
    9191   
    9292    ///\todo Error if \c G or are \c NULL. What about \c length?
     
    133133    ///Sets the graph the algorithm will run on.
    134134    ///\return <tt> (*this) </tt>
     135    ///\bug What about maps?
     136    ///\todo It may be unnecessary
    135137    Dijkstra &setGraph(const Graph &_G)
    136138    {
     
    274276
    275277    ///For a node \c v it returns the 'previous edge' of the shortest path tree,
    276     ///i.e. it returns the last edge from a shortest path from the root to \c
     278    ///i.e. it returns the last edge of a shortest path from the root to \c
    277279    ///v. It is \ref INVALID
    278280    ///if \c v is unreachable from the root or if \c v=s. The
     
    323325  };
    324326 
    325 
    326   // **********************************************************************
    327   //  IMPLEMENTATIONS
    328   // **********************************************************************
    329 
    330327/// @}
    331328 
  • src/hugo/map_defines.h

    r782 r785  
    22#ifndef MAP_DEFINES_H
    33#define MAP_DEFINES_H
     4
     5///\ingroup graphmapfactory
     6///\file
     7///\brief Defines to help creating graph maps.
     8
     9/// \addtogroup graphmapfactory
     10/// @{
    411
    512/** Creates the EdgeMapRegistry type an declare a mutable instance
     
    210217    };
    211218
     219 
     220/// @}
     221 
    212222#endif
  • src/hugo/map_registry.h

    r783 r785  
    55#include <vector>
    66
     7///\ingroup graphmapfactory
     8///\file
     9///\brief Map registry for graph maps.
     10
    711using namespace std;
    812
    913namespace hugo {
     14
     15/// \addtogroup graphmapfactory
     16/// @{
    1017
    1118/**
     
    262269  };
    263270
     271 
     272/// @}
     273 
     274
    264275}
    265276
  • src/hugo/mincostflows.h

    r776 r785  
    9090    //To store the flow
    9191    EdgeIntMap flow;
    92     //To store the potentila (dual variables)
     92    //To store the potential (dual variables)
    9393    typedef typename Graph::template NodeMap<Length> PotentialMap;
    9494    PotentialMap potential;
  • src/hugo/vector_map_factory.h

    r782 r785  
    77#include <hugo/extended_pair.h>
    88
     9///\ingroup graphmapfactory
     10///\file
     11///\brief Vector based graph maps.
     12
    913namespace hugo {
    10 
     14 
     15  /// \addtogroup graphmapfactory
     16  /// @{
     17 
    1118  /** The VectorMapFactory template class is a factory class
    1219   *  to create maps for the edge and nodes. This map factory
     
    334341  };
    335342
     343 
     344  /// @}
     345 
     346
    336347}
    337348
Note: See TracChangeset for help on using the changeset viewer.