Mercuriallemon / comparison
summary | shortlog | changelog | graph | tags | bookmarks | branches | files | changeset | file | latest | revisions | annotate | diff | comparison | raw | help
doc/groups.dox
changeset 636 630c4898c548
parent 611 eda12d8ac953
child 637 b61354458b59
equal deleted inserted replaced
25:51d2a0436c17 26:6746935d0064 
   405 If you want to find minimum cut just between two distinict nodes,
 
   405 If you want to find minimum cut just between two distinict nodes,
 
   406 see the \ref max_flow "maximum flow problem".
 
   406 see the \ref max_flow "maximum flow problem".
 
   407 */
 
   407 */
 
   408 
   408 
   409 /**
 
   409 /**
 
   410 @defgroup graph_prop Connectivity and Other Graph Properties
 
   410 @defgroup graph_properties Connectivity and Other Graph Properties
 
   411 @ingroup algs
 
   411 @ingroup algs
 
   412 \brief Algorithms for discovering the graph properties
 
   412 \brief Algorithms for discovering the graph properties
 
   413 
   413 
   414 This group contains the algorithms for discovering the graph properties
 
   414 This group contains the algorithms for discovering the graph properties
 
   415 like connectivity, bipartiteness, euler property, simplicity etc.
 
   415 like connectivity, bipartiteness, euler property, simplicity etc.
lemon