1.1 --- a/src/work/list_graph.h	Fri Mar 19 14:47:36 2004 +0000
     1.2 +++ b/src/work/list_graph.h	Fri Mar 19 15:41:58 2004 +0000
     1.3 @@ -428,7 +428,7 @@
     1.4        friend class ListGraph;
     1.5        //protected: 
     1.6      public: //for alpar
     1.7 -      EdgeIt(const ListGraph& G) {
     1.8 +      EdgeIt(const ListGraph&) {
     1.9  	node_item* v=G._first_node;
    1.10  	if (v) edge=v->_first_out_edge; else edge=0;
    1.11  	while (v && !edge) { v=v->_next_node; if (v) edge=v->_first_out_edge; }
    1.12 @@ -455,7 +455,7 @@
    1.13      public:
    1.14        OutEdgeIt() : Edge()/*, v(0)*/ { }
    1.15        OutEdgeIt(const Invalid& i) : Edge(i) { }
    1.16 -      OutEdgeIt(const ListGraph& G, Node _v) /*: v(_v.node)*/ { edge=_v.node->_first_out_edge; }
    1.17 +      OutEdgeIt(const ListGraph&, Node _v) /*: v(_v.node)*/ { edge=_v.node->_first_out_edge; }
    1.18      protected:
    1.19        OutEdgeIt& operator++() { edge=edge->_next_out; return *this; }
    1.20      protected:
    1.21 @@ -472,7 +472,7 @@
    1.22      public:
    1.23        InEdgeIt() : Edge()/*, v(0)*/ { }
    1.24        InEdgeIt(const Invalid& i) : Edge(i) { }
    1.25 -      InEdgeIt(const ListGraph& G, Node _v) /*: v(_v.node)*/ { edge=_v.node->_first_in_edge; }
    1.26 +      InEdgeIt(const ListGraph&, Node _v) /*: v(_v.node)*/ { edge=_v.node->_first_in_edge; }
    1.27      protected:
    1.28        InEdgeIt& operator++() { edge=edge->_next_in; return *this; }
    1.29      protected:
    1.30 @@ -494,7 +494,7 @@
    1.31      public:
    1.32        SymEdgeIt() : Edge() /*, v(0)*/ { }
    1.33        SymEdgeIt(const Invalid& i) : Edge(i) { }
    1.34 -      SymEdgeIt(const ListGraph& G, Node _v) /*: v(_v.node)*/ { 
    1.35 +      SymEdgeIt(const ListGraph&, Node _v) /*: v(_v.node)*/ { 
    1.36  	out_or_in=1;
    1.37  	edge=_v.node->_first_out_edge; 
    1.38  	if (!edge) { edge=_v.node->_first_in_edge; out_or_in=0; }