COIN-OR::LEMON - Graph Library

Changeset 785:a9b0863c2265 in lemon-0.x for src/hugo/dijkstra.h


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.)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • 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 
Note: See TracChangeset for help on using the changeset viewer.