1.1 --- a/lemon/topology.h	Fri Nov 04 15:48:06 2005 +0000
     1.2 +++ b/lemon/topology.h	Fri Nov 04 15:52:24 2005 +0000
     1.3 @@ -696,17 +696,17 @@
     1.4  
     1.5    /// \ingroup topology
     1.6    ///
     1.7 -  /// \brief Checks the graph is node biconnected.
     1.8 +  /// \brief Checks the graph is bi-node-connected.
     1.9    ///
    1.10 -  /// This function checks that the undirected graph is node biconnected  
    1.11 -  /// graph. The graph is node biconnected if any two undirected edge is 
    1.12 +  /// This function checks that the undirected graph is bi-node-connected  
    1.13 +  /// graph. The graph is bi-node-connected if any two undirected edge is 
    1.14    /// on same circle.
    1.15    ///
    1.16    /// \param graph The graph.
    1.17 -  /// \return %True when the graph node biconnected.
    1.18 +  /// \return %True when the graph bi-node-connected.
    1.19    /// \todo Make it faster.
    1.20    template <typename UndirGraph>
    1.21 -  bool nodeBiconnected(const UndirGraph& graph) {
    1.22 +  bool biNodeConnected(const UndirGraph& graph) {
    1.23      return countNodeBiconnectedComponents(graph) == 1;
    1.24    }
    1.25  
    1.26 @@ -714,7 +714,7 @@
    1.27    ///
    1.28    /// \brief Count the biconnected components.
    1.29    ///
    1.30 -  /// This function finds the node biconnected components in an undirected 
    1.31 +  /// This function finds the bi-node-connected components in an undirected 
    1.32    /// graph. The biconnected components are the classes of an equivalence 
    1.33    /// relation on the undirected edges. Two undirected edge is in relationship
    1.34    /// when they are on same circle.
    1.35 @@ -747,15 +747,15 @@
    1.36  
    1.37    /// \ingroup topology
    1.38    ///
    1.39 -  /// \brief Find the node biconnected components.
    1.40 +  /// \brief Find the bi-node-connected components.
    1.41    ///
    1.42 -  /// This function finds the node biconnected components in an undirected 
    1.43 -  /// graph. The node biconnected components are the classes of an equivalence
    1.44 +  /// This function finds the bi-node-connected components in an undirected 
    1.45 +  /// graph. The bi-node-connected components are the classes of an equivalence
    1.46    /// relation on the undirected edges. Two undirected edge are in relationship
    1.47    /// when they are on same circle.
    1.48    ///
    1.49    /// \image html node_biconnected_components.png
    1.50 -  /// \image latex node_biconnected_components.eps "Node biconnected components" width=\textwidth
    1.51 +  /// \image latex node_biconnected_components.eps "bi-node-connected components" width=\textwidth
    1.52    ///
    1.53    /// \param graph The graph.
    1.54    /// \retval comp A writable undir edge map. The values will be set from 0 to
    1.55 @@ -765,7 +765,7 @@
    1.56    /// \return The number of components.
    1.57    ///
    1.58    template <typename UndirGraph, typename UndirEdgeMap>
    1.59 -  int nodeBiconnectedComponents(const UndirGraph& graph, 
    1.60 +  int biNodeConnectedComponents(const UndirGraph& graph, 
    1.61  				UndirEdgeMap& compMap) {
    1.62      checkConcept<concept::UndirGraph, UndirGraph>();
    1.63      typedef typename UndirGraph::NodeIt NodeIt;
    1.64 @@ -793,10 +793,10 @@
    1.65  
    1.66    /// \ingroup topology
    1.67    ///
    1.68 -  /// \brief Find the node biconnected cut nodes.
    1.69 +  /// \brief Find the bi-node-connected cut nodes.
    1.70    ///
    1.71 -  /// This function finds the node biconnected cut nodes in an undirected 
    1.72 -  /// graph. The node biconnected components are the classes of an equivalence
    1.73 +  /// This function finds the bi-node-connected cut nodes in an undirected 
    1.74 +  /// graph. The bi-node-connected components are the classes of an equivalence
    1.75    /// relation on the undirected edges. Two undirected edges are in 
    1.76    /// relationship when they are on same circle. The biconnected components 
    1.77    /// are separted by nodes which are the cut nodes of the components.
    1.78 @@ -806,7 +806,7 @@
    1.79    /// the node separate two or more components.
    1.80    /// \return The number of the cut nodes.
    1.81    template <typename UndirGraph, typename NodeMap>
    1.82 -  int nodeBiconnectedCutNodes(const UndirGraph& graph, NodeMap& cutMap) {
    1.83 +  int biNodeConnectedCutNodes(const UndirGraph& graph, NodeMap& cutMap) {
    1.84      checkConcept<concept::UndirGraph, UndirGraph>();
    1.85      typedef typename UndirGraph::Node Node;
    1.86      typedef typename UndirGraph::NodeIt NodeIt;
    1.87 @@ -1023,26 +1023,26 @@
    1.88  
    1.89    /// \ingroup topology
    1.90    ///
    1.91 -  /// \brief Checks that the graph is edge biconnected.
    1.92 +  /// \brief Checks that the graph is bi-edge-connected.
    1.93    ///
    1.94 -  /// This function checks that the graph is edge biconnected. The undirected
    1.95 -  /// graph is edge biconnected when any two nodes are connected with two
    1.96 +  /// This function checks that the graph is bi-edge-connected. The undirected
    1.97 +  /// graph is bi-edge-connected when any two nodes are connected with two
    1.98    /// edge-disjoint paths.
    1.99    ///
   1.100    /// \param graph The undirected graph.
   1.101    /// \return The number of components.
   1.102    /// \todo Make it faster.
   1.103    template <typename UndirGraph>
   1.104 -  bool edgeBiconnected(const UndirGraph& graph) { 
   1.105 +  bool biEdgeConnected(const UndirGraph& graph) { 
   1.106      return countEdgeBiconnectedComponents(graph) == 1;
   1.107    }
   1.108  
   1.109    /// \ingroup topology
   1.110    ///
   1.111 -  /// \brief Count the edge biconnected components.
   1.112 +  /// \brief Count the bi-edge-connected components.
   1.113    ///
   1.114 -  /// This function count the edge biconnected components in an undirected 
   1.115 -  /// graph. The edge biconnected components are the classes of an equivalence
   1.116 +  /// This function count the bi-edge-connected components in an undirected 
   1.117 +  /// graph. The bi-edge-connected components are the classes of an equivalence
   1.118    /// relation on the nodes. Two nodes are in relationship when they are  
   1.119    /// connected with at least two edge-disjoint paths.
   1.120    ///
   1.121 @@ -1074,15 +1074,15 @@
   1.122  
   1.123    /// \ingroup topology
   1.124    ///
   1.125 -  /// \brief Find the edge biconnected components.
   1.126 +  /// \brief Find the bi-edge-connected components.
   1.127    ///
   1.128 -  /// This function finds the edge biconnected components in an undirected 
   1.129 -  /// graph. The edge biconnected components are the classes of an equivalence
   1.130 +  /// This function finds the bi-edge-connected components in an undirected 
   1.131 +  /// graph. The bi-edge-connected components are the classes of an equivalence
   1.132    /// relation on the nodes. Two nodes are in relationship when they are  
   1.133    /// connected at least two edge-disjoint paths.
   1.134    ///
   1.135    /// \image html edge_biconnected_components.png
   1.136 -  /// \image latex edge_biconnected_components.eps "Edge biconnected components" width=\textwidth
   1.137 +  /// \image latex edge_biconnected_components.eps "bi-edge-connected components" width=\textwidth
   1.138    ///
   1.139    /// \param graph The graph.
   1.140    /// \retval comp A writable node map. The values will be set from 0 to
   1.141 @@ -1092,7 +1092,7 @@
   1.142    /// \return The number of components.
   1.143    ///
   1.144    template <typename UndirGraph, typename NodeMap>
   1.145 -  int edgeBiconnectedComponents(const UndirGraph& graph, NodeMap& compMap) { 
   1.146 +  int biEdgeConnectedComponents(const UndirGraph& graph, NodeMap& compMap) { 
   1.147      checkConcept<concept::UndirGraph, UndirGraph>();
   1.148      typedef typename UndirGraph::NodeIt NodeIt;
   1.149      typedef typename UndirGraph::Node Node;
   1.150 @@ -1119,12 +1119,12 @@
   1.151  
   1.152    /// \ingroup topology
   1.153    ///
   1.154 -  /// \brief Find the edge biconnected cut edges.
   1.155 +  /// \brief Find the bi-edge-connected cut edges.
   1.156    ///
   1.157 -  /// This function finds the edge biconnected components in an undirected 
   1.158 -  /// graph. The edge biconnected components are the classes of an equivalence
   1.159 +  /// This function finds the bi-edge-connected components in an undirected 
   1.160 +  /// graph. The bi-edge-connected components are the classes of an equivalence
   1.161    /// relation on the nodes. Two nodes are in relationship when they are 
   1.162 -  /// connected with at least two edge-disjoint paths. The edge biconnected 
   1.163 +  /// connected with at least two edge-disjoint paths. The bi-edge-connected 
   1.164    /// components are separted by edges which are the cut edges of the 
   1.165    /// components.
   1.166    ///
   1.167 @@ -1133,7 +1133,7 @@
   1.168    /// edge is a cut edge.
   1.169    /// \return The number of cut edges.
   1.170    template <typename UndirGraph, typename UndirEdgeMap>
   1.171 -  int edgeBiconnectedCutEdges(const UndirGraph& graph, UndirEdgeMap& cutMap) { 
   1.172 +  int biEdgeConnectedCutEdges(const UndirGraph& graph, UndirEdgeMap& cutMap) { 
   1.173      checkConcept<concept::UndirGraph, UndirGraph>();
   1.174      typedef typename UndirGraph::NodeIt NodeIt;
   1.175      typedef typename UndirGraph::UndirEdge UndirEdge;