1.1 --- a/lemon/min_cost_arborescence.h Fri Aug 05 09:33:42 2011 +0200
1.2 +++ b/lemon/min_cost_arborescence.h Mon Aug 08 12:36:16 2011 +0200
1.3 @@ -2,7 +2,7 @@
1.4 *
1.5 * This file is a part of LEMON, a generic C++ optimization library.
1.6 *
1.7 - * Copyright (C) 2003-2008
1.8 + * Copyright (C) 2003-2011
1.9 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport
1.10 * (Egervary Research Group on Combinatorial Optimization, EGRES).
1.11 *
1.12 @@ -127,8 +127,8 @@
1.13 class MinCostArborescence {
1.14 public:
1.15
1.16 - /// \brief The \ref MinCostArborescenceDefaultTraits "traits class"
1.17 - /// of the algorithm.
1.18 + /// \brief The \ref MinCostArborescenceDefaultTraits "traits class"
1.19 + /// of the algorithm.
1.20 typedef TR Traits;
1.21 /// The type of the underlying digraph.
1.22 typedef typename Traits::Digraph Digraph;
1.23 @@ -435,7 +435,7 @@
1.24 ///
1.25 /// \ref named-templ-param "Named parameter" for setting
1.26 /// \c PredMap type.
1.27 - /// It must meet the \ref concepts::WriteMap "WriteMap" concept,
1.28 + /// It must meet the \ref concepts::WriteMap "WriteMap" concept,
1.29 /// and its value type must be the \c Arc type of the digraph.
1.30 template <class T>
1.31 struct SetPredMap