In file included from /usr/include/boost/range/algorithm/for_each.hpp:15:0,
                 from cpputils.hpp:9,
                 from BaseGraphTypes.hpp:7,
                 from GraphComponent.hpp:9,
                 from Graph.hpp:13,
                 from graphutils.h:4,
                 from graphutils.cpp:1:
/usr/include/boost/range/concepts.hpp: In instantiation of ‘boost::SinglePassRangeConcept<T>::~SinglePassRangeConcept() [with T = const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> >]’:
/usr/include/boost/concept/detail/general.hpp:38:28:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > >]’
/usr/include/boost/range/algorithm/for_each.hpp:91:53:   required from ‘UnaryFunction boost::range::for_each(const SinglePassRange&, UnaryFunction) [with SinglePassRange = boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> >; UnaryFunction = xHeinz::generateRandomGraph(int, int)::__lambda0::__lambda1]’
graphutils.cpp:20:7:   required from here
/usr/include/boost/range/concepts.hpp:270:46: error: call of overloaded ‘ignore_unused_variable_warning(boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > >::iterator&)’ is ambiguous
             ignore_unused_variable_warning(i1);
                                              ^
/usr/include/boost/range/concepts.hpp:270:46: note: candidates are:
In file included from /usr/include/boost/range/algorithm/for_each.hpp:12:0,
                 from cpputils.hpp:9,
                 from BaseGraphTypes.hpp:7,
                 from GraphComponent.hpp:9,
                 from Graph.hpp:13,
                 from graphutils.h:4,
                 from graphutils.cpp:1:
/usr/include/boost/concept_check.hpp:47:34: note: void boost::ignore_unused_variable_warning(const T&) [with T = xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>]
   template <class T> inline void ignore_unused_variable_warning(T const&) {}
                                  ^
In file included from ../externlib/lemon-1.3/include/lemon/bits/map_extender.h:26:0,
                 from ../externlib/lemon-1.3/include/lemon/adaptors.h:33,
                 from Graph.hpp:9,
                 from graphutils.h:4,
                 from graphutils.cpp:1:
../externlib/lemon-1.3/include/lemon/concept_check.h:37:34: note: void lemon::ignore_unused_variable_warning(const T&) [with T = xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>]
In file included from /usr/include/boost/range/algorithm/for_each.hpp:15:0,
                 from cpputils.hpp:9,
                 from BaseGraphTypes.hpp:7,
                 from GraphComponent.hpp:9,
                 from Graph.hpp:13,
                 from graphutils.h:4,
                 from graphutils.cpp:1:
/usr/include/boost/range/concepts.hpp:271:46: error: call of overloaded ‘ignore_unused_variable_warning(boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > >::iterator&)’ is ambiguous
             ignore_unused_variable_warning(i2);
                                              ^
/usr/include/boost/range/concepts.hpp:271:46: note: candidates are:
In file included from /usr/include/boost/range/algorithm/for_each.hpp:12:0,
                 from cpputils.hpp:9,
                 from BaseGraphTypes.hpp:7,
                 from GraphComponent.hpp:9,
                 from Graph.hpp:13,
                 from graphutils.h:4,
                 from graphutils.cpp:1:
/usr/include/boost/concept_check.hpp:47:34: note: void boost::ignore_unused_variable_warning(const T&) [with T = xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>]
   template <class T> inline void ignore_unused_variable_warning(T const&) {}
                                  ^
In file included from ../externlib/lemon-1.3/include/lemon/bits/map_extender.h:26:0,
                 from ../externlib/lemon-1.3/include/lemon/adaptors.h:33,
                 from Graph.hpp:9,
                 from graphutils.h:4,
                 from graphutils.cpp:1:
../externlib/lemon-1.3/include/lemon/concept_check.h:37:34: note: void lemon::ignore_unused_variable_warning(const T&) [with T = xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>]
In file included from /usr/include/boost/range/algorithm/for_each.hpp:12:0,
                 from cpputils.hpp:9,
                 from BaseGraphTypes.hpp:7,
                 from GraphComponent.hpp:9,
                 from Graph.hpp:13,
                 from graphutils.h:4,
                 from graphutils.cpp:1:
/usr/include/boost/concept_check.hpp: In instantiation of ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>]’:
/usr/include/boost/concept/usage.hpp:22:29:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> >]’
/usr/include/boost/concept/detail/general.hpp:38:28:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > >]’
/usr/include/boost/concept_check.hpp:162:53:   required from ‘struct boost::CopyConstructible<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> >’
/usr/include/boost/range/concepts.hpp:113:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> >’
/usr/include/boost/range/concepts.hpp:135:16:   required from ‘struct boost::range_detail::SinglePassIteratorConcept<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> >’
/usr/include/boost/concept/detail/has_constraints.hpp:32:62:   [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/usr/include/boost/concept/detail/has_constraints.hpp:42:73:   required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > > >::value’
/usr/include/boost/concept/detail/has_constraints.hpp:45:31:   required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > > >’
/usr/include/boost/mpl/if.hpp:67:11:   required from ‘struct boost::mpl::if_<boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > > >, boost::concepts::constraint<boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > > >, boost::concepts::requirement<boost::concepts::failed************ boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > >::************> >’
/usr/include/boost/concept/detail/general.hpp:50:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > >)>’
/usr/include/boost/range/algorithm/for_each.hpp:91:53:   required from ‘UnaryFunction boost::range::for_each(const SinglePassRange&, UnaryFunction) [with SinglePassRange = boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> >; UnaryFunction = xHeinz::generateRandomGraph(int, int)::__lambda0::__lambda1]’
graphutils.cpp:20:7:   required from here
/usr/include/boost/concept_check.hpp:166:41: error: call of overloaded ‘ignore_unused_variable_warning(xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>*&)’ is ambiguous
       ignore_unused_variable_warning(ptr);
                                         ^
/usr/include/boost/concept_check.hpp:166:41: note: candidates are:
In file included from /usr/include/boost/range/algorithm/for_each.hpp:12:0,
                 from cpputils.hpp:9,
                 from BaseGraphTypes.hpp:7,
                 from GraphComponent.hpp:9,
                 from Graph.hpp:13,
                 from graphutils.h:4,
                 from graphutils.cpp:1:
/usr/include/boost/concept_check.hpp:47:34: note: void boost::ignore_unused_variable_warning(const T&) [with T = xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>*]
   template <class T> inline void ignore_unused_variable_warning(T const&) {}
                                  ^
In file included from ../externlib/lemon-1.3/include/lemon/bits/map_extender.h:26:0,
                 from ../externlib/lemon-1.3/include/lemon/adaptors.h:33,
                 from Graph.hpp:9,
                 from graphutils.h:4,
                 from graphutils.cpp:1:
../externlib/lemon-1.3/include/lemon/concept_check.h:37:34: note: void lemon::ignore_unused_variable_warning(const T&) [with T = xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>*]
In file included from /usr/include/boost/range/algorithm/for_each.hpp:12:0,
                 from cpputils.hpp:9,
                 from BaseGraphTypes.hpp:7,
                 from GraphComponent.hpp:9,
                 from Graph.hpp:13,
                 from graphutils.h:4,
                 from graphutils.cpp:1:
/usr/include/boost/concept_check.hpp: In instantiation of ‘void boost::CopyConstructible<TT>::const_constraints(const TT&) [with TT = xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>]’:
/usr/include/boost/concept_check.hpp:165:26:   required from ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>]’
/usr/include/boost/concept/usage.hpp:22:29:   required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> >]’
/usr/include/boost/concept/detail/general.hpp:38:28:   required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > >]’
/usr/include/boost/concept_check.hpp:162:53:   required from ‘struct boost::CopyConstructible<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> >’
/usr/include/boost/range/concepts.hpp:113:16:   required from ‘struct boost::range_detail::IncrementableIteratorConcept<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> >’
/usr/include/boost/range/concepts.hpp:135:16:   [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/usr/include/boost/concept/detail/has_constraints.hpp:42:73:   required from ‘const bool boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > > >::value’
/usr/include/boost/concept/detail/has_constraints.hpp:45:31:   required from ‘struct boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > > >’
/usr/include/boost/mpl/if.hpp:67:11:   required from ‘struct boost::mpl::if_<boost::concepts::not_satisfied<boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > > >, boost::concepts::constraint<boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > > >, boost::concepts::requirement<boost::concepts::failed************ boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > >::************> >’
/usr/include/boost/concept/detail/general.hpp:50:8:   required from ‘struct boost::concepts::requirement_<void (*)(boost::SinglePassRangeConcept<const boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> > >)>’
/usr/include/boost/range/algorithm/for_each.hpp:91:53:   required from ‘UnaryFunction boost::range::for_each(const SinglePassRange&, UnaryFunction) [with SinglePassRange = boost::iterator_range<xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt> >; UnaryFunction = xHeinz::generateRandomGraph(int, int)::__lambda0::__lambda1]’
graphutils.cpp:20:7:   required from here
/usr/include/boost/concept_check.hpp:172:39: error: call of overloaded ‘ignore_unused_variable_warning(xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>&)’ is ambiguous
       ignore_unused_variable_warning(c);
                                       ^
/usr/include/boost/concept_check.hpp:172:39: note: candidates are:
In file included from /usr/include/boost/range/algorithm/for_each.hpp:12:0,
                 from cpputils.hpp:9,
                 from BaseGraphTypes.hpp:7,
                 from GraphComponent.hpp:9,
                 from Graph.hpp:13,
                 from graphutils.h:4,
                 from graphutils.cpp:1:
/usr/include/boost/concept_check.hpp:47:34: note: void boost::ignore_unused_variable_warning(const T&) [with T = xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>]
   template <class T> inline void ignore_unused_variable_warning(T const&) {}
                                  ^
In file included from ../externlib/lemon-1.3/include/lemon/bits/map_extender.h:26:0,
                 from ../externlib/lemon-1.3/include/lemon/adaptors.h:33,
                 from Graph.hpp:9,
                 from graphutils.h:4,
                 from graphutils.cpp:1:
../externlib/lemon-1.3/include/lemon/concept_check.h:37:34: note: void lemon::ignore_unused_variable_warning(const T&) [with T = xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>]
In file included from /usr/include/boost/range/algorithm/for_each.hpp:12:0,
                 from cpputils.hpp:9,
                 from BaseGraphTypes.hpp:7,
                 from GraphComponent.hpp:9,
                 from Graph.hpp:13,
                 from graphutils.h:4,
                 from graphutils.cpp:1:
/usr/include/boost/concept_check.hpp:173:41: error: call of overloaded ‘ignore_unused_variable_warning(const xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>*&)’ is ambiguous
       ignore_unused_variable_warning(ptr);
                                         ^
/usr/include/boost/concept_check.hpp:173:41: note: candidates are:
In file included from /usr/include/boost/range/algorithm/for_each.hpp:12:0,
                 from cpputils.hpp:9,
                 from BaseGraphTypes.hpp:7,
                 from GraphComponent.hpp:9,
                 from Graph.hpp:13,
                 from graphutils.h:4,
                 from graphutils.cpp:1:
/usr/include/boost/concept_check.hpp:47:34: note: void boost::ignore_unused_variable_warning(const T&) [with T = const xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>*]
   template <class T> inline void ignore_unused_variable_warning(T const&) {}
                                  ^
In file included from ../externlib/lemon-1.3/include/lemon/bits/map_extender.h:26:0,
                 from ../externlib/lemon-1.3/include/lemon/adaptors.h:33,
                 from Graph.hpp:9,
                 from graphutils.h:4,
                 from graphutils.cpp:1:
../externlib/lemon-1.3/include/lemon/concept_check.h:37:34: note: void lemon::ignore_unused_variable_warning(const T&) [with T = const xHeinz::impl::DigraphBasicTypes<lemon::ListGraph>::Iter<lemon::GraphExtender<lemon::ListGraphBase>::NodeIt>*]