Factorization algorithm computes incorrect result for some large complex graphs.

[brianguenter]

For some complicated graphs factorization of a subgraph A will create a new factorable subgraph B contained in A. The current code handles many of these cases but fails on some graphs. The factorization algorithm needs to be redesigned to recompute factorable subgraphs when newly created subgraphs arise.