Also, yeah. When it came to writing the code for this, the hardest part was coding in the adjacency matrix for the graph. Otherwise, it was so easy that the code actually compiled worked right the first time! How often does that happen?! If I wanted to improve the duplicate avoidance, it'd probably be pretty tricky, but why bother? The code did what I needed it to!