1.1 --- a/src/lemon/concept/undir_graph.h	Sat Nov 13 17:47:44 2004 +0000
     1.2 +++ b/src/lemon/concept/undir_graph.h	Sat Nov 13 21:37:54 2004 +0000
     1.3 @@ -38,9 +38,10 @@
     1.4        typedef typename Graph::UndirEdge UndirEdge;
     1.5        typedef typename Graph::Edge Edge;
     1.6        typedef typename Graph::Node Node;
     1.7 +
     1.8        void constraints() {
     1.9 -	function_requires< BaseIterableGraphComponentConcept<Graph> >();
    1.10 -	function_requires< GraphItemConcept<UndirEdge> >();
    1.11 +	checkConcept<BaseIterableGraphComponent, Graph>();
    1.12 +	checkConcept<GraphItem<'u'>, UndirEdge >();
    1.13  
    1.14  	/// \bug this should be base_and_derived:
    1.15  	UndirEdge ue = e;
    1.16 @@ -60,14 +61,14 @@
    1.17      template <typename Graph>
    1.18      struct IterableUndirGraphConcept {
    1.19        void constraints() {
    1.20 -	function_requires< BaseIterableUndirGraphConcept<Graph> > ();
    1.21 -	function_requires< IterableGraphComponentConcept<Graph> > ();
    1.22 +	/// \todo we don't need the iterable component should base iterable	
    1.23 +	//	checkConcept< BaseIterableUndirGraph, Graph > ();
    1.24 +	checkConcept< IterableGraphComponent, Graph > ();
    1.25  
    1.26  	typedef typename Graph::UndirEdge UndirEdge;
    1.27  	typedef typename Graph::UndirEdgeIt UndirEdgeIt;
    1.28  
    1.29 -	function_requires<
    1.30 -	  GraphIteratorConcept<UndirEdgeIt, Graph, UndirEdge> >();
    1.31 +	checkConcept< GraphIterator<Graph, UndirEdge>, UndirEdgeIt >();
    1.32        }
    1.33      };
    1.34