COIN-OR::LEMON - Graph Library

Changeset 169:5b507a86ad72 in lemon


Ignore:
Timestamp:
06/15/08 09:19:53 (11 years ago)
Author:
Peter Kovacs <kpeter@…>
Branch:
default
Phase:
public
Message:

Fix various rename bugs

Location:
lemon
Files:
3 edited

Legend:

Unmodified
Added
Removed
  • lemon/concepts/graph_components.h

    r107 r169  
    14251425          typename _Graph::Node node;
    14261426          graph.erase(node);
    1427           typename _Graph::Arc arc;
    1428           graph.erase(arc);
     1427          typename _Graph::Edge edge;
     1428          graph.erase(edge);
    14291429        }
    14301430
  • lemon/dijkstra.h

    r157 r169  
    2323///\file
    2424///\brief Dijkstra algorithm.
    25 ///
    26 
    27 #include <lemon/list_digraph.h>
     25
     26#include <lemon/list_graph.h>
    2827#include <lemon/bin_heap.h>
    2928#include <lemon/bits/path_dump.h>
     
    3130#include <lemon/error.h>
    3231#include <lemon/maps.h>
    33 
    3432
    3533namespace lemon {
  • lemon/graph_utils.h

    r157 r169  
    403403            g.firstInc(e, b, u);
    404404          } else {
    405             b = g.source(e) == u;
     405            b = g.u(e) == u;
    406406            g.nextInc(e, b);
    407407          }
    408           while (e != INVALID && (b ? g.target(e) : g.source(e)) != v) {
     408          while (e != INVALID && (b ? g.v(e) : g.u(e)) != v) {
    409409            g.nextInc(e, b);
    410410          }
     
    416416            g.nextInc(e, b);
    417417          }
    418           while (e != INVALID && (!b || g.target(e) != v)) {
     418          while (e != INVALID && (!b || g.v(e) != v)) {
    419419            g.nextInc(e, b);
    420420          }
     
    456456  ///\endcode
    457457  ///
    458   ///\sa ConArcIt
     458  ///\sa ConEdgeIt
    459459
    460460  template <typename Graph>
     
    505505    /// It increments the iterator and gives back the next edge.
    506506    ConEdgeIt& operator++() {
    507       Parent::operator=(findEdge(_graph, _graph.source(*this),
    508                                  _graph.target(*this), *this));
     507      Parent::operator=(findEdge(_graph, _graph.u(*this),
     508                                 _graph.v(*this), *this));
    509509      return *this;
    510510    }
Note: See TracChangeset for help on using the changeset viewer.