Changeset 559:c5fd2d996909 in lemon1.2 for lemon/connectivity.h
 Timestamp:
 03/29/09 23:08:20 (14 years ago)
 Branch:
 default
 Phase:
 public
 File:

 1 edited
Legend:
 Unmodified
 Added
 Removed

lemon/connectivity.h
r440 r559 47 47 /// Check whether the given undirected graph is connected. 48 48 /// \param graph The undirected graph. 49 /// \return %True when there is path between any two nodes in the graph.49 /// \return \c true when there is path between any two nodes in the graph. 50 50 /// \note By definition, the empty graph is connected. 51 51 template <typename Graph> … … 235 235 /// graph is strongly connected when any two nodes of the graph are 236 236 /// connected with directed paths in both direction. 237 /// \return %False when the graph is not strongly connected.237 /// \return \c false when the graph is not strongly connected. 238 238 /// \see connected 239 239 /// … … 710 710 /// 711 711 /// \param graph The graph. 712 /// \return %True when the graph binodeconnected.712 /// \return \c true when the graph binodeconnected. 713 713 template <typename Graph> 714 714 bool biNodeConnected(const Graph& graph) { … … 1231 1231 /// of the map will be set exactly once, the values will be set descending 1232 1232 /// order. 1233 /// \return %False when the graph is not DAG.1233 /// \return \c false when the graph is not DAG. 1234 1234 /// 1235 1235 /// \see topologicalSort … … 1280 1280 /// Check that the given directed graph is a DAG. The DAG is 1281 1281 /// an Directed Acyclic Digraph. 1282 /// \return %False when the graph is not DAG.1282 /// \return \c false when the graph is not DAG. 1283 1283 /// \see acyclic 1284 1284 template <typename Digraph> … … 1322 1322 /// Check that the given undirected graph acyclic. 1323 1323 /// \param graph The undirected graph. 1324 /// \return %True when there is no circle in the graph.1324 /// \return \c true when there is no circle in the graph. 1325 1325 /// \see dag 1326 1326 template <typename Graph> … … 1356 1356 /// Check that the given undirected graph is tree. 1357 1357 /// \param graph The undirected graph. 1358 /// \return %True when the graph is acyclic and connected.1358 /// \return \c true when the graph is acyclic and connected. 1359 1359 template <typename Graph> 1360 1360 bool tree(const Graph& graph) { … … 1449 1449 /// or not. The \ref Bfs algorithm is used to calculate the result. 1450 1450 /// \param graph The undirected graph. 1451 /// \return %True if \c graph is bipartite, %false otherwise.1451 /// \return \c true if \c graph is bipartite, \c false otherwise. 1452 1452 /// \sa bipartitePartitions 1453 1453 template<typename Graph> … … 1490 1490 /// \retval partMap A writable bool map of nodes. It will be set as the 1491 1491 /// two partitions of the graph. 1492 /// \return %True if \c graph is bipartite, %false otherwise.1492 /// \return \c true if \c graph is bipartite, \c false otherwise. 1493 1493 template<typename Graph, typename NodeMap> 1494 1494 inline bool bipartitePartitions(const Graph &graph, NodeMap &partMap){
Note: See TracChangeset
for help on using the changeset viewer.