Changeset 2429:fd51b552bcf2 in lemon-0.x for lemon/topology.h

Timestamp:

04/20/07 16:49:21 (17 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3265

Message:

Renaming topology doxygen group

File:

• lemon/topology.h (modified) (23 diffs)

lemon/topology.h

@@ -36 +36 @@
 #include <functional>
 
-/// \ingroup topology
+/// \ingroup graph_prop
 /// \file
 /// \brief Topology related algorithms
@@ -44 +44 @@
 namespace lemon {
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Check that the given undirected graph is connected.
@@ -67 +67 @@
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Count the number of connected components of an undirected graph
@@ -109 +109 @@
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Find the connected components of an undirected graph
@@ -232 +232 @@
 
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Check that the given directed graph is strongly connected.
@@ -288 +288 @@
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Count the strongly connected components of a directed graph
@@ -352 +352 @@
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Find the strongly connected components of a directed graph
@@ -422 +422 @@
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Find the cut edges of the strongly connected components.
@@ -706 +706 @@
   int countBiNodeConnectedComponents(const UGraph& graph);
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Checks the graph is bi-node-connected.
@@ -722 +722 @@
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Count the biconnected components.
@@ -757 +757 @@
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Find the bi-node-connected components.
@@ -803 +803 @@
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Find the bi-node-connected cut nodes.
@@ -1033 +1033 @@
   int countBiEdgeConnectedComponents(const UGraph& graph);
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Checks that the graph is bi-edge-connected.
@@ -1049 +1049 @@
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Count the bi-edge-connected components.
@@ -1084 +1084 @@
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Find the bi-edge-connected components.
@@ -1129 +1129 @@
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Find the bi-edge-connected cut edges.
@@ -1193 +1193 @@
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Sort the nodes of a DAG into topolgical order.
@@ -1232 +1232 @@
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Sort the nodes of a DAG into topolgical order.
@@ -1284 +1284 @@
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Check that the given directed graph is a DAG.
@@ -1326 +1326 @@
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Check that the given undirected graph is acyclic.
@@ -1360 +1360 @@
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Check that the given undirected graph is tree.
@@ -1452 +1452 @@
   }
 
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Check if the given undirected graph is bipartite or not
@@ -1491 +1491 @@
   }
   
-  /// \ingroup topology
+  /// \ingroup graph_prop
   ///
   /// \brief Check if the given undirected graph is bipartite or not