equal
deleted
inserted
replaced
43 typedef _Graph Graph; |
43 typedef _Graph Graph; |
44 |
44 |
45 /// \brief The type of the map that stores the edge costs. |
45 /// \brief The type of the map that stores the edge costs. |
46 /// |
46 /// |
47 /// The type of the map that stores the edge costs. |
47 /// The type of the map that stores the edge costs. |
48 /// It must meet the \ref concept::ReadMap "ReadMap" concept. |
48 /// It must meet the \ref concepts::ReadMap "ReadMap" concept. |
49 typedef _CostMap CostMap; |
49 typedef _CostMap CostMap; |
50 |
50 |
51 /// \brief The value type of the costs. |
51 /// \brief The value type of the costs. |
52 /// |
52 /// |
53 /// The value type of the costs. |
53 /// The value type of the costs. |
55 |
55 |
56 /// \brief The type of the map that stores which edges are |
56 /// \brief The type of the map that stores which edges are |
57 /// in the arborescence. |
57 /// in the arborescence. |
58 /// |
58 /// |
59 /// The type of the map that stores which edges are in the arborescence. |
59 /// The type of the map that stores which edges are in the arborescence. |
60 /// It must meet the \ref concept::WriteMap "WriteMap" concept. |
60 /// It must meet the \ref concepts::WriteMap "WriteMap" concept. |
61 /// Initially it will be set to false on each edge. After it |
61 /// Initially it will be set to false on each edge. After it |
62 /// will set all arborescence edges once. |
62 /// will set all arborescence edges once. |
63 typedef typename Graph::template EdgeMap<bool> ArborescenceMap; |
63 typedef typename Graph::template EdgeMap<bool> ArborescenceMap; |
64 |
64 |
65 /// \brief Instantiates a ArborescenceMap. |
65 /// \brief Instantiates a ArborescenceMap. |
108 /// \ref MinCostArborescenceDefaultTraits. |
108 /// \ref MinCostArborescenceDefaultTraits. |
109 /// \param _CostMap This read-only EdgeMap determines the costs of the |
109 /// \param _CostMap This read-only EdgeMap determines the costs of the |
110 /// edges. It is read once for each edge, so the map may involve in |
110 /// edges. It is read once for each edge, so the map may involve in |
111 /// relatively time consuming process to compute the edge cost if |
111 /// relatively time consuming process to compute the edge cost if |
112 /// it is necessary. The default map type is \ref |
112 /// it is necessary. The default map type is \ref |
113 /// concept::Graph::EdgeMap "Graph::EdgeMap<int>". The value |
113 /// concepts::Graph::EdgeMap "Graph::EdgeMap<int>". The value |
114 /// of _CostMap is not used directly by MinCostArborescence, |
114 /// of _CostMap is not used directly by MinCostArborescence, |
115 /// it is only passed to \ref MinCostArborescenceDefaultTraits. |
115 /// it is only passed to \ref MinCostArborescenceDefaultTraits. |
116 /// \param _Traits Traits class to set various data types used |
116 /// \param _Traits Traits class to set various data types used |
117 /// by the algorithm. The default traits class is |
117 /// by the algorithm. The default traits class is |
118 /// \ref MinCostArborescenceDefaultTraits |
118 /// \ref MinCostArborescenceDefaultTraits |