A byproduct of relatively small working sets, its clear that some algorithms/scripts possess poor time complexity. These naive loops are easy to fix as discovered.
For a set with 250e3 clusters, a doubly-nested loop covering the set results in 63e9 iterations. This was discovered in truthtable.py. Another, not quite as bad example existed in louvain_cluster.py.
A byproduct of relatively small working sets, its clear that some algorithms/scripts possess poor time complexity. These naive loops are easy to fix as discovered.
For a set with 250e3 clusters, a doubly-nested loop covering the set results in 63e9 iterations. This was discovered in truthtable.py. Another, not quite as bad example existed in louvain_cluster.py.
So far these have been easy to resolve.