doc/groups.dox
changeset 2429 fd51b552bcf2
parent 2391 14a343be7a5a
child 2489 48dddc283cfc
equal deleted inserted replaced
49:2b644f88688b 50:cb69f804a94d
   195 This group describes the algorithms
   195 This group describes the algorithms
   196 for finding minimum cut in graphs.
   196 for finding minimum cut in graphs.
   197 */
   197 */
   198 
   198 
   199 /**
   199 /**
   200 @defgroup topology Topology related algorithms
   200 @defgroup graph_prop Connectivity and other graph properties
   201 @ingroup algs
   201 @ingroup algs
   202 \brief This group describes the algorithms
   202 \brief This group describes the algorithms
   203 for discover the topology of the graphs.
   203 for discover the graph properties
   204 
   204 
   205 This group describes the algorithms
   205 This group describes the algorithms for discover the graph properties
   206 for discover the topology of the graphs.
   206 like connectivity, bipartiteness, euler property, simplicity, etc...
   207 
   207 
   208 \image html edge_biconnected_components.png
   208 \image html edge_biconnected_components.png
   209 \image latex edge_biconnected_components.eps "bi-edge-connected components" width=\textwidth
   209 \image latex edge_biconnected_components.eps "bi-edge-connected components" width=\textwidth
   210 */
   210 */
   211 
   211