Changeset 1527:7ceab500e1f6 in lemon0.x for lemon/suurballe.h
 Timestamp:
 07/01/05 12:33:27 (15 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2014
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/suurballe.h
r1435 r1527 40 40 /// edgeweighted directed graph having minimal total weight (length). 41 41 /// 42 ///\warning Length values should be nonnegative .42 ///\warning Length values should be nonnegative! 43 43 /// 44 44 ///\param Graph The directed graph type the algorithm runs on. … … 122 122 123 123 paths.clear(); 124 //total_length=0;125 124 paths.resize(k); 126 125 for (int j=0; j<i; ++j){ … … 136 135 n = G.target(e); 137 136 paths[j].push_back(e); 138 //total_length += length[e];139 137 reversed[e] = 1reversed[e]; 140 138 } … … 167 165 ///This function checks, whether the given solution is optimal. 168 166 ///Currently this function only checks optimality, 169 ///doesn't bother with feasibility 167 ///doesn't bother with feasibility. 170 168 ///It is meant for testing purposes. 171 169 bool checkComplementarySlackness(){ … … 176 174 177 175 ///This function gives back the \c jth path in argument p. 178 ///Assumes that \c run() has been run and nothing changed since then.176 ///Assumes that \c run() has been run and nothing has changed since then. 179 177 /// \warning It is assumed that \c p is constructed to 180 178 ///be a path of graph \c G. … … 183 181 /// 184 182 ///\param Path The type of the path structure to put the result to (must meet lemon path concept). 185 ///\param p The path to put the result to 186 ///\param j Which path you want to get from the found paths (in a real application you would get the found paths iteratively) 183 ///\param p The path to put the result to. 184 ///\param j Which path you want to get from the found paths (in a real application you would get the found paths iteratively). 187 185 template<typename Path> 188 186 void getPath(Path& p, size_t j){
Note: See TracChangeset
for help on using the changeset viewer.