95 /// %MinCostArborescence algorithm. The arborescence is a tree |
95 /// %MinCostArborescence algorithm. The arborescence is a tree |
96 /// which is directed from a given source node of the graph. One or |
96 /// which is directed from a given source node of the graph. One or |
97 /// more sources should be given for the algorithm and it will calculate |
97 /// more sources should be given for the algorithm and it will calculate |
98 /// the minimum cost subgraph which are union of arborescences with the |
98 /// the minimum cost subgraph which are union of arborescences with the |
99 /// given sources and spans all the nodes which are reachable from the |
99 /// given sources and spans all the nodes which are reachable from the |
100 /// sources. The time complexity of the algorithm is O(n^2 + e). |
100 /// sources. The time complexity of the algorithm is \f$ O(n^2+e) \f$. |
101 /// |
101 /// |
102 /// The algorithm provides also an optimal dual solution to arborescence |
102 /// The algorithm provides also an optimal dual solution to arborescence |
103 /// that way the optimality of the algorithm can be proofed easily. |
103 /// that way the optimality of the solution can be proofed easily. |
104 /// |
104 /// |
105 /// \param _Graph The graph type the algorithm runs on. The default value |
105 /// \param _Graph The graph type the algorithm runs on. The default value |
106 /// is \ref ListGraph. The value of _Graph is not used directly by |
106 /// is \ref ListGraph. The value of _Graph is not used directly by |
107 /// MinCostArborescence, it is only passed to |
107 /// MinCostArborescence, it is only passed to |
108 /// \ref MinCostArborescenceDefaultTraits. |
108 /// \ref MinCostArborescenceDefaultTraits. |