Index: ChangeLog from Simon Odou <simon@lrde.epita.fr> * oln/appli/astro/tree_coherence_check.hh: Remove a badly used doxygen command. * oln/appli/astro/tree_statistics.hh: Likewise. tree_coherence_check.hh | 12 ------------ tree_statistics.hh | 8 -------- 2 files changed, 20 deletions(-) Index: oln/appli/astro/tree_coherence_check.hh --- oln/appli/astro/tree_coherence_check.hh (revision 265) +++ oln/appli/astro/tree_coherence_check.hh (working copy) @@ -58,11 +58,9 @@ ** ** \warning Maxtree should have already been computed. ** - ** \code ** Algorithm used : ** The count of points that are parent of themselves ** should be exactly one. - ** \endcode ** ** \return true if tree is ok. ** @@ -96,13 +94,11 @@ ** ** \warning Maxtree should have already been computed. ** - ** \code ** Algorithm used : ** ** for all points (p) from input ** check if children's parent is (p) ** - ** \endcode ** ** \return true if relationships are ok. ** @@ -138,7 +134,6 @@ ** ** \warning Maxtree should have already been computed. ** - ** \code ** Algorithm used : ** ** For all points (p) of input @@ -148,7 +143,6 @@ ** else ** // nothing, root parent of itself ** - ** \endcode ** ** \return true if relationships are ok. ** @@ -194,14 +188,12 @@ ** ** \warning Maxtree should have already been computed. ** - ** \code ** Algorithm used : ** ** For all points (p) of input ** for all children (c) of (p) ** ensure (c) is not (p) ** - ** \endcode ** ** \return true if there is no recursion. ** @@ -243,7 +235,6 @@ ** ** \warning Maxtree should have already been computed. ** - ** \code ** Algorithm used : ** ** For all points (p) in decreasing order @@ -252,7 +243,6 @@ ** ensure they were seen before ** mark (p) as seen ** - ** \endcode ** ** \return true if tree is good. ** @@ -299,14 +289,12 @@ ** ** \warning Maxtree should have already been computed. ** - ** \code ** Algorithm used : ** ** Tree is traversed using breadth-first traversal with a queue. ** Every point is marked, at the end all the points must ** have been marked. ** - ** \endcode ** ** \return True if all points were marked. ** Index: oln/appli/astro/tree_statistics.hh --- oln/appli/astro/tree_statistics.hh (revision 265) +++ oln/appli/astro/tree_statistics.hh (working copy) @@ -56,13 +56,11 @@ ** ** \warning Maxtree should have already been computed. ** - ** \code ** Algorithm used : ** ** Tree is traversed using breadth-first traversal with a queue. ** Increments count on leaf (no children). ** - ** \endcode ** ** \return Number of leafs (terminal nodes). ** @@ -100,12 +98,10 @@ ** ** \warning Maxtree should have already been computed. ** - ** \code ** Algorithm used : ** ** Number of points - leafs count ** - ** \endcode ** ** \return Number of internal nodes. ** @@ -127,7 +123,6 @@ ** ** \warning Maxtree should have already been computed. ** - ** \code ** Algorithm used : ** ** count <- 0 @@ -137,7 +132,6 @@ ** then increment count (p is a local root) ** at the end, return the count ** - ** \endcode ** ** \return Number of local roots. ** @@ -167,14 +161,12 @@ ** ** \warning Maxtree should have already been computed. ** - ** \code ** Algorithm used : ** ** Tree is traversed using breadth-first traversal with a queue. ** Counts the children and nodes, The average is ** children_count / node_count. ** - ** \endcode ** ** \return Children per node average. **