COIN-OR::LEMON - Graph Library

Changeset 1946:17eb3eaad9f8 in lemon-0.x for lemon/dag_shortest_path.h


Ignore:
Timestamp:
02/02/06 18:43:24 (14 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2521
Message:
  • workaround for a Doxygen 1.4.6 bug
  • other doc fixes
File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/dag_shortest_path.h

    r1912 r1946  
    117117    ///
    118118    /// This function instantiates a \ref PredMap.
    119     /// \param G is the graph, to which we would like to define the PredMap.
     119    /// \param graph is the graph, to which we would
     120    /// like to define the PredMap.
    120121    /// \todo The graph alone may be insufficient for the initialization
    121122    static PredMap *createPredMap(const _Graph& graph) {
     
    134135    ///
    135136    /// This function instantiates a \ref DistMap.
    136     /// \param G is the graph, to which we would like to define the
     137    /// \param graph is the graph, to which we would like to define the
    137138    /// \ref DistMap
    138139    static DistMap *createDistMap(const _Graph& graph) {
     
    228229    ///
    229230    /// This function instantiates a \ref PredMap.
    230     /// \param G is the graph, to which we would like to define the PredMap.
     231    /// \param graph is the graph,
     232    /// to which we would like to define the PredMap.
    231233    /// \todo The graph alone may be insufficient for the initialization
    232234    static PredMap *createPredMap(const _Graph& graph) {
     
    245247    ///
    246248    /// This function instantiates a \ref DistMap.
    247     /// \param G is the graph, to which we would like to define the
     249    /// \param graph is the graph, to which we would like to define the
    248250    /// \ref DistMap
    249251    static DistMap *createDistMap(const _Graph& graph) {
     
    682684    ///
    683685    /// \note d.run(s) is just a shortcut of the following code.
    684     /// \code
     686    ///\code
    685687    ///  d.init();
    686688    ///  d.addSource(s);
    687689    ///  d.start();
    688     /// \endcode
     690    ///\endcode
    689691    void run(Node s) {
    690692      init();
     
    978980    ///
    979981    /// Runs DagShortestPath algorithm from the given node.
    980     /// \param s is the given source.
     982    /// \param source is the given source.
    981983    void run(Node source) {
    982984      Base::_source = source;
     
    10431045    ///
    10441046    /// Sets the source node, from which the DagShortestPath algorithm runs.
    1045     /// \param s is the source node.
     1047    /// \param source is the source node.
    10461048    DagShortestPathWizard<_Traits>& source(Node source) {
    10471049      Base::_source = source;
     
    10611063  /// The following
    10621064  /// example shows how to use these parameters.
    1063   /// \code
     1065  ///\code
    10641066  /// dagShortestPath(g,length,source).predMap(preds).run();
    1065   /// \endcode
     1067  ///\endcode
    10661068  /// \warning Don't forget to put the \ref DagShortestPathWizard::run() "run()"
    10671069  /// to the end of the parameter list.
Note: See TracChangeset for help on using the changeset viewer.