lemon-1.1: comparison doc/groups.dox

equal deleted inserted replaced

-:51d2a0436c17
+:6746935d0064
 If you want to find minimum cut just between two distinict nodes,
 see the \ref max_flow "maximum flow problem".
 */
 /**
-@defgroup graph_prop Connectivity and Other Graph Properties
+@defgroup graph_properties Connectivity and Other Graph Properties
 @ingroup algs
 \brief Algorithms for discovering the graph properties
 This group contains the algorithms for discovering the graph properties
 like connectivity, bipartiteness, euler property, simplicity etc.