COIN-OR::LEMON - Graph Library

Changeset 967:6563019430ba in lemon-0.x for src/work


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

Several changes in doc.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/alpar/dijkstra.h

    r959 r967  
    4343    ///The type of the map that stores the edge lengths.
    4444
    45     ///It must meet the \ref ReadMap concept.
     45    ///It must meet the \ref concept::ReadMap "ReadMap" concept.
    4646    ///
    4747    typedef LM LengthMap;
     
    4949    typedef typename LM::ValueType ValueType;
    5050    ///The heap type used by Dijkstra algorithm.
     51
     52    ///The heap type used by Dijkstra algorithm.
     53    ///
     54    ///\sa BinHeap
     55    ///\sa Dijkstra
    5156    typedef BinHeap<typename Graph::Node,
    5257                    typename LM::ValueType,
     
    5762    ///edges of the shortest paths.
    5863    ///
    59     ///It must meet the \ref WriteMap concept.
     64    ///It must meet the \ref concept::WriteMap "WriteMap" concept.
    6065    ///
    6166    typedef typename Graph::template NodeMap<typename GR::Edge> PredMap;
     
    7176    ///nodes of the shortest paths.
    7277    ///
    73     ///It must meet the \ref WriteMap concept.
     78    ///It must meet the \ref concept::WriteMap "WriteMap" concept.
    7479    ///
    7580    typedef typename Graph::template NodeMap<typename GR::Node> PredNodeMap;
     
    7782 
    7883    ///\todo Please document...
    79     /// 
     84    ///
    8085    static PredNodeMap *createPredNodeMap(const GR &G)
    8186    {
     
    8489    ///The type of the map that stores the dists of the nodes.
    8590 
    86     ///It must meet the \ref WriteMap concept.
     91    ///It must meet the \ref concept::WriteMap "WriteMap" concept.
    8792    ///
    8893    typedef typename Graph::template NodeMap<typename LM::ValueType> DistMap;
     
    167172    ///The heap type used by the dijkstra algorithm.
    168173    typedef typename TR::Heap Heap;
    169 
    170174  private:
    171175    /// Pointer to the underlying graph.
     
    225229    ///\ref named-templ-param "Named parameter" for setting PredMap type
    226230
     231    ///\relates Dijkstra
    227232    ///\ingroup flowalgs
    228233    ///\ref named-templ-param "Named parameter" for setting PredMap type
Note: See TracChangeset for help on using the changeset viewer.