Changeset 789:8e68671af789 in lemon for doc
 Timestamp:
 09/30/09 08:41:06 (10 years ago)
 Branch:
 default
 Parents:
 788:10c9c3a35b83 (diff), 780:abf31e4af617 (diff)
Note: this is a merge changeset, the changes displayed below correspond to the merge itself.
Use the (diff) links above to see all the changes relative to each parent.  Phase:
 public
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

doc/groups.dox
r762 r789 680 680 \brief Skeleton and concept checking classes for graph structures 681 681 682 This group contains the skeletons and concept checking classes of LEMON's683 graph structures and helper classes used to implement these.682 This group contains the skeletons and concept checking classes of 683 graph structures. 684 684 */ 685 685 
doc/groups.dox
r782 r789 227 227 228 228 /** 229 @defgroup matrices Matrices230 @ingroup datas231 \brief Two dimensional data storages implemented in LEMON.232 233 This group contains two dimensional data storages implemented in LEMON.234 */235 236 /**237 229 @defgroup paths Path Structures 238 230 @ingroup datas … … 247 239 any kind of path structure. 248 240 249 \sa lemon::concepts::Path 241 \sa \ref concepts::Path "Path concept" 242 */ 243 244 /** 245 @defgroup heaps Heap Structures 246 @ingroup datas 247 \brief %Heap structures implemented in LEMON. 248 249 This group contains the heap structures implemented in LEMON. 250 251 LEMON provides several heap classes. They are efficient implementations 252 of the abstract data type \e priority \e queue. They store items with 253 specified values called \e priorities in such a way that finding and 254 removing the item with minimum priority are efficient. 255 The basic operations are adding and erasing items, changing the priority 256 of an item, etc. 257 258 Heaps are crucial in several algorithms, such as Dijkstra and Prim. 259 The heap implementations have the same interface, thus any of them can be 260 used easily in such algorithms. 261 262 \sa \ref concepts::Heap "Heap concept" 263 */ 264 265 /** 266 @defgroup matrices Matrices 267 @ingroup datas 268 \brief Two dimensional data storages implemented in LEMON. 269 270 This group contains two dimensional data storages implemented in LEMON. 250 271 */ 251 272 … … 257 278 This group contains some data structures implemented in LEMON in 258 279 order to make it easier to implement combinatorial algorithms. 280 */ 281 282 /** 283 @defgroup geomdat Geometric Data Structures 284 @ingroup auxdat 285 \brief Geometric data structures implemented in LEMON. 286 287 This group contains geometric data structures implemented in LEMON. 288 289  \ref lemon::dim2::Point "dim2::Point" implements a two dimensional 290 vector with the usual operations. 291  \ref lemon::dim2::Box "dim2::Box" can be used to determine the 292 rectangular bounding box of a set of \ref lemon::dim2::Point 293 "dim2::Point"'s. 294 */ 295 296 /** 297 @defgroup matrices Matrices 298 @ingroup auxdat 299 \brief Two dimensional data storages implemented in LEMON. 300 301 This group contains two dimensional data storages implemented in LEMON. 259 302 */ 260 303 … … 299 342 300 343 /** 344 @defgroup spantree Minimum Spanning Tree Algorithms 345 @ingroup algs 346 \brief Algorithms for finding minimum cost spanning trees and arborescences. 347 348 This group contains the algorithms for finding minimum cost spanning 349 trees and arborescences. 350 */ 351 352 /** 301 353 @defgroup max_flow Maximum Flow Algorithms 302 354 @ingroup algs … … 376 428 377 429 \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]430 \sum_{uv\in A: u\in X, v\not\in X}cap(uv) \f] 379 431 380 432 LEMON contains several algorithms related to minimum cut problems: … … 389 441 If you want to find minimum cut just between two distinict nodes, 390 442 see the \ref max_flow "maximum flow problem". 391 */392 393 /**394 @defgroup graph_properties Connectivity and Other Graph Properties395 @ingroup algs396 \brief Algorithms for discovering the graph properties397 398 This group contains the algorithms for discovering the graph properties399 like connectivity, bipartiteness, euler property, simplicity etc.400 401 \image html edge_biconnected_components.png402 \image latex edge_biconnected_components.eps "biedgeconnected components" width=\textwidth403 */404 405 /**406 @defgroup planar Planarity Embedding and Drawing407 @ingroup algs408 \brief Algorithms for planarity checking, embedding and drawing409 410 This group contains the algorithms for planarity checking,411 embedding and drawing.412 413 \image html planar.png414 \image latex planar.eps "Plane graph" width=\textwidth415 443 */ 416 444 … … 456 484 457 485 /** 458 @defgroup spantree Minimum Spanning Tree Algorithms 459 @ingroup algs 460 \brief Algorithms for finding minimum cost spanning trees and arborescences. 461 462 This group contains the algorithms for finding minimum cost spanning 463 trees and arborescences. 486 @defgroup graph_properties Connectivity and Other Graph Properties 487 @ingroup algs 488 \brief Algorithms for discovering the graph properties 489 490 This group contains the algorithms for discovering the graph properties 491 like connectivity, bipartiteness, euler property, simplicity etc. 492 493 \image html connected_components.png 494 \image latex connected_components.eps "Connected components" width=\textwidth 495 */ 496 497 /** 498 @defgroup planar Planarity Embedding and Drawing 499 @ingroup algs 500 \brief Algorithms for planarity checking, embedding and drawing 501 502 This group contains the algorithms for planarity checking, 503 embedding and drawing. 504 505 \image html planar.png 506 \image latex planar.eps "Plane graph" width=\textwidth 507 */ 508 509 /** 510 @defgroup approx Approximation Algorithms 511 @ingroup algs 512 \brief Approximation algorithms. 513 514 This group contains the approximation and heuristic algorithms 515 implemented in LEMON. 464 516 */ 465 517 … … 471 523 This group contains some algorithms implemented in LEMON 472 524 in order to make it easier to implement complex algorithms. 473 */474 475 /**476 @defgroup approx Approximation Algorithms477 @ingroup algs478 \brief Approximation algorithms.479 480 This group contains the approximation and heuristic algorithms481 implemented in LEMON.482 525 */ 483 526 … … 588 631 589 632 /** 590 @defgroup dimacs_group DIMACS format633 @defgroup dimacs_group DIMACS Format 591 634 @ingroup io_group 592 635 \brief Read and write files in DIMACS format … … 650 693 651 694 /** 695 @defgroup tools Standalone Utility Applications 696 697 Some utility applications are listed here. 698 699 The standard compilation procedure (<tt>./configure;make</tt>) will compile 700 them, as well. 701 */ 702 703 /** 652 704 \anchor demoprograms 653 705 … … 661 713 */ 662 714 663 /**664 @defgroup tools Standalone Utility Applications665 666 Some utility applications are listed here.667 668 The standard compilation procedure (<tt>./configure;make</tt>) will compile669 them, as well.670 */671 672 715 }
Note: See TracChangeset
for help on using the changeset viewer.