COIN-OR::LEMON - Graph Library

Changeset 208:1e36245f905d in lemon-0.x for src/work/list_graph.h


Ignore:
Timestamp:
03/19/04 16:41:58 (16 years ago)
Author:
marci
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@300
Message:

warnings

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/work/list_graph.h

    r174 r208  
    429429      //protected:
    430430    public: //for alpar
    431       EdgeIt(const ListGraph& G) {
     431      EdgeIt(const ListGraph&) {
    432432        node_item* v=G._first_node;
    433433        if (v) edge=v->_first_out_edge; else edge=0;
     
    456456      OutEdgeIt() : Edge()/*, v(0)*/ { }
    457457      OutEdgeIt(const Invalid& i) : Edge(i) { }
    458       OutEdgeIt(const ListGraph& G, Node _v) /*: v(_v.node)*/ { edge=_v.node->_first_out_edge; }
     458      OutEdgeIt(const ListGraph&, Node _v) /*: v(_v.node)*/ { edge=_v.node->_first_out_edge; }
    459459    protected:
    460460      OutEdgeIt& operator++() { edge=edge->_next_out; return *this; }
     
    473473      InEdgeIt() : Edge()/*, v(0)*/ { }
    474474      InEdgeIt(const Invalid& i) : Edge(i) { }
    475       InEdgeIt(const ListGraph& G, Node _v) /*: v(_v.node)*/ { edge=_v.node->_first_in_edge; }
     475      InEdgeIt(const ListGraph&, Node _v) /*: v(_v.node)*/ { edge=_v.node->_first_in_edge; }
    476476    protected:
    477477      InEdgeIt& operator++() { edge=edge->_next_in; return *this; }
     
    495495      SymEdgeIt() : Edge() /*, v(0)*/ { }
    496496      SymEdgeIt(const Invalid& i) : Edge(i) { }
    497       SymEdgeIt(const ListGraph& G, Node _v) /*: v(_v.node)*/ {
     497      SymEdgeIt(const ListGraph&, Node _v) /*: v(_v.node)*/ {
    498498        out_or_in=1;
    499499        edge=_v.node->_first_out_edge;
Note: See TracChangeset for help on using the changeset viewer.