COIN-OR::LEMON - Graph Library

Changeset 296:09d6d48815a5 in lemon-0.x


Ignore:
Timestamp:
04/05/04 15:55:55 (16 years ago)
Author:
Alpar Juttner
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@414
Message:

Swept out some deprecated comments

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/include/dijkstra.h

    r276 r296  
    7070            typename LengthMap=typename Graph::EdgeMap<int>,
    7171            template <class,class,class> class Heap = BinHeap >
    72 //          typename Heap=BinHeap <typename Graph::Node,
    73 //                                 typename LengthMap::ValueType,
    74 //                                 typename Graph::NodeMap<int> > >
    7572#endif
    7673  class Dijkstra{
     
    9087    const LengthMap& length;
    9188    PredMap predecessor;
    92     //In place of reach:
    9389    PredNodeMap pred_node;
    9490    DistMap distance;
    95     //I don't like this:
    96     //     //FIXME:
    97     //     typename Graph::NodeMap<bool> reach;
    98     //     //typename Graph::NodeMap<int> reach;
    9991   
    10092  public :
    10193   
    102     /*
    103       The distance of the nodes is 0.
    104     */
    10594    Dijkstra(Graph& _G, LengthMap& _length) :
    10695      G(_G), length(_length), predecessor(_G), pred_node(_G), distance(_G) { }
     
    147136    ///\pre \ref run() must be called before using this function.
    148137    const PredNodeMap &predNodeMap() const { return pred_node;}
    149 
    150     //    bool reached(Node v) { return reach[v]; }
    151138
    152139    ///Checks if a node is reachable from the source.
     
    187174    }
    188175   
    189     //We don't need it at all.
    190     //     //FIXME:
    191     //     typename Graph::NodeMap<bool> scanned(G,false);
    192     //     //typename Graph::NodeMap<int> scanned(G,false);
    193176    typename Graph::NodeMap<int> heap_map(G,-1);
    194177   
    195     //Heap heap(heap_map);
    196178    Heap<Node,ValueType,typename Graph::NodeMap<int> > heap(heap_map);
    197179   
    198180    heap.push(s,0);
    199     //    reach.set(s, true);
    200181   
    201182      while ( !heap.empty() ) {
     
    212193          switch(heap.state(w)) {
    213194          case heap.PRE_HEAP:
    214             //      reach.set(w,true);
    215195            heap.push(w,oldvalue+length[e]);
    216196            predecessor.set(w,e);
Note: See TracChangeset for help on using the changeset viewer.