subanagram_test

subanagram_test, a Fortran90 code which calls subanagram(), which creates a list of subanagrams of a master word; the user can require that the subanagrams be at least a given number of letters in length.

Licensing:

The information on this web page is distributed under the MIT license.

Related Data and Programs:

subanagram, a Fortran90 code which finds words which are anagrams formed from some of the letters of a given master word.

Source Code:

• subanagram_test.sh, runs all the tests.
• subanagram_test.txt, the output file.

• wordlist.txt, the dictionary file used by the program.

• amsterdam.txt, subanagrams of "Amsterdam" of length at least 4.
• baltimore.txt, subanagrams of "Baltimore" of length at least 4.
• bangalore.txt, subanagrams of "Bangalore" of length at least 4.
• barcelona.txt, subanagrams of "Barcelona" of length at least 4.
• blueplaty.txt, subanagrams of "Blue Platy" of length at least 4.
• bucharest.txt, subanagrams of "Bucharest" of length at least 4.
• cambridge.txt, subanagrams of "Cambridge" of length at least 4.
• charlotte.txt, subanagrams of "Charlotte" of length at least 4.
• cleveland.txt, subanagrams of "Cleveland" of length at least 4.
• kingstown.txt, subanagrams of "Kingstown" of length at least 4.
• sprite.txt, subanagrams of "sprite" of length at least 5.
• whitecarp.txt, subanagrams of "white carp" of length at least 4.