Changeset 761:98a30824fe36 in lemon
 Timestamp:
 07/24/09 11:07:52 (14 years ago)
 Branch:
 default
 Phase:
 public
 Files:

 2 edited
Legend:
 Unmodified
 Added
 Removed

doc/groups.dox
r760 r761 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 … … 257 249 This group contains some data structures implemented in LEMON in 258 250 order to make it easier to implement combinatorial algorithms. 251 */ 252 253 /** 254 @defgroup geomdat Geometric Data Structures 255 @ingroup auxdat 256 \brief Geometric data structures implemented in LEMON. 257 258 This group contains geometric data structures implemented in LEMON. 259 260  \ref lemon::dim2::Point "dim2::Point" implements a two dimensional 261 vector with the usual operations. 262  \ref lemon::dim2::Box "dim2::Box" can be used to determine the 263 rectangular bounding box of a set of \ref lemon::dim2::Point 264 "dim2::Point"'s. 265 */ 266 267 /** 268 @defgroup matrices Matrices 269 @ingroup auxdat 270 \brief Two dimensional data storages implemented in LEMON. 271 272 This group contains two dimensional data storages implemented in LEMON. 259 273 */ 260 274 … … 299 313 300 314 /** 315 @defgroup spantree Minimum Spanning Tree Algorithms 316 @ingroup algs 317 \brief Algorithms for finding minimum cost spanning trees and arborescences. 318 319 This group contains the algorithms for finding minimum cost spanning 320 trees and arborescences. 321 */ 322 323 /** 301 324 @defgroup max_flow Maximum Flow Algorithms 302 325 @ingroup algs … … 389 412 If you want to find minimum cut just between two distinict nodes, 390 413 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 connected_components.png402 \image latex connected_components.eps "Connected 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 414 */ 416 415 … … 456 455 457 456 /** 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. 457 @defgroup graph_properties Connectivity and Other Graph Properties 458 @ingroup algs 459 \brief Algorithms for discovering the graph properties 460 461 This group contains the algorithms for discovering the graph properties 462 like connectivity, bipartiteness, euler property, simplicity etc. 463 464 \image html connected_components.png 465 \image latex connected_components.eps "Connected components" width=\textwidth 466 */ 467 468 /** 469 @defgroup planar Planarity Embedding and Drawing 470 @ingroup algs 471 \brief Algorithms for planarity checking, embedding and drawing 472 473 This group contains the algorithms for planarity checking, 474 embedding and drawing. 475 476 \image html planar.png 477 \image latex planar.eps "Plane graph" width=\textwidth 478 */ 479 480 /** 481 @defgroup approx Approximation Algorithms 482 @ingroup algs 483 \brief Approximation algorithms. 484 485 This group contains the approximation and heuristic algorithms 486 implemented in LEMON. 464 487 */ 465 488 … … 471 494 This group contains some algorithms implemented in LEMON 472 495 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 496 */ 483 497 … … 588 602 589 603 /** 590 @defgroup dimacs_group DIMACS format604 @defgroup dimacs_group DIMACS Format 591 605 @ingroup io_group 592 606 \brief Read and write files in DIMACS format … … 650 664 651 665 /** 666 @defgroup tools Standalone Utility Applications 667 668 Some utility applications are listed here. 669 670 The standard compilation procedure (<tt>./configure;make</tt>) will compile 671 them, as well. 672 */ 673 674 /** 652 675 \anchor demoprograms 653 676 … … 661 684 */ 662 685 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 686 } 
lemon/dim2.h
r463 r761 22 22 #include <iostream> 23 23 24 ///\ingroup misc24 ///\ingroup geomdat 25 25 ///\file 26 26 ///\brief A simple two dimensional vector and a bounding box implementation 27 ///28 /// The class \ref lemon::dim2::Point "dim2::Point" implements29 /// a two dimensional vector with the usual operations.30 ///31 /// The class \ref lemon::dim2::Box "dim2::Box" can be used to determine32 /// the rectangular bounding box of a set of33 /// \ref lemon::dim2::Point "dim2::Point"'s.34 27 35 28 namespace lemon { … … 41 34 namespace dim2 { 42 35 43 /// \addtogroup misc36 /// \addtogroup geomdat 44 37 /// @{ 45 38
Note: See TracChangeset
for help on using the changeset viewer.