1.1 --- a/benchmark/swap_bipartite_bench.cc	Tue Oct 03 11:46:39 2006 +0000
     1.2 +++ b/benchmark/swap_bipartite_bench.cc	Thu Oct 05 10:18:58 2006 +0000
     1.3 @@ -8,7 +8,6 @@
     1.4  #include <lemon/bipartite_matching.h>
     1.5  
     1.6  #include <lemon/graph_utils.h>
     1.7 -#include <lemon/xy.h>
     1.8  #include <lemon/graph_to_eps.h>
     1.9  
    1.10  #include <lemon/time_measure.h>

     2.1 --- a/demo/topological_ordering.cc	Tue Oct 03 11:46:39 2006 +0000
     2.2 +++ b/demo/topological_ordering.cc	Thu Oct 05 10:18:58 2006 +0000
     2.3 @@ -42,7 +42,7 @@
     2.4  
     2.5    OrderedList  order;
     2.6  
     2.7 -  SerializingWriteMap( const GR& gr ) {}
     2.8 +  SerializingWriteMap( const GR& ) {}
     2.9  
    2.10    void  set( const Key& k, const Value& v ) {
    2.11      if( v ) order.push_front(k);
    2.12 @@ -54,7 +54,7 @@
    2.13  };
    2.14  
    2.15  
    2.16 -int  main( int argc, char *argv[] )
    2.17 +int main()
    2.18  {
    2.19    std::cout << "Topological Ordering demo" << std::endl;
    2.20