Changeset 2042:bdc953f2a449 in lemon-0.x for lemon/min_cost_arborescence.h
- Timestamp:
- 04/07/06 11:54:35 (18 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2681
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/min_cost_arborescence.h
r2037 r2042 98 98 /// the minimum cost subgraph which are union of arborescences with the 99 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 102 /// The algorithm provides also an optimal dual solution to arborescence 103 /// that way the optimality of the algorithmcan be proofed easily.103 /// that way the optimality of the solution can be proofed easily. 104 104 /// 105 105 /// \param _Graph The graph type the algorithm runs on. The default value
Note: See TracChangeset
for help on using the changeset viewer.