1.1 --- a/lemon/connectivity.h	Thu Mar 05 10:13:20 2009 +0000
     1.2 +++ b/lemon/connectivity.h	Sun Mar 29 23:08:20 2009 +0200
     1.3 @@ -46,7 +46,7 @@
     1.4    ///
     1.5    /// Check whether the given undirected graph is connected.
     1.6    /// \param graph The undirected graph.
     1.7 -  /// \return %True when there is path between any two nodes in the graph.
     1.8 +  /// \return \c true when there is path between any two nodes in the graph.
     1.9    /// \note By definition, the empty graph is connected.
    1.10    template <typename Graph>
    1.11    bool connected(const Graph& graph) {
    1.12 @@ -234,7 +234,7 @@
    1.13    /// Check whether the given directed graph is strongly connected. The
    1.14    /// graph is strongly connected when any two nodes of the graph are
    1.15    /// connected with directed paths in both direction.
    1.16 -  /// \return %False when the graph is not strongly connected.
    1.17 +  /// \return \c false when the graph is not strongly connected.
    1.18    /// \see connected
    1.19    ///
    1.20    /// \note By definition, the empty graph is strongly connected.
    1.21 @@ -709,7 +709,7 @@
    1.22    /// on same circle.
    1.23    ///
    1.24    /// \param graph The graph.
    1.25 -  /// \return %True when the graph bi-node-connected.
    1.26 +  /// \return \c true when the graph bi-node-connected.
    1.27    template <typename Graph>
    1.28    bool biNodeConnected(const Graph& graph) {
    1.29      return countBiNodeConnectedComponents(graph) <= 1;
    1.30 @@ -1230,7 +1230,7 @@
    1.31    /// from 0 to the number of the nodes in the graph minus one. Each values
    1.32    /// of the map will be set exactly once, the values will be set descending
    1.33    /// order.
    1.34 -  /// \return %False when the graph is not DAG.
    1.35 +  /// \return \c false when the graph is not DAG.
    1.36    ///
    1.37    /// \see topologicalSort
    1.38    /// \see dag
    1.39 @@ -1279,7 +1279,7 @@
    1.40    ///
    1.41    /// Check that the given directed graph is a DAG. The DAG is
    1.42    /// an Directed Acyclic Digraph.
    1.43 -  /// \return %False when the graph is not DAG.
    1.44 +  /// \return \c false when the graph is not DAG.
    1.45    /// \see acyclic
    1.46    template <typename Digraph>
    1.47    bool dag(const Digraph& digraph) {
    1.48 @@ -1321,7 +1321,7 @@
    1.49    ///
    1.50    /// Check that the given undirected graph acyclic.
    1.51    /// \param graph The undirected graph.
    1.52 -  /// \return %True when there is no circle in the graph.
    1.53 +  /// \return \c true when there is no circle in the graph.
    1.54    /// \see dag
    1.55    template <typename Graph>
    1.56    bool acyclic(const Graph& graph) {
    1.57 @@ -1355,7 +1355,7 @@
    1.58    ///
    1.59    /// Check that the given undirected graph is tree.
    1.60    /// \param graph The undirected graph.
    1.61 -  /// \return %True when the graph is acyclic and connected.
    1.62 +  /// \return \c true when the graph is acyclic and connected.
    1.63    template <typename Graph>
    1.64    bool tree(const Graph& graph) {
    1.65      checkConcept<concepts::Graph, Graph>();
    1.66 @@ -1448,7 +1448,7 @@
    1.67    /// The function checks if the given undirected \c graph graph is bipartite
    1.68    /// or not. The \ref Bfs algorithm is used to calculate the result.
    1.69    /// \param graph The undirected graph.
    1.70 -  /// \return %True if \c graph is bipartite, %false otherwise.
    1.71 +  /// \return \c true if \c graph is bipartite, \c false otherwise.
    1.72    /// \sa bipartitePartitions
    1.73    template<typename Graph>
    1.74    inline bool bipartite(const Graph &graph){
    1.75 @@ -1489,7 +1489,7 @@
    1.76    /// \param graph The undirected graph.
    1.77    /// \retval partMap A writable bool map of nodes. It will be set as the
    1.78    /// two partitions of the graph.
    1.79 -  /// \return %True if \c graph is bipartite, %false otherwise.
    1.80 +  /// \return \c true if \c graph is bipartite, \c false otherwise.
    1.81    template<typename Graph, typename NodeMap>
    1.82    inline bool bipartitePartitions(const Graph &graph, NodeMap &partMap){
    1.83      using namespace _connectivity_bits;