Exemple #1
0
        static void Main(string[] args)
        {
            string[] content = File.ReadAllLines(@"words.txt");

            Anagramme a = new Anagramme();
            TreeNode t = new TreeNode(a);

            foreach(string word in content)
            {
                char[] sorted = word.ToCharArray();
                Array.Sort(sorted);

                addChildren(word, sorted, t);
            }

            int i = 0;
            Action<Anagramme> print =
                (Anagramme anag) =>
                {
                    if (anag.refNb > 1)
                    {
                        Console.WriteLine(String.Join(", ", anag.words));
                        i++;
                    }
                };

            t.Traverse(print);
            Console.WriteLine("{0} anagrammes trouvés", i);
            Console.ReadLine();
        }
Exemple #2
0
        static void addChildren(string word, char[] sorted, TreeNode parentNode)
        {
            if(sorted.Length ==0)
            {
                return;
            }

            TreeNode node = parentNode[sorted[0]];
            if (sorted.Length == 1)
            {

                if (node == null)
                {
                    Anagramme a = new Anagramme();
                    a.letter = sorted[0];
                    a.addWord(word);

                    parentNode.AddChild(a);
                }
                else
                {
                    node.Value.addWord(word);
                }
            }
            else
            {
                if (node == null)
                {
                    Anagramme a = new Anagramme();
                    a.letter = sorted[0];
                    node = parentNode.AddChild(a);
                }
                addChildren(word, SubArray(sorted, 1, sorted.Length - 1), node);
            }
        }
Exemple #3
0
 public TreeNode AddChild(Anagramme value)
 {
     var node = new TreeNode(value) { Parent = this };
     _children.Add(value.letter, node);
     return node;
 }