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

Timestamp:

03/19/04 16:41:58 (21 years ago)

Author:

marci

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@300

Message:

warnings

File:

• src/work/list_graph.h (modified) (4 diffs)

src/work/list_graph.h

@@ -429 +429 @@
       //protected: 
     public: //for alpar
-      EdgeIt(const ListGraph& G) {
+      EdgeIt(const ListGraph&) {
         node_item* v=G._first_node;
         if (v) edge=v->_first_out_edge; else edge=0;
@@ -456 +456 @@
       OutEdgeIt() : Edge()/*, v(0)*/ { }
       OutEdgeIt(const Invalid& i) : Edge(i) { }
-      OutEdgeIt(const ListGraph& G, Node _v) /*: v(_v.node)*/ { edge=_v.node->_first_out_edge; }
+      OutEdgeIt(const ListGraph&, Node _v) /*: v(_v.node)*/ { edge=_v.node->_first_out_edge; }
     protected:
       OutEdgeIt& operator++() { edge=edge->_next_out; return *this; }
@@ -473 +473 @@
       InEdgeIt() : Edge()/*, v(0)*/ { }
       InEdgeIt(const Invalid& i) : Edge(i) { }
-      InEdgeIt(const ListGraph& G, Node _v) /*: v(_v.node)*/ { edge=_v.node->_first_in_edge; }
+      InEdgeIt(const ListGraph&, Node _v) /*: v(_v.node)*/ { edge=_v.node->_first_in_edge; }
     protected:
       InEdgeIt& operator++() { edge=edge->_next_in; return *this; }
@@ -495 +495 @@
       SymEdgeIt() : Edge() /*, v(0)*/ { }
       SymEdgeIt(const Invalid& i) : Edge(i) { }
-      SymEdgeIt(const ListGraph& G, Node _v) /*: v(_v.node)*/ { 
+      SymEdgeIt(const ListGraph&, Node _v) /*: v(_v.node)*/ { 
         out_or_in=1;
         edge=_v.node->_first_out_edge;