r761:98a30824fe36
Fri, 24 Jul 2009 11:07:52
[Not Reviewed]
0 comments (0 inline)
0
2
0
69
55
2
9
| ... | ... |
@@ -225,16 +225,8 @@ |
| 225 | 225 |
\c Dijkstra algorithm. |
| 226 | 226 |
*/ |
| 227 | 227 |
|
| 228 | 228 |
/** |
| 229 |
@defgroup matrices Matrices |
|
| 230 |
@ingroup datas |
|
| 231 |
\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 |
| 239 | 231 |
\brief %Path structures implemented in LEMON. |
| 240 | 232 |
|
| ... | ... |
@@ -258,8 +250,30 @@ |
| 258 | 250 |
order to make it easier to implement combinatorial algorithms. |
| 259 | 251 |
*/ |
| 260 | 252 |
|
| 261 | 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. |
|
| 273 |
*/ |
|
| 274 |
|
|
| 275 |
/** |
|
| 262 | 276 |
@defgroup algs Algorithms |
| 263 | 277 |
\brief This group contains the several algorithms |
| 264 | 278 |
implemented in LEMON. |
| 265 | 279 |
|
| ... | ... |
@@ -297,8 +311,17 @@ |
| 297 | 311 |
arc-disjoint paths between two nodes having minimum total length. |
| 298 | 312 |
*/ |
| 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 |
| 303 | 326 |
\brief Algorithms for finding maximum flows. |
| 304 | 327 |
|
| ... | ... |
@@ -390,32 +413,8 @@ |
| 390 | 413 |
see the \ref max_flow "maximum flow problem". |
| 391 | 414 |
*/ |
| 392 | 415 |
|
| 393 | 416 |
/** |
| 394 |
@defgroup graph_properties Connectivity and Other Graph Properties |
|
| 395 |
@ingroup algs |
|
| 396 |
\brief Algorithms for discovering the graph properties |
|
| 397 |
|
|
| 398 |
This group contains the algorithms for discovering the graph properties |
|
| 399 |
like connectivity, bipartiteness, euler property, simplicity etc. |
|
| 400 |
|
|
| 401 |
\image html connected_components.png |
|
| 402 |
\image latex connected_components.eps "Connected components" width=\textwidth |
|
| 403 |
*/ |
|
| 404 |
|
|
| 405 |
/** |
|
| 406 |
@defgroup planar Planarity Embedding and Drawing |
|
| 407 |
@ingroup algs |
|
| 408 |
\brief Algorithms for planarity checking, embedding and drawing |
|
| 409 |
|
|
| 410 |
This group contains the algorithms for planarity checking, |
|
| 411 |
embedding and drawing. |
|
| 412 |
|
|
| 413 |
\image html planar.png |
|
| 414 |
\image latex planar.eps "Plane graph" width=\textwidth |
|
| 415 |
*/ |
|
| 416 |
|
|
| 417 |
/** |
|
| 418 | 417 |
@defgroup matching Matching Algorithms |
| 419 | 418 |
@ingroup algs |
| 420 | 419 |
\brief Algorithms for finding matchings in graphs and bipartite graphs. |
| 421 | 420 |
|
| ... | ... |
@@ -454,14 +453,38 @@ |
| 454 | 453 |
\image latex bipartite_matching.eps "Bipartite Matching" width=\textwidth |
| 455 | 454 |
*/ |
| 456 | 455 |
|
| 457 | 456 |
/** |
| 458 |
@defgroup |
|
| 457 |
@defgroup graph_properties Connectivity and Other Graph Properties |
|
| 459 | 458 |
@ingroup algs |
| 460 |
\brief Algorithms for |
|
| 459 |
\brief Algorithms for discovering the graph properties |
|
| 461 | 460 |
|
| 462 |
This group contains the algorithms for finding minimum cost spanning |
|
| 463 |
trees and arborescences. |
|
| 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 |
|
| 466 | 489 |
/** |
| 467 | 490 |
@defgroup auxalg Auxiliary Algorithms |
| ... | ... |
@@ -472,17 +495,8 @@ |
| 472 | 495 |
in order to make it easier to implement complex algorithms. |
| 473 | 496 |
*/ |
| 474 | 497 |
|
| 475 | 498 |
/** |
| 476 |
@defgroup approx Approximation Algorithms |
|
| 477 |
@ingroup algs |
|
| 478 |
\brief Approximation algorithms. |
|
| 479 |
|
|
| 480 |
This group contains the approximation and heuristic algorithms |
|
| 481 |
implemented in LEMON. |
|
| 482 |
*/ |
|
| 483 |
|
|
| 484 |
/** |
|
| 485 | 499 |
@defgroup gen_opt_group General Optimization Tools |
| 486 | 500 |
\brief This group contains some general optimization frameworks |
| 487 | 501 |
implemented in LEMON. |
| 488 | 502 |
|
| ... | ... |
@@ -586,9 +600,9 @@ |
| 586 | 600 |
graph exporting tools. |
| 587 | 601 |
*/ |
| 588 | 602 |
|
| 589 | 603 |
/** |
| 590 |
@defgroup dimacs_group DIMACS |
|
| 604 |
@defgroup dimacs_group DIMACS Format |
|
| 591 | 605 |
@ingroup io_group |
| 592 | 606 |
\brief Read and write files in DIMACS format |
| 593 | 607 |
|
| 594 | 608 |
Tools to read a digraph from or write it to a file in DIMACS format data. |
| ... | ... |
@@ -648,8 +662,17 @@ |
| 648 | 662 |
This group contains the skeletons and concept checking classes of maps. |
| 649 | 663 |
*/ |
| 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 |
|
| 654 | 677 |
@defgroup demos Demo Programs |
| 655 | 678 |
|
| ... | ... |
@@ -659,14 +682,5 @@ |
| 659 | 682 |
In order to compile them, use the <tt>make demo</tt> or the |
| 660 | 683 |
<tt>make check</tt> commands. |
| 661 | 684 |
*/ |
| 662 | 685 |
|
| 663 |
/** |
|
| 664 |
@defgroup tools Standalone Utility Applications |
|
| 665 |
|
|
| 666 |
Some utility applications are listed here. |
|
| 667 |
|
|
| 668 |
The standard compilation procedure (<tt>./configure;make</tt>) will compile |
|
| 669 |
them, as well. |
|
| 670 |
*/ |
|
| 671 |
|
|
| 672 | 686 |
} |
| ... | ... |
@@ -20,18 +20,11 @@ |
| 20 | 20 |
#define LEMON_DIM2_H |
| 21 | 21 |
|
| 22 | 22 |
#include <iostream> |
| 23 | 23 |
|
| 24 |
///\ingroup |
|
| 24 |
///\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" implements |
|
| 29 |
/// a two dimensional vector with the usual operations. |
|
| 30 |
/// |
|
| 31 |
/// The class \ref lemon::dim2::Box "dim2::Box" can be used to determine |
|
| 32 |
/// the rectangular bounding box of a set of |
|
| 33 |
/// \ref lemon::dim2::Point "dim2::Point"'s. |
|
| 34 | 27 |
|
| 35 | 28 |
namespace lemon {
|
| 36 | 29 |
|
| 37 | 30 |
///Tools for handling two dimensional coordinates |
| ... | ... |
@@ -39,9 +32,9 @@ |
| 39 | 32 |
///This namespace is a storage of several |
| 40 | 33 |
///tools for handling two dimensional coordinates |
| 41 | 34 |
namespace dim2 {
|
| 42 | 35 |
|
| 43 |
/// \addtogroup |
|
| 36 |
/// \addtogroup geomdat |
|
| 44 | 37 |
/// @{
|
| 45 | 38 |
|
| 46 | 39 |
/// Two dimensional vector (plain vector) |
| 47 | 40 |
|
0 comments (0 inline)