Changeset 1793:d8130458dd86 in lemon0.x for lemon
 Timestamp:
 11/14/05 19:40:15 (15 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@2334
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/topology.h
r1767 r1793 71 71 /// Count the number of connected components of an undirected graph 72 72 /// 73 /// \param g The graph. In mustbe undirected.73 /// \param graph The graph. It should be undirected. 74 74 /// \return The number of components 75 75 template <typename UndirGraph> … … 114 114 /// \image latex connected_components.eps "Connected components" width=\textwidth 115 115 /// 116 /// \param g The graph. In mustbe undirected.117 /// \retval comp A writable node map. The values will be set from 0 to116 /// \param graph The graph. It should be undirected. 117 /// \retval compMap A writable node map. The values will be set from 0 to 118 118 /// the number of the connected components minus one. Each values of the map 119 119 /// will be set exactly once, the values of a certain component will be … … 238 238 /// \see connected 239 239 /// 240 /// \wa ning Empty graph is not strongly connected.240 /// \warning Empty graph is not strongly connected. 241 241 template <typename Graph> 242 242 bool stronglyConnected(const Graph& graph) { … … 292 292 /// directed paths in both direction. 293 293 /// 294 /// \param g The graph.294 /// \param graph The graph. 295 295 /// \return The number of components 296 296 template <typename Graph> … … 356 356 /// \image latex strongly_connected_components.eps "Strongly connected components" width=\textwidth 357 357 /// 358 /// \param g The graph. 359 /// \retval comp A writable node map. The values will be set from 0 to 358 /// \param graph The graph. 359 /// \param compMap A writable node map. The values will be set from 0 to 360 /// the number of the connected components minus one. Each values of the map 361 /// will be set exactly once, the values of a certain component will be 362 /// set continuously. 363 /// \retval compMap A writable node map. The values will be set from 0 to 360 364 /// the number of the strongly connected components minus one. Each values 361 365 /// of the map will be set exactly once, the values of a certain component … … 421 425 /// The strongly connected components are separated by the cut edges. 422 426 /// 423 /// \param g The graph.424 /// \retval c omp A writable edge map. The values will be set true when425 /// the edge is cut edge otherwise false.427 /// \param graph The graph. 428 /// \retval cutMap A writable node map. The values will be set true when the 429 /// edge is a cut edge. 426 430 /// 427 431 /// \return The number of cut edges … … 759 763 /// 760 764 /// \param graph The graph. 761 /// \retval comp A writable undir edge map. The values will be set from 0 to762 /// t he number of the biconnected components minus one. Each values765 /// \retval compMap A writable undir edge map. The values will be set from 0 766 /// to the number of the biconnected components minus one. Each values 763 767 /// of the map will be set exactly once, the values of a certain component 764 768 /// will be set continuously. … … 803 807 /// 804 808 /// \param graph The graph. 805 /// \retval c omp A writable edge map. The values will be set true when809 /// \retval cutMap A writable edge map. The values will be set true when 806 810 /// the node separate two or more components. 807 811 /// \return The number of the cut nodes. … … 1086 1090 /// 1087 1091 /// \param graph The graph. 1088 /// \retval comp A writable node map. The values will be set from 0 to1092 /// \retval compMap A writable node map. The values will be set from 0 to 1089 1093 /// the number of the biconnected components minus one. Each values 1090 1094 /// of the map will be set exactly once, the values of a certain component … … 1130 1134 /// 1131 1135 /// \param graph The graph. 1132 /// \retval c omp A writable node map. The values will be set true when the1136 /// \retval cutMap A writable node map. The values will be set true when the 1133 1137 /// edge is a cut edge. 1134 1138 /// \return The number of cut edges. … … 1188 1192 /// Sort the nodes of a DAG into topolgical order. 1189 1193 /// 1190 /// \param g The graph. In mustbe directed and acyclic.1191 /// \retval compA writable node map. The values will be set from 0 to1194 /// \param graph The graph. It should be directed and acyclic. 1195 /// \retval order A writable node map. The values will be set from 0 to 1192 1196 /// the number of the nodes in the graph minus one. Each values of the map 1193 1197 /// will be set exactly once, the values will be set descending order. … … 1228 1232 /// that the given graph is DAG. 1229 1233 /// 1230 /// \param g The graph. In mustbe directed and acyclic.1234 /// \param graph The graph. It should be directed and acyclic. 1231 1235 /// \retval order A readable  writable node map. The values will be set 1232 1236 /// from 0 to the number of the nodes in the graph minus one. Each values
Note: See TracChangeset
for help on using the changeset viewer.