Changeset 6141 for trunk/CONSENSUS_TREE/CT_ntree.cxx

Timestamp:

14/08/09 16:29:27 (3 years ago)

Author:

westram

Message:

• spellchecked all (phew)

Files:

• trunk/CONSENSUS_TREE/CT_ntree.cxx (modified) (4 diffs)

trunk/CONSENSUS_TREE/CT_ntree.cxx

@@ -67 +67 @@
 
 
-/* build a new node and store the parttion p in it */
+/* build a new node and store the partition p in it */
 NT_NODE *new_ntnode(PART *p)
 {
@@ -101 +101 @@
 
 
-/* Initialisation of the tree */
+/* Initialization of the tree */
 void ntree_init(void)
 {
     PART *r;
 
-    /* Destruct old Tree */
+    /* Destruct old tree */
     del_tree(ntree);
-    /* Set Root = max. Patition */
+    /* Set root = max. partition */
     ntree = NULL;
     r=part_root();
@@ -147 +147 @@
 
 
-/* Construct a multitree under that constrain that it is posssible for the tree
-   be a binaerytree in the end. To enable this it is important to follow two
+/* Construct a multitree under that constrain that it is possible for the tree
+   be a binary tree in the end. To enable this it is important to follow two
    ideas:
    1. a son fits only under a father if the father has every bit set that the son
    has plus it should be possible to insert as many sons as necessary to result
-   in a binaerytree
+   in a binary tree
    2. for any two brothers A,B: brotherA and brotherB == 0                       */
 int ins_ntree(NT_NODE *tree, PART *newpart)
@@ -214 +214 @@
    possible representations. ins_ntree do the hole work. If it fit in none
    of them I delete the partition.
-   attention: The parttion is detruced afterwards.
-   The tree is never empty, because it is initalised with a root */
+   attention: The partition is destructed afterwards.
+   The tree is never empty, because it is initialized with a root */
 void insert_ntree(PART *part)
 {