def generateDHMvs(times, n, s):
vs = []
for i in range(times):
g = DHM(n)
vs += getMs(g, s)
sys.stdout.write("\rGenerating graphs: {}/{} finished".format(i + 1, times))
assert len(vs) == times * n
return vs
def generatePCvs(times, n, beta, s):
i = 0
vs = []
while i < times:
g = PC(n, beta)
if isConnected(g):
vs += getMs(g, s)
sys.stdout.write("\rGenerating graphs: {}/{} finished".format(i + 1, times))
i += 1
assert len(vs) == times * n
return vs