Changeset 1763:49045f2d28d4 in lemon0.x for lemon/topology.h
 Timestamp:
 11/04/05 15:48:10 (16 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2295
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/topology.h
r1750 r1763 111 111 /// Find the connected components of an undirected graph. 112 112 /// 113 /// \image html connected_components.png 114 /// \image latex connected_components.eps "Connected components" width=\textwidth 115 /// 113 116 /// \param g The graph. In must be undirected. 114 117 /// \retval comp A writable node map. The values will be set from 0 to … … 117 120 /// set continuously. 118 121 /// \return The number of components 122 /// 119 123 template <class UndirGraph, class NodeMap> 120 124 int connectedComponents(const UndirGraph &graph, NodeMap &compMap) { … … 349 353 /// when there are directed paths between them in both direction. 350 354 /// 355 /// \image html strongly_connected_components.png 356 /// \image latex strongly_connected_components.eps "Strongly connected components" width=\textwidth 357 /// 351 358 /// \param g The graph. 352 359 /// \retval comp A writable node map. The values will be set from 0 to … … 355 362 /// will be set continuously. 356 363 /// \return The number of components 364 /// 357 365 template <typename Graph, typename NodeMap> 358 366 int stronglyConnectedComponents(const Graph& graph, NodeMap& compMap) { … … 747 755 /// when they are on same circle. 748 756 /// 757 /// \image html node_biconnected_components.png 758 /// \image latex node_biconnected_components.eps "Node biconnected components" width=\textwidth 759 /// 749 760 /// \param graph The graph. 750 761 /// \retval comp A writable undir edge map. The values will be set from 0 to … … 753 764 /// will be set continuously. 754 765 /// \return The number of components. 766 /// 755 767 template <typename UndirGraph, typename UndirEdgeMap> 756 768 int nodeBiconnectedComponents(const UndirGraph& graph, … … 1070 1082 /// connected at least two edgedisjoint paths. 1071 1083 /// 1084 /// \image html edge_biconnected_components.png 1085 /// \image latex edge_biconnected_components.eps "Edge biconnected components" width=\textwidth 1086 /// 1072 1087 /// \param graph The graph. 1073 1088 /// \retval comp A writable node map. The values will be set from 0 to … … 1076 1091 /// will be set continuously. 1077 1092 /// \return The number of components. 1093 /// 1078 1094 template <typename UndirGraph, typename NodeMap> 1079 1095 int edgeBiconnectedComponents(const UndirGraph& graph, NodeMap& compMap) { … … 1323 1339 Node target = graph.target(edge); 1324 1340 if (dfs.reached(target) && 1325 dfs.pred (source) != graph.oppositeEdge(edge)) {1341 dfs.predEdge(source) != graph.oppositeEdge(edge)) { 1326 1342 return false; 1327 1343 } … … 1354 1370 Node target = graph.target(edge); 1355 1371 if (dfs.reached(target) && 1356 dfs.pred (source) != graph.oppositeEdge(edge)) {1372 dfs.predEdge(source) != graph.oppositeEdge(edge)) { 1357 1373 return false; 1358 1374 }
Note: See TracChangeset
for help on using the changeset viewer.