equal
deleted
inserted
replaced
99 /// Minimum Cost Arborescence algorithm. The arborescence is a tree |
99 /// Minimum Cost Arborescence algorithm. The arborescence is a tree |
100 /// which is directed from a given source node of the digraph. One or |
100 /// which is directed from a given source node of the digraph. One or |
101 /// more sources should be given to the algorithm and it will calculate |
101 /// more sources should be given to the algorithm and it will calculate |
102 /// the minimum cost subgraph that is the union of arborescences with the |
102 /// the minimum cost subgraph that is the union of arborescences with the |
103 /// given sources and spans all the nodes which are reachable from the |
103 /// given sources and spans all the nodes which are reachable from the |
104 /// sources. The time complexity of the algorithm is O(n<sup>2</sup>+e). |
104 /// sources. The time complexity of the algorithm is O(n<sup>2</sup>+m). |
105 /// |
105 /// |
106 /// The algorithm also provides an optimal dual solution, therefore |
106 /// The algorithm also provides an optimal dual solution, therefore |
107 /// the optimality of the solution can be checked. |
107 /// the optimality of the solution can be checked. |
108 /// |
108 /// |
109 /// \param GR The digraph type the algorithm runs on. |
109 /// \param GR The digraph type the algorithm runs on. |