# HG changeset patch # User deba # Date 1177080561 0 # Node ID fd51b552bcf29ff61f3dc7eb12f0ef1b1956dac0 # Parent c06e863642349de42dbec4435fc04c6538c37b01 Renaming topology doxygen group diff -r c06e86364234 -r fd51b552bcf2 doc/groups.dox --- a/doc/groups.dox Fri Apr 20 14:47:19 2007 +0000 +++ b/doc/groups.dox Fri Apr 20 14:49:21 2007 +0000 @@ -197,13 +197,13 @@ */ /** -@defgroup topology Topology related algorithms +@defgroup graph_prop Connectivity and other graph properties @ingroup algs \brief This group describes the algorithms -for discover the topology of the graphs. +for discover the graph properties -This group describes the algorithms -for discover the topology of the graphs. +This group describes the algorithms for discover the graph properties +like connectivity, bipartiteness, euler property, simplicity, etc... \image html edge_biconnected_components.png \image latex edge_biconnected_components.eps "bi-edge-connected components" width=\textwidth diff -r c06e86364234 -r fd51b552bcf2 lemon/euler.h --- a/lemon/euler.h Fri Apr 20 14:47:19 2007 +0000 +++ b/lemon/euler.h Fri Apr 20 14:49:21 2007 +0000 @@ -20,7 +20,7 @@ #include #include -/// \ingroup topology +/// \ingroup graph_prop /// \file /// \brief Euler tour /// @@ -32,7 +32,7 @@ ///Euler iterator for directed graphs. - /// \ingroup topology + /// \ingroup graph_prop ///This iterator converts to the \c Edge type of the graph and using ///operator ++ it provides an Euler tour of a \e directed ///graph (if there exists). @@ -120,7 +120,7 @@ ///Euler iterator for undirected graphs. - /// \ingroup topology + /// \ingroup graph_prop ///This iterator converts to the \c Edge (or \c UEdge) ///type of the graph and using ///operator ++ it provides an Euler tour of an undirected @@ -218,7 +218,7 @@ ///Checks if the graph is Euler - /// \ingroup topology + /// \ingroup graph_prop ///Checks if the graph is Euler. It works for both directed and ///undirected graphs. ///\note By definition, a directed graph is called \e Euler if 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 #include -/// \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 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 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 ///