equal
deleted
inserted
replaced
293 /// The strongly connected components are the classes of an |
293 /// The strongly connected components are the classes of an |
294 /// equivalence relation on the nodes of the graph. Two nodes are in |
294 /// equivalence relation on the nodes of the graph. Two nodes are in |
295 /// the same class if they are connected with directed paths in both |
295 /// the same class if they are connected with directed paths in both |
296 /// direction. |
296 /// direction. |
297 /// |
297 /// |
298 /// \param graph The graph. |
298 /// \param digraph The graph. |
299 /// \return The number of components |
299 /// \return The number of components |
300 /// \note By definition, the empty graph has zero |
300 /// \note By definition, the empty graph has zero |
301 /// strongly connected components. |
301 /// strongly connected components. |
302 template <typename Digraph> |
302 template <typename Digraph> |
303 int countStronglyConnectedComponents(const Digraph& digraph) { |
303 int countStronglyConnectedComponents(const Digraph& digraph) { |
1223 /// \brief Sort the nodes of a DAG into topolgical order. |
1223 /// \brief Sort the nodes of a DAG into topolgical order. |
1224 /// |
1224 /// |
1225 /// Sort the nodes of a DAG into topolgical order. It also checks |
1225 /// Sort the nodes of a DAG into topolgical order. It also checks |
1226 /// that the given graph is DAG. |
1226 /// that the given graph is DAG. |
1227 /// |
1227 /// |
1228 /// \param graph The graph. It must be directed and acyclic. |
1228 /// \param digraph The graph. It must be directed and acyclic. |
1229 /// \retval order A readable - writable node map. The values will be set |
1229 /// \retval order A readable - writable node map. The values will be set |
1230 /// from 0 to the number of the nodes in the graph minus one. Each values |
1230 /// from 0 to the number of the nodes in the graph minus one. Each values |
1231 /// of the map will be set exactly once, the values will be set descending |
1231 /// of the map will be set exactly once, the values will be set descending |
1232 /// order. |
1232 /// order. |
1233 /// \return %False when the graph is not DAG. |
1233 /// \return %False when the graph is not DAG. |