gravatar
kpeter (Peter Kovacs)
kpeter@inf.elte.hu
Rearrange modules (#303)
0 2 0
default
2 files changed with 71 insertions and 64 deletions:
↑ Collapse diff ↑
Ignore white space 6 line context
... ...
@@ -228,10 +228,2 @@
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
... ...
@@ -261,2 +253,24 @@
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
... ...
@@ -300,2 +314,11 @@
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
... ...
@@ -393,26 +416,2 @@
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
... ...
@@ -457,8 +456,32 @@
457 456
/**
458
@defgroup spantree Minimum Spanning Tree Algorithms
457
@defgroup graph_properties Connectivity and Other Graph Properties
459 458
@ingroup algs
460
\brief Algorithms for finding minimum cost spanning trees and arborescences.
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
*/
... ...
@@ -475,11 +498,2 @@
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
... ...
@@ -589,3 +603,3 @@
589 603
/**
590
@defgroup dimacs_group DIMACS format
604
@defgroup dimacs_group DIMACS Format
591 605
@ingroup io_group
... ...
@@ -651,2 +665,11 @@
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
... ...
@@ -662,11 +685,2 @@
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
}
Show white space 6 line context
... ...
@@ -23,12 +23,5 @@
23 23

	
24
///\ingroup misc
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

	
... ...
@@ -42,3 +35,3 @@
42 35

	
43
  /// \addtogroup misc
36
  /// \addtogroup geomdat
44 37
  /// @{
0 comments (0 inline)