Changeset 2421:160ebfb944a9 in lemon0.x
 Timestamp:
 04/18/07 18:35:04 (17 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@3256
 Location:
 lemon
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

lemon/lp_utils.h
r2391 r2421 887 887 } 888 888 os << e.constComp() << " "; 889 } 889 } 890 if (e.begin() == e.end() && e.constComp() == 0.0) { 891 os << "0 "; 892 } 890 893 } 891 894 
lemon/topology.h
r2391 r2421 293 293 /// 294 294 /// 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. 298 299 /// 299 300 /// \param graph The graph. … … 355 356 /// \brief Find the strongly connected components of a directed graph 356 357 /// 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. 361 365 /// 362 366 /// \image html strongly_connected_components.png … … 365 369 /// \param graph The graph. 366 370 /// \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 value s371 /// the number of the strongly connected components minus one. Each value 368 372 /// of the map will be set exactly once, the values of a certain component 369 373 /// will be set continuously. … … 1027 1031 1028 1032 template <typename UGraph> 1029 int count biEdgeConnectedComponents(const UGraph& graph);1033 int countBiEdgeConnectedComponents(const UGraph& graph); 1030 1034 1031 1035 /// \ingroup topology
Note: See TracChangeset
for help on using the changeset viewer.