The challenge is fairly simple: given a file containing one word per line, print out all the combinations of words that are anagrams; each line in the output contains all the words from the input that are anagrams of each other. For example, your program might include in its output:
enlist inlets listen silent
boaster boaters borates
Use the word List for comparing results.