COIN-OR::LEMON - Graph Library

Changeset 633:305bd9c56f10 in lemon-0.x for src/hugo/mincostflows.h


Ignore:
Timestamp:
05/13/04 18:00:18 (17 years ago)
Author:
athos
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@824
Message:

Slight modifications.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/hugo/mincostflows.h

    r611 r633  
    9393    typename Graph::template NodeMap<Length> potential;
    9494   
    95     //Container to store found paths
    96     //std::vector< std::vector<Edge> > paths;
    97     //typedef DirPath<Graph> DPath;
    98     //DPath paths;
    99 
    10095
    10196    Length total_length;
     
    152147        };
    153148       
     149        //We have to copy the potential
     150        FOR_EACH_LOC(typename ResGraphType::NodeIt, n, res_graph){
     151          potential[n] += dijkstra.distMap()[n];
     152        }
     153        /*
    154154        {
    155155          //We have to copy the potential
     
    159159          }
    160160        }
    161 
     161        */
    162162
    163163        //Augmenting on the sortest path
     
    226226    }
    227227   
    228     /*
    229       ///\todo To be implemented later
    230 
    231     ///This function gives back the \c j-th path in argument p.
    232     ///Assumes that \c run() has been run and nothing changed since then.
    233     /// \warning It is assumed that \c p is constructed to be a path of graph \c G. If \c j is greater than the result of previous \c run, then the result here will be an empty path.
    234     template<typename DirPath>
    235     void getPath(DirPath& p, int j){
    236       p.clear();
    237       typename DirPath::Builder B(p);
    238       for(typename std::vector<Edge>::iterator i=paths[j].begin();
    239           i!=paths[j].end(); ++i ){
    240         B.pushBack(*i);
    241       }
    242 
    243       B.commit();
    244     }
    245 
    246     */
    247228
    248229  }; //class MinCostFlows
     
    252233} //namespace hugo
    253234
    254 #endif //HUGO_MINCOSTFLOW_H
     235#endif //HUGO_MINCOSTFLOWS_H
Note: See TracChangeset for help on using the changeset viewer.