COIN-OR::LEMON - Graph Library

Changeset 2421:160ebfb944a9 in lemon-0.x


Ignore:
Timestamp:
04/18/07 18:35:04 (13 years ago)
Author:
Balazs Dezso
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3256
Message:

Small changes

Location:
lemon
Files:
2 edited

Legend:

Unmodified
Added
Removed
  • lemon/lp_utils.h

    r2391 r2421  
    887887        }
    888888        os << e.constComp() << " ";
    889       }
     889      }
     890      if (e.begin() == e.end() && e.constComp() == 0.0) {
     891        os << "0 ";
     892      }
    890893    }
    891894
  • lemon/topology.h

    r2391 r2421  
    293293  ///
    294294  /// Count the strongly connected components of a directed graph.
    295   /// The strongly connected components are the classes of an equivalence
    296   /// relation on the nodes of the graph. Two nodes are connected with
    297   /// directed paths in both direction.
     295  /// The strongly connected components are the classes of an
     296  /// equivalence relation on the nodes of the graph. Two nodes are in
     297  /// the same class if they are connected with directed paths in both
     298  /// direction.
    298299  ///
    299300  /// \param graph The graph.
     
    355356  /// \brief Find the strongly connected components of a directed graph
    356357  ///
    357   /// Find the strongly connected components of a directed graph.
    358   /// The strongly connected components are the classes of an equivalence
    359   /// relation on the nodes of the graph. Two nodes are in relationship
    360   /// when there are directed paths between them in both direction.
     358  /// Find the strongly connected components of a directed graph.  The
     359  /// strongly connected components are the classes of an equivalence
     360  /// relation on the nodes of the graph. Two nodes are in
     361  /// relationship when there are directed paths between them in both
     362  /// direction. In addition, the numbering of components will satisfy
     363  /// that there is no edge going from a higher numbered component to
     364  /// a lower.
    361365  ///
    362366  /// \image html strongly_connected_components.png
     
    365369  /// \param graph The graph.
    366370  /// \retval compMap A writable node map. The values will be set from 0 to
    367   /// the number of the strongly connected components minus one. Each values
     371  /// the number of the strongly connected components minus one. Each value
    368372  /// of the map will be set exactly once, the values of a certain component
    369373  /// will be set continuously.
     
    10271031
    10281032  template <typename UGraph>
    1029   int countbiEdgeConnectedComponents(const UGraph& graph);
     1033  int countBiEdgeConnectedComponents(const UGraph& graph);
    10301034
    10311035  /// \ingroup topology
Note: See TracChangeset for help on using the changeset viewer.