lemon-0.x: comparison doc/groups.dox

equal deleted inserted replaced

-:2b644f88688b
+:cb69f804a94d
 This group describes the algorithms
 for finding minimum cut in graphs.
 */
 /**
-@defgroup topology Topology related algorithms
+@defgroup graph_prop Connectivity and other graph properties
 @ingroup algs
 \brief This group describes the algorithms
-for discover the topology of the graphs.
+for discover the graph properties
-This group describes the algorithms
+This group describes the algorithms for discover the graph properties
-for discover the topology of the graphs.
+like connectivity, bipartiteness, euler property, simplicity, etc...
 \image html edge_biconnected_components.png
 \image latex edge_biconnected_components.eps "bi-edge-connected components" width=\textwidth
 */