Changeset 1763:49045f2d28d4 in lemon-0.x for lemon/topology.h

Timestamp:

11/04/05 15:48:10 (19 years ago)

Author:

Balazs Dezso

Branch:

default

Phase:

public

Convert:

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

Message:

pred => predEdge rename

File:

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

lemon/topology.h

@@ -111 +111 @@
   /// Find the connected components of an undirected graph.
   ///
+  /// \image html connected_components.png
+  /// \image latex connected_components.eps "Connected components" width=\textwidth
+  ///
   /// \param g The graph. In must be undirected.
   /// \retval comp A writable node map. The values will be set from 0 to
@@ -117 +120 @@
   /// set continuously.
   /// \return The number of components
+  ///
   template <class UndirGraph, class NodeMap>
   int connectedComponents(const UndirGraph &graph, NodeMap &compMap) {
@@ -349 +353 @@
   /// when there are directed paths between them in both direction.
   ///
+  /// \image html strongly_connected_components.png
+  /// \image latex strongly_connected_components.eps "Strongly connected components" width=\textwidth
+  ///
   /// \param g The graph.
   /// \retval comp A writable node map. The values will be set from 0 to
@@ -355 +362 @@
   /// will be set continuously.
   /// \return The number of components
+  ///
   template <typename Graph, typename NodeMap>
   int stronglyConnectedComponents(const Graph& graph, NodeMap& compMap) {
@@ -747 +755 @@
   /// when they are on same circle.
   ///
+  /// \image html node_biconnected_components.png
+  /// \image latex node_biconnected_components.eps "Node biconnected components" width=\textwidth
+  ///
   /// \param graph The graph.
   /// \retval comp A writable undir edge map. The values will be set from 0 to
@@ -753 +764 @@
   /// will be set continuously.
   /// \return The number of components.
+  ///
   template <typename UndirGraph, typename UndirEdgeMap>
   int nodeBiconnectedComponents(const UndirGraph& graph, 
@@ -1070 +1082 @@
   /// connected at least two edge-disjoint paths.
   ///
+  /// \image html edge_biconnected_components.png
+  /// \image latex edge_biconnected_components.eps "Edge biconnected components" width=\textwidth
+  ///
   /// \param graph The graph.
   /// \retval comp A writable node map. The values will be set from 0 to
@@ -1076 +1091 @@
   /// will be set continuously.
   /// \return The number of components.
+  ///
   template <typename UndirGraph, typename NodeMap>
   int edgeBiconnectedComponents(const UndirGraph& graph, NodeMap& compMap) { 
@@ -1323 +1339 @@
           Node target = graph.target(edge);
           if (dfs.reached(target) && 
-              dfs.pred(source) != graph.oppositeEdge(edge)) {
+              dfs.predEdge(source) != graph.oppositeEdge(edge)) {
             return false;
           }
@@ -1354 +1370 @@
       Node target = graph.target(edge);
       if (dfs.reached(target) && 
-          dfs.pred(source) != graph.oppositeEdge(edge)) {
+          dfs.predEdge(source) != graph.oppositeEdge(edge)) {
         return false;
       }