1.1 --- a/lemon/topology.h Fri Apr 20 14:47:19 2007 +0000
1.2 +++ b/lemon/topology.h Fri Apr 20 14:49:21 2007 +0000
1.3 @@ -35,7 +35,7 @@
1.4 #include <stack>
1.5 #include <functional>
1.6
1.7 -/// \ingroup topology
1.8 +/// \ingroup graph_prop
1.9 /// \file
1.10 /// \brief Topology related algorithms
1.11 ///
1.12 @@ -43,7 +43,7 @@
1.13
1.14 namespace lemon {
1.15
1.16 - /// \ingroup topology
1.17 + /// \ingroup graph_prop
1.18 ///
1.19 /// \brief Check that the given undirected graph is connected.
1.20 ///
1.21 @@ -66,7 +66,7 @@
1.22 return true;
1.23 }
1.24
1.25 - /// \ingroup topology
1.26 + /// \ingroup graph_prop
1.27 ///
1.28 /// \brief Count the number of connected components of an undirected graph
1.29 ///
1.30 @@ -108,7 +108,7 @@
1.31 return compNum;
1.32 }
1.33
1.34 - /// \ingroup topology
1.35 + /// \ingroup graph_prop
1.36 ///
1.37 /// \brief Find the connected components of an undirected graph
1.38 ///
1.39 @@ -231,7 +231,7 @@
1.40 }
1.41
1.42
1.43 - /// \ingroup topology
1.44 + /// \ingroup graph_prop
1.45 ///
1.46 /// \brief Check that the given directed graph is strongly connected.
1.47 ///
1.48 @@ -287,7 +287,7 @@
1.49 return true;
1.50 }
1.51
1.52 - /// \ingroup topology
1.53 + /// \ingroup graph_prop
1.54 ///
1.55 /// \brief Count the strongly connected components of a directed graph
1.56 ///
1.57 @@ -351,7 +351,7 @@
1.58 return compNum;
1.59 }
1.60
1.61 - /// \ingroup topology
1.62 + /// \ingroup graph_prop
1.63 ///
1.64 /// \brief Find the strongly connected components of a directed graph
1.65 ///
1.66 @@ -421,7 +421,7 @@
1.67 return compNum;
1.68 }
1.69
1.70 - /// \ingroup topology
1.71 + /// \ingroup graph_prop
1.72 ///
1.73 /// \brief Find the cut edges of the strongly connected components.
1.74 ///
1.75 @@ -705,7 +705,7 @@
1.76 template <typename UGraph>
1.77 int countBiNodeConnectedComponents(const UGraph& graph);
1.78
1.79 - /// \ingroup topology
1.80 + /// \ingroup graph_prop
1.81 ///
1.82 /// \brief Checks the graph is bi-node-connected.
1.83 ///
1.84 @@ -721,7 +721,7 @@
1.85 return countBiNodeConnectedComponents(graph) == 1;
1.86 }
1.87
1.88 - /// \ingroup topology
1.89 + /// \ingroup graph_prop
1.90 ///
1.91 /// \brief Count the biconnected components.
1.92 ///
1.93 @@ -756,7 +756,7 @@
1.94 return compNum;
1.95 }
1.96
1.97 - /// \ingroup topology
1.98 + /// \ingroup graph_prop
1.99 ///
1.100 /// \brief Find the bi-node-connected components.
1.101 ///
1.102 @@ -802,7 +802,7 @@
1.103 return compNum;
1.104 }
1.105
1.106 - /// \ingroup topology
1.107 + /// \ingroup graph_prop
1.108 ///
1.109 /// \brief Find the bi-node-connected cut nodes.
1.110 ///
1.111 @@ -1032,7 +1032,7 @@
1.112 template <typename UGraph>
1.113 int countBiEdgeConnectedComponents(const UGraph& graph);
1.114
1.115 - /// \ingroup topology
1.116 + /// \ingroup graph_prop
1.117 ///
1.118 /// \brief Checks that the graph is bi-edge-connected.
1.119 ///
1.120 @@ -1048,7 +1048,7 @@
1.121 return countBiEdgeConnectedComponents(graph) == 1;
1.122 }
1.123
1.124 - /// \ingroup topology
1.125 + /// \ingroup graph_prop
1.126 ///
1.127 /// \brief Count the bi-edge-connected components.
1.128 ///
1.129 @@ -1083,7 +1083,7 @@
1.130 return compNum;
1.131 }
1.132
1.133 - /// \ingroup topology
1.134 + /// \ingroup graph_prop
1.135 ///
1.136 /// \brief Find the bi-edge-connected components.
1.137 ///
1.138 @@ -1128,7 +1128,7 @@
1.139 return compNum;
1.140 }
1.141
1.142 - /// \ingroup topology
1.143 + /// \ingroup graph_prop
1.144 ///
1.145 /// \brief Find the bi-edge-connected cut edges.
1.146 ///
1.147 @@ -1192,7 +1192,7 @@
1.148
1.149 }
1.150
1.151 - /// \ingroup topology
1.152 + /// \ingroup graph_prop
1.153 ///
1.154 /// \brief Sort the nodes of a DAG into topolgical order.
1.155 ///
1.156 @@ -1231,7 +1231,7 @@
1.157 }
1.158 }
1.159
1.160 - /// \ingroup topology
1.161 + /// \ingroup graph_prop
1.162 ///
1.163 /// \brief Sort the nodes of a DAG into topolgical order.
1.164 ///
1.165 @@ -1283,7 +1283,7 @@
1.166 return true;
1.167 }
1.168
1.169 - /// \ingroup topology
1.170 + /// \ingroup graph_prop
1.171 ///
1.172 /// \brief Check that the given directed graph is a DAG.
1.173 ///
1.174 @@ -1325,7 +1325,7 @@
1.175 return true;
1.176 }
1.177
1.178 - /// \ingroup topology
1.179 + /// \ingroup graph_prop
1.180 ///
1.181 /// \brief Check that the given undirected graph is acyclic.
1.182 ///
1.183 @@ -1359,7 +1359,7 @@
1.184 return true;
1.185 }
1.186
1.187 - /// \ingroup topology
1.188 + /// \ingroup graph_prop
1.189 ///
1.190 /// \brief Check that the given undirected graph is tree.
1.191 ///
1.192 @@ -1451,7 +1451,7 @@
1.193 };
1.194 }
1.195
1.196 - /// \ingroup topology
1.197 + /// \ingroup graph_prop
1.198 ///
1.199 /// \brief Check if the given undirected graph is bipartite or not
1.200 ///
1.201 @@ -1490,7 +1490,7 @@
1.202 return true;
1.203 }
1.204
1.205 - /// \ingroup topology
1.206 + /// \ingroup graph_prop
1.207 ///
1.208 /// \brief Check if the given undirected graph is bipartite or not
1.209 ///