## Flash Applets

### James Hamblin's Site

Collection of applets and links to his new textbook for the MLS course.

## Unit 2: Mathematics of Voting

• See Hamblin's page for all

## Unit 3: Mathematics of Information

• Bifid Illustration... animated encryption/decryption using the Bifid cipher
• Bifid Tool... non-animated utility for quick encryption/decryption using the Bifid cipher
• Cryptography exercises ... produces a random problem using one of the ciphers mentioned above. Refresh the browser window to get a new problem to try
• Frequency analysis ... counts frequency of each letter used in a user-input string
• Frequency analysis, II ... extension of the previous applet to allow frequency counts for every kth letter, for use in cryptanalysis of Vigenere ciphers.

## Ensley's MLS Working Files

The following applets are test cases for the custom Graph and Node classes. Documentation for these classes is here. A zipped folder with all class files (as of January 2010) is here.

• Euler Circuit... find an Euler circuit in a graph. The attempt is recorded as the sequence of nodes visited. The ability to "take back" a move has not yet been implemented.
• Eulerize... Toggle edges & multiedges to try to make the valence of every node even.
• Eulerize II ... This time, the code can tell you the minimum number of changes needed to Eulerize the graph.
• Minimal Weight Paths... Find the "all pairs shortest paths" for a weighted graph.
• Shortest Paths & Diameter... Find the "all pairs shortest paths" for a simple graph & find the diameter of the graph.
• Minimal Spanning Tree Exercises ... Click until you have a spanning tree & see how small you can make the total weight. This set of five exercises is meant to check your understanding.