Changeset 1946:17eb3eaad9f8 in lemon0.x for lemon/dag_shortest_path.h
 Timestamp:
 02/02/06 18:43:24 (14 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2521
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/dag_shortest_path.h
r1912 r1946 117 117 /// 118 118 /// 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. 120 121 /// \todo The graph alone may be insufficient for the initialization 121 122 static PredMap *createPredMap(const _Graph& graph) { … … 134 135 /// 135 136 /// This function instantiates a \ref DistMap. 136 /// \param Gis the graph, to which we would like to define the137 /// \param graph is the graph, to which we would like to define the 137 138 /// \ref DistMap 138 139 static DistMap *createDistMap(const _Graph& graph) { … … 228 229 /// 229 230 /// 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. 231 233 /// \todo The graph alone may be insufficient for the initialization 232 234 static PredMap *createPredMap(const _Graph& graph) { … … 245 247 /// 246 248 /// This function instantiates a \ref DistMap. 247 /// \param Gis the graph, to which we would like to define the249 /// \param graph is the graph, to which we would like to define the 248 250 /// \ref DistMap 249 251 static DistMap *createDistMap(const _Graph& graph) { … … 682 684 /// 683 685 /// \note d.run(s) is just a shortcut of the following code. 684 /// 686 ///\code 685 687 /// d.init(); 686 688 /// d.addSource(s); 687 689 /// d.start(); 688 /// 690 ///\endcode 689 691 void run(Node s) { 690 692 init(); … … 978 980 /// 979 981 /// Runs DagShortestPath algorithm from the given node. 980 /// \param s is the given source.982 /// \param source is the given source. 981 983 void run(Node source) { 982 984 Base::_source = source; … … 1043 1045 /// 1044 1046 /// Sets the source node, from which the DagShortestPath algorithm runs. 1045 /// \param s is the source node.1047 /// \param source is the source node. 1046 1048 DagShortestPathWizard<_Traits>& source(Node source) { 1047 1049 Base::_source = source; … … 1061 1063 /// The following 1062 1064 /// example shows how to use these parameters. 1063 /// 1065 ///\code 1064 1066 /// dagShortestPath(g,length,source).predMap(preds).run(); 1065 /// 1067 ///\endcode 1066 1068 /// \warning Don't forget to put the \ref DagShortestPathWizard::run() "run()" 1067 1069 /// to the end of the parameter list.
Note: See TracChangeset
for help on using the changeset viewer.