Changeset 1081:f1398882a928 in lemon for lemon/hao_orlin.h
 Timestamp:
 08/08/11 12:36:16 (9 years ago)
 Branch:
 1.1
 Phase:
 public
 Tags:
 r1.1.4
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/hao_orlin.h
r644 r1081 3 3 * This file is a part of LEMON, a generic C++ optimization library. 4 4 * 5 * Copyright (C) 200320 095 * Copyright (C) 20032011 6 6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport 7 7 * (Egervary Research Group on Combinatorial Optimization, EGRES). … … 32 32 /// \brief Implementation of the HaoOrlin algorithm. 33 33 /// 34 /// Implementation of the HaoOrlin algorithm for finding a minimum cut 34 /// Implementation of the HaoOrlin algorithm for finding a minimum cut 35 35 /// in a digraph. 36 36 … … 42 42 /// 43 43 /// This class implements the HaoOrlin algorithm for finding a minimum 44 /// value cut in a directed graph \f$D=(V,A)\f$. 44 /// value cut in a directed graph \f$D=(V,A)\f$. 45 45 /// It takes a fixed node \f$ source \in V \f$ and 46 46 /// consists of two phases: in the first phase it determines a … … 59 59 /// For an undirected graph you can run just the first phase of the 60 60 /// algorithm or you can use the algorithm of Nagamochi and Ibaraki, 61 /// which solves the undirected problem in \f$ O(nm + n^2 \log n) \f$ 61 /// which solves the undirected problem in \f$ O(nm + n^2 \log n) \f$ 62 62 /// time. It is implemented in the NagamochiIbaraki algorithm class. 63 63 /// … … 77 77 class HaoOrlin { 78 78 public: 79 79 80 80 /// The digraph type of the algorithm 81 81 typedef GR Digraph; … … 848 848 /// 849 849 /// This function initializes the internal data structures. It creates 850 /// the maps and some bucket structures for the algorithm. 850 /// the maps and some bucket structures for the algorithm. 851 851 /// The given node is used as the source node for the pushrelabel 852 852 /// algorithm. … … 928 928 /// \brief Run the algorithm. 929 929 /// 930 /// This function runs the algorithm. It uses the given \c source node, 930 /// This function runs the algorithm. It uses the given \c source node, 931 931 /// finds a proper \c target node and then calls the \ref init(), 932 932 /// \ref calculateOut() and \ref calculateIn(). … … 942 942 /// The result of the %HaoOrlin algorithm 943 943 /// can be obtained using these functions.\n 944 /// \ref run(), \ref calculateOut() or \ref calculateIn() 944 /// \ref run(), \ref calculateOut() or \ref calculateIn() 945 945 /// should be called before using them. 946 946 … … 951 951 /// This function returns the value of the minimum cut. 952 952 /// 953 /// \pre \ref run(), \ref calculateOut() or \ref calculateIn() 953 /// \pre \ref run(), \ref calculateOut() or \ref calculateIn() 954 954 /// must be called before using this function. 955 955 Value minCutValue() const { … … 970 970 /// \return The value of the minimum cut. 971 971 /// 972 /// \pre \ref run(), \ref calculateOut() or \ref calculateIn() 972 /// \pre \ref run(), \ref calculateOut() or \ref calculateIn() 973 973 /// must be called before using this function. 974 974 template <typename CutMap>
Note: See TracChangeset
for help on using the changeset viewer.