# HG changeset patch
# User marci
# Date 1079710918 0
# Node ID 1e36245f905d1a42b632a12c514b1b783138316c
# Parent  9910d5a5be7f393729051b513180a59591f82607
warnings

diff -r 9910d5a5be7f -r 1e36245f905d src/work/list_graph.h
--- a/src/work/list_graph.h	Fri Mar 19 14:47:36 2004 +0000
+++ b/src/work/list_graph.h	Fri Mar 19 15:41:58 2004 +0000
@@ -428,7 +428,7 @@
       friend class ListGraph;
       //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;
 	while (v && !edge) { v=v->_next_node; if (v) edge=v->_first_out_edge; }
@@ -455,7 +455,7 @@
     public:
       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; }
     protected:
@@ -472,7 +472,7 @@
     public:
       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; }
     protected:
@@ -494,7 +494,7 @@
     public:
       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; 
 	if (!edge) { edge=_v.node->_first_in_edge; out_or_in=0; }