1.1 --- a/lemon/min_cost_arborescence.h	Sat Apr 18 21:54:30 2009 +0200
     1.2 +++ b/lemon/min_cost_arborescence.h	Tue Apr 21 10:34:49 2009 +0100
     1.3 @@ -90,10 +90,10 @@
     1.4  
     1.5    /// \ingroup spantree
     1.6    ///
     1.7 -  /// \brief %MinCostArborescence algorithm class.
     1.8 +  /// \brief Minimum Cost Arborescence algorithm class.
     1.9    ///
    1.10    /// This class provides an efficient implementation of
    1.11 -  /// %MinCostArborescence algorithm. The arborescence is a tree
    1.12 +  /// Minimum Cost Arborescence algorithm. The arborescence is a tree
    1.13    /// which is directed from a given source node of the digraph. One or
    1.14    /// more sources should be given for the algorithm and it will calculate
    1.15    /// the minimum cost subgraph which are union of arborescences with the
    1.16 @@ -293,7 +293,7 @@
    1.17            minimum = (*_cost_arcs)[nodes[i]];
    1.18          }
    1.19        }
    1.20 -      _arc_order->set(minimum.arc, _dual_variables.size());
    1.21 +      (*_arc_order)[minimum.arc] = _dual_variables.size();
    1.22        DualVariable var(_dual_node_list.size() - 1,
    1.23                         _dual_node_list.size(), minimum.value);
    1.24        _dual_variables.push_back(var);
    1.25 @@ -335,7 +335,7 @@
    1.26            minimum = (*_cost_arcs)[nodes[i]];
    1.27          }
    1.28        }
    1.29 -      _arc_order->set(minimum.arc, _dual_variables.size());
    1.30 +      (*_arc_order)[minimum.arc] = _dual_variables.size();
    1.31        DualVariable var(node_bottom, _dual_node_list.size(), minimum.value);
    1.32        _dual_variables.push_back(var);
    1.33        StackLevel level;
    1.34 @@ -364,7 +364,7 @@
    1.35        while (!_heap->empty()) {
    1.36          Node source = _heap->top();
    1.37          _heap->pop();
    1.38 -        _node_order->set(source, -1);
    1.39 +        (*_node_order)[source] = -1;
    1.40          for (OutArcIt it(*_digraph, source); it != INVALID; ++it) {
    1.41            if ((*_arc_order)[it] < 0) continue;
    1.42            Node target = _digraph->target(it);
    1.43 @@ -390,7 +390,7 @@
    1.44  
    1.45    public:
    1.46  
    1.47 -    /// \name Named template parameters
    1.48 +    /// \name Named Template Parameters
    1.49  
    1.50      /// @{
    1.51  
    1.52 @@ -630,7 +630,7 @@
    1.53  
    1.54      /// @}
    1.55  
    1.56 -    /// \name Execution control
    1.57 +    /// \name Execution Control
    1.58      /// The simplest way to execute the algorithm is to use
    1.59      /// one of the member functions called \c run(...). \n
    1.60      /// If you need more control on the execution,
    1.61 @@ -650,13 +650,13 @@
    1.62        _heap->clear();
    1.63        for (NodeIt it(*_digraph); it != INVALID; ++it) {
    1.64          (*_cost_arcs)[it].arc = INVALID;
    1.65 -        _node_order->set(it, -3);
    1.66 -        _heap_cross_ref->set(it, Heap::PRE_HEAP);
    1.67 +        (*_node_order)[it] = -3;
    1.68 +        (*_heap_cross_ref)[it] = Heap::PRE_HEAP;
    1.69          _pred->set(it, INVALID);
    1.70        }
    1.71        for (ArcIt it(*_digraph); it != INVALID; ++it) {
    1.72          _arborescence->set(it, false);
    1.73 -        _arc_order->set(it, -1);
    1.74 +        (*_arc_order)[it] = -1;
    1.75        }
    1.76        _dual_node_list.clear();
    1.77        _dual_variables.clear();