# Changeset 586:7c12061bd271 in lemon-1.2 for lemon

Ignore:
Timestamp:
04/15/09 04:26:13 (15 years ago)
Branch:
default
Phase:
public
Message:

Add images + fixes in the doc of connectivity tools (#262)

Location:
lemon
Files:
2 edited

Unmodified
Removed
• ## lemon/connectivity.h

 r559 #include /// \ingroup connectivity /// \ingroup graph_properties /// \file /// \brief Connectivity algorithms namespace lemon { /// \ingroup connectivity /// \ingroup graph_properties /// /// \brief Check whether the given undirected graph is connected. } /// \ingroup connectivity /// \ingroup graph_properties /// /// \brief Count the number of connected components of an undirected graph } /// \ingroup connectivity /// \ingroup graph_properties /// /// \brief Find the connected components of an undirected graph /// /// Find the connected components of an undirected graph. /// /// \image html connected_components.png /// \image latex connected_components.eps "Connected components" width=\textwidth /// /// \param graph The graph. It must be undirected. /// set continuously. /// \return The number of components /// template int connectedComponents(const Graph &graph, NodeMap &compMap) { /// \ingroup connectivity /// \ingroup graph_properties /// /// \brief Check whether the given directed graph is strongly connected. } /// \ingroup connectivity /// \ingroup graph_properties /// /// \brief Count the strongly connected components of a directed graph } /// \ingroup connectivity /// \ingroup graph_properties /// /// \brief Find the strongly connected components of a directed graph /// a lower. /// /// \image html strongly_connected_components.png /// \image latex strongly_connected_components.eps "Strongly connected components" width=\textwidth /// /// \param digraph The digraph. /// \retval compMap A writable node map. The values will be set from 0 to /// will be set continuously. /// \return The number of components /// template int stronglyConnectedComponents(const Digraph& digraph, NodeMap& compMap) { } /// \ingroup connectivity /// \ingroup graph_properties /// /// \brief Find the cut arcs of the strongly connected components. int countBiNodeConnectedComponents(const Graph& graph); /// \ingroup connectivity /// \ingroup graph_properties /// /// \brief Checks the graph is bi-node-connected. } /// \ingroup connectivity /// \ingroup graph_properties /// /// \brief Count the biconnected components. } /// \ingroup connectivity /// \ingroup graph_properties /// /// \brief Find the bi-node-connected components. /// relation on the undirected edges. Two undirected edge are in relationship /// when they are on same circle. /// /// \image html node_biconnected_components.png /// \image latex node_biconnected_components.eps "bi-node-connected components" width=\textwidth /// /// \param graph The graph. /// will be set continuously. /// \return The number of components. /// template int biNodeConnectedComponents(const Graph& graph, } /// \ingroup connectivity /// \ingroup graph_properties /// /// \brief Find the bi-node-connected cut nodes. int countBiEdgeConnectedComponents(const Graph& graph); /// \ingroup connectivity /// \ingroup graph_properties /// /// \brief Checks that the graph is bi-edge-connected. } /// \ingroup connectivity /// \ingroup graph_properties /// /// \brief Count the bi-edge-connected components. } /// \ingroup connectivity /// \ingroup graph_properties /// /// \brief Find the bi-edge-connected components. /// relation on the nodes. Two nodes are in relationship when they are /// connected at least two edge-disjoint paths. /// /// \image html edge_biconnected_components.png /// \image latex edge_biconnected_components.eps "bi-edge-connected components" width=\textwidth /// /// \param graph The graph. /// will be set continuously. /// \return The number of components. /// template int biEdgeConnectedComponents(const Graph& graph, NodeMap& compMap) { } /// \ingroup connectivity /// \ingroup graph_properties /// /// \brief Find the bi-edge-connected cut edges. } /// \ingroup connectivity /// \ingroup graph_properties /// /// \brief Sort the nodes of a DAG into topolgical order. } /// \ingroup connectivity /// \ingroup graph_properties /// /// \brief Sort the nodes of a DAG into topolgical order. } /// \ingroup connectivity /// \ingroup graph_properties /// /// \brief Check that the given directed graph is a DAG. } /// \ingroup connectivity /// \ingroup graph_properties /// /// \brief Check that the given undirected graph is acyclic. } /// \ingroup connectivity /// \ingroup graph_properties /// /// \brief Check that the given undirected graph is tree. } /// \ingroup connectivity /// \ingroup graph_properties /// /// \brief Check if the given undirected graph is bipartite or not } /// \ingroup connectivity /// \ingroup graph_properties /// /// \brief Check if the given undirected graph is bipartite or not /// During the execution, the \c partMap will be set as the two /// partitions of the graph. /// /// \image html bipartite_partitions.png /// \image latex bipartite_partitions.eps "Bipartite partititions" width=\textwidth /// /// \param graph The undirected graph. /// \retval partMap A writable bool map of nodes. It will be set as the
• ## lemon/euler.h

 r559 #include /// \ingroup graph_prop /// \ingroup graph_properties /// \file /// \brief Euler tour ///Euler iterator for digraphs. /// \ingroup graph_prop /// \ingroup graph_properties ///This iterator converts to the \c Arc type of the digraph and using ///operator ++, it provides an Euler tour of a \e directed ///Euler iterator for graphs. /// \ingroup graph_prop /// \ingroup graph_properties ///This iterator converts to the \c Arc (or \c Edge) ///type of the digraph and using ///Checks if the graph is Eulerian /// \ingroup graph_prop /// \ingroup graph_properties ///Checks if the graph is Eulerian. It works for both directed and undirected ///graphs.
Note: See TracChangeset for help on using the changeset viewer.