[graph] fixes to louvain refreshing too much
Also, fixed graph comparison function. This should be both fast and more exact now (previously it only compared node/edge list sizes, now it compares their appropriate hashes).
Also, fixed graph comparison function. This should be both fast and more exact now (previously it only compared node/edge list sizes, now it compares their appropriate hashes).