Changeset 713:4ac30454f1c1 in lemon-main for doc
- Timestamp:
- 07/24/09 10:27:40 (15 years ago)
- Branch:
- default
- Phase:
- public
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/groups.dox
r663 r713 376 376 377 377 \f[ \min_{X \subset V, X\not\in \{\emptyset, V\}} 378 \sum_{uv\in A ,u\in X, v\not\in X}cap(uv) \f]378 \sum_{uv\in A: u\in X, v\not\in X}cap(uv) \f] 379 379 380 380 LEMON contains several algorithms related to minimum cut problems: … … 399 399 like connectivity, bipartiteness, euler property, simplicity etc. 400 400 401 \image html edge_biconnected_components.png402 \image latex edge_biconnected_components.eps "bi-edge-connected components" width=\textwidth401 \image html connected_components.png 402 \image latex connected_components.eps "Connected components" width=\textwidth 403 403 */ 404 404
Note: See TracChangeset
for help on using the changeset viewer.