Changeset 1858:a5b6d941ed52 in lemon-0.x

Timestamp:

12/14/05 19:07:28 (18 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2430

Message:

Bug fix in def pred map

File:

• lemon/belmann_ford.h (modified) (8 diffs)

lemon/belmann_ford.h

@@ -18 +18 @@
 #define LEMON_BELMANN_FORD_H
 
-///\ingroup flowalgs
+/// \ingroup flowalgs
 /// \file
 /// \brief BelmannFord algorithm.
@@ -116 +116 @@
     /// 
     /// This function instantiates a \ref PredMap. 
-    /// \param G is the graph, to which we would like to define the PredMap.
-    /// \todo The graph alone may be insufficient for the initialization
+    /// \param graph is the graph, to which we would like to define the PredMap.
     static PredMap *createPredMap(const _Graph& graph) {
       return new PredMap(graph);
@@ -133 +132 @@
     ///
     /// This function instantiates a \ref DistMap. 
-    /// \param G is the graph, to which we would like to define the 
+    /// \param graph is the graph, to which we would like to define the 
     /// \ref DistMap
     static DistMap *createDistMap(const _Graph& graph) {
@@ -270 +269 @@
     ///
     template <class T>
-    struct DefPredMap {
+    struct DefPredMap 
+      : public BelmannFord< Graph, LengthMap, DefPredMapTraits<T> > {
       typedef BelmannFord< Graph, LengthMap, DefPredMapTraits<T> > Create;
     };
@@ -423 +423 @@
     /// distances strictly for all at most k + 1 length paths. With k
     /// iteration this function calculates the at most k length paths.
-    ///\todo what is the return value?
+    /// \return %True when the algorithm have not found more shorter paths.
     bool processNextRound() {
       for (int i = 0; i < (int)_process.size(); ++i) {
@@ -459 +459 @@
     /// at most k length minimal paths, this is why it is
     /// called just weak round.
-    ///\todo what is the return value?
+    /// \return %True when the algorithm have not found more shorter paths.
     bool processNextWeakRound() {
       for (int i = 0; i < (int)_process.size(); ++i) {
@@ -846 +846 @@
     ///
     /// Runs BelmannFord algorithm from the given node.
-    /// \param s is the given source.
+    /// \param source is the given source.
     void run(Node source) {
       Base::_source = source;
@@ -911 +911 @@
     ///
     /// Sets the source node, from which the BelmannFord algorithm runs.
-    /// \param s is the source node.
+    /// \param source is the source node.
     BelmannFordWizard<_Traits>& source(Node source) {
       Base::_source = source;