diff -r 4b8153513f34 -r ea1fa1bc3f6d lemon/topology.h
--- a/lemon/topology.h	Mon Jun 26 15:40:35 2006 +0000
+++ b/lemon/topology.h	Wed Jun 28 15:06:24 2006 +0000
@@ -244,7 +244,7 @@
   /// \note By definition, the empty graph is strongly connected.
   template <typename Graph>
   bool stronglyConnected(const Graph& graph) {
-    checkConcept<concept::StaticGraph, Graph>();
+    checkConcept<concept::Graph, Graph>();
 
     typedef typename Graph::Node Node;
     typedef typename Graph::NodeIt NodeIt;
@@ -302,7 +302,7 @@
   /// strongly connected components.
   template <typename Graph>
   int countStronglyConnectedComponents(const Graph& graph) {
-    checkConcept<concept::StaticGraph, Graph>();
+    checkConcept<concept::Graph, Graph>();
 
     using namespace _topology_bits;
 
@@ -371,7 +371,7 @@
   ///
   template <typename Graph, typename NodeMap>
   int stronglyConnectedComponents(const Graph& graph, NodeMap& compMap) {
-    checkConcept<concept::StaticGraph, Graph>();
+    checkConcept<concept::Graph, Graph>();
     typedef typename Graph::Node Node;
     typedef typename Graph::NodeIt NodeIt;
     checkConcept<concept::WriteMap<Node, int>, NodeMap>();
@@ -434,7 +434,7 @@
   /// \return The number of cut edges
   template <typename Graph, typename EdgeMap>
   int stronglyConnectedCutEdges(const Graph& graph, EdgeMap& cutMap) {
-    checkConcept<concept::StaticGraph, Graph>();
+    checkConcept<concept::Graph, Graph>();
     typedef typename Graph::Node Node;
     typedef typename Graph::Edge Edge;
     typedef typename Graph::NodeIt NodeIt;
@@ -1205,7 +1205,7 @@
   void topologicalSort(const Graph& graph, NodeMap& order) {
     using namespace _topology_bits;
 
-    checkConcept<concept::StaticGraph, Graph>();
+    checkConcept<concept::Graph, Graph>();
     checkConcept<concept::WriteMap<typename Graph::Node, int>, NodeMap>();
 
     typedef typename Graph::Node Node;
@@ -1247,7 +1247,7 @@
   bool checkedTopologicalSort(const Graph& graph, NodeMap& order) {
     using namespace _topology_bits;
 
-    checkConcept<concept::StaticGraph, Graph>();
+    checkConcept<concept::Graph, Graph>();
     checkConcept<concept::ReadWriteMap<typename Graph::Node, int>, NodeMap>();
 
     typedef typename Graph::Node Node;
@@ -1290,7 +1290,7 @@
   template <typename Graph>
   bool dag(const Graph& graph) {
 
-    checkConcept<concept::StaticGraph, Graph>();
+    checkConcept<concept::Graph, Graph>();
 
     typedef typename Graph::Node Node;
     typedef typename Graph::NodeIt NodeIt;