2-Break Distance Problem (minor updates)

A few small updates.  Added an intermediate new_nodes set to the graph
traversal to make it slightly more efficient.  Added more comments.
Greedy Motif Search (updated)

Slightly refactored code to make it simpler.  Functionality is still
exactly the same, with a possibly slight performance improvement.
Greedy Motif Search with Pseudocounts (updated)

Slightly refactored code to make it simpler.  Functionality is still
exactly the same, with a possibly slight performance improvement.
Connected Components

Solution to Rosalind Algorithmic Heights Problem 010: Connected
Components