diff -r c06e86364234 -r fd51b552bcf2 lemon/topology.h
--- a/lemon/topology.h	Fri Apr 20 14:47:19 2007 +0000
+++ b/lemon/topology.h	Fri Apr 20 14:49:21 2007 +0000
@@ -35,7 +35,7 @@
 #include <stack>
 #include <functional>
 
-/// \ingroup topology
+/// \ingroup graph_prop
 /// \file
 /// \brief Topology related algorithms
 ///
@@ -43,7 +43,7 @@
 
 namespace lemon {
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Check that the given undirected graph is connected.
   ///
@@ -66,7 +66,7 @@
     return true;
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Count the number of connected components of an undirected graph
   ///
@@ -108,7 +108,7 @@
     return compNum;
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Find the connected components of an undirected graph
   ///
@@ -231,7 +231,7 @@
   }
 
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Check that the given directed graph is strongly connected.
   ///
@@ -287,7 +287,7 @@
     return true;
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Count the strongly connected components of a directed graph
   ///
@@ -351,7 +351,7 @@
     return compNum;
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Find the strongly connected components of a directed graph
   ///
@@ -421,7 +421,7 @@
     return compNum;
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Find the cut edges of the strongly connected components.
   ///
@@ -705,7 +705,7 @@
   template <typename UGraph>
   int countBiNodeConnectedComponents(const UGraph& graph);
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Checks the graph is bi-node-connected.
   ///
@@ -721,7 +721,7 @@
     return countBiNodeConnectedComponents(graph) == 1;
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Count the biconnected components.
   ///
@@ -756,7 +756,7 @@
     return compNum;
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Find the bi-node-connected components.
   ///
@@ -802,7 +802,7 @@
     return compNum;
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Find the bi-node-connected cut nodes.
   ///
@@ -1032,7 +1032,7 @@
   template <typename UGraph>
   int countBiEdgeConnectedComponents(const UGraph& graph);
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Checks that the graph is bi-edge-connected.
   ///
@@ -1048,7 +1048,7 @@
     return countBiEdgeConnectedComponents(graph) == 1;
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Count the bi-edge-connected components.
   ///
@@ -1083,7 +1083,7 @@
     return compNum;
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Find the bi-edge-connected components.
   ///
@@ -1128,7 +1128,7 @@
     return compNum;
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Find the bi-edge-connected cut edges.
   ///
@@ -1192,7 +1192,7 @@
     
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Sort the nodes of a DAG into topolgical order.
   ///
@@ -1231,7 +1231,7 @@
     }    
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Sort the nodes of a DAG into topolgical order.
   ///
@@ -1283,7 +1283,7 @@
     return true;
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Check that the given directed graph is a DAG.
   ///
@@ -1325,7 +1325,7 @@
     return true;
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Check that the given undirected graph is acyclic.
   ///
@@ -1359,7 +1359,7 @@
     return true;
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Check that the given undirected graph is tree.
   ///
@@ -1451,7 +1451,7 @@
     };
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Check if the given undirected graph is bipartite or not
   ///
@@ -1490,7 +1490,7 @@
     return true;
   }
   
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Check if the given undirected graph is bipartite or not
   ///