Changeset 2522:616c019215c4 in lemon-0.x for lemon/goldberg_tarjan.h
- Timestamp:
- 11/27/07 16:41:43 (16 years ago)
- Branch:
- default
- Phase:
- public
- Convert:
- svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3398
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
lemon/goldberg_tarjan.h
r2518 r2522 104 104 /// DynamicTree "dynamic tree" data structure of Sleator and Tarjan. 105 105 /// 106 /// The original preflow algorithm with \e "highest label" or \e107 /// FIFO heuristic has \f$O(n^3)\f$ time complexity. The current108 /// algorithm improved this complexity to109 /// \f$O(nm\log(\frac{n^2}{m}))\f$. The algorithm builds limited110 /// size dynamic trees on the residual graph, which can be used to111 /// make multilevel push operations and gives a better bound on the112 /// number of non-saturating pushes.106 /// The original preflow algorithm with \e highest \e label 107 /// heuristic has \f$O(n^2\sqrt{e})\f$ or with \e FIFO heuristic has 108 /// \f$O(n^3)\f$ time complexity. The current algorithm improved 109 /// this complexity to \f$O(nm\log(\frac{n^2}{m}))\f$. The algorithm 110 /// builds limited size dynamic trees on the residual graph, which 111 /// can be used to make multilevel push operations and gives a 112 /// better bound on the number of non-saturating pushes. 113 113 /// 114 114 /// \param Graph The directed graph type the algorithm runs on. … … 966 966 /// @} 967 967 968 /// \name Query Functions 969 /// The result of the %Dijkstra algorithm can be obtained using these 970 /// functions.\n 971 /// Before the use of these functions, 972 /// either run() or start() must be called. 968 /// \name Query Functions 969 /// The result of the Goldberg-Tarjan algorithm can be obtained 970 /// using these functions. 971 /// \n 972 /// Before the use of these functions, either run() or start() must 973 /// be called. 973 974 974 975 ///@{
Note: See TracChangeset
for help on using the changeset viewer.