1.1 --- a/lemon/topology.h	Mon Jun 26 15:40:35 2006 +0000
     1.2 +++ b/lemon/topology.h	Wed Jun 28 15:06:24 2006 +0000
     1.3 @@ -244,7 +244,7 @@
     1.4    /// \note By definition, the empty graph is strongly connected.
     1.5    template <typename Graph>
     1.6    bool stronglyConnected(const Graph& graph) {
     1.7 -    checkConcept<concept::StaticGraph, Graph>();
     1.8 +    checkConcept<concept::Graph, Graph>();
     1.9  
    1.10      typedef typename Graph::Node Node;
    1.11      typedef typename Graph::NodeIt NodeIt;
    1.12 @@ -302,7 +302,7 @@
    1.13    /// strongly connected components.
    1.14    template <typename Graph>
    1.15    int countStronglyConnectedComponents(const Graph& graph) {
    1.16 -    checkConcept<concept::StaticGraph, Graph>();
    1.17 +    checkConcept<concept::Graph, Graph>();
    1.18  
    1.19      using namespace _topology_bits;
    1.20  
    1.21 @@ -371,7 +371,7 @@
    1.22    ///
    1.23    template <typename Graph, typename NodeMap>
    1.24    int stronglyConnectedComponents(const Graph& graph, NodeMap& compMap) {
    1.25 -    checkConcept<concept::StaticGraph, Graph>();
    1.26 +    checkConcept<concept::Graph, Graph>();
    1.27      typedef typename Graph::Node Node;
    1.28      typedef typename Graph::NodeIt NodeIt;
    1.29      checkConcept<concept::WriteMap<Node, int>, NodeMap>();
    1.30 @@ -434,7 +434,7 @@
    1.31    /// \return The number of cut edges
    1.32    template <typename Graph, typename EdgeMap>
    1.33    int stronglyConnectedCutEdges(const Graph& graph, EdgeMap& cutMap) {
    1.34 -    checkConcept<concept::StaticGraph, Graph>();
    1.35 +    checkConcept<concept::Graph, Graph>();
    1.36      typedef typename Graph::Node Node;
    1.37      typedef typename Graph::Edge Edge;
    1.38      typedef typename Graph::NodeIt NodeIt;
    1.39 @@ -1205,7 +1205,7 @@
    1.40    void topologicalSort(const Graph& graph, NodeMap& order) {
    1.41      using namespace _topology_bits;
    1.42  
    1.43 -    checkConcept<concept::StaticGraph, Graph>();
    1.44 +    checkConcept<concept::Graph, Graph>();
    1.45      checkConcept<concept::WriteMap<typename Graph::Node, int>, NodeMap>();
    1.46  
    1.47      typedef typename Graph::Node Node;
    1.48 @@ -1247,7 +1247,7 @@
    1.49    bool checkedTopologicalSort(const Graph& graph, NodeMap& order) {
    1.50      using namespace _topology_bits;
    1.51  
    1.52 -    checkConcept<concept::StaticGraph, Graph>();
    1.53 +    checkConcept<concept::Graph, Graph>();
    1.54      checkConcept<concept::ReadWriteMap<typename Graph::Node, int>, NodeMap>();
    1.55  
    1.56      typedef typename Graph::Node Node;
    1.57 @@ -1290,7 +1290,7 @@
    1.58    template <typename Graph>
    1.59    bool dag(const Graph& graph) {
    1.60  
    1.61 -    checkConcept<concept::StaticGraph, Graph>();
    1.62 +    checkConcept<concept::Graph, Graph>();
    1.63  
    1.64      typedef typename Graph::Node Node;
    1.65      typedef typename Graph::NodeIt NodeIt;