GL, settings = loadgraph("graphs\\tree150.grl", FastGraph, True)
timeList = dict()
x = 0
y = 0
for j in range(len(GL)):
x += len(GL[j].E())
y += 1
print(x / y)
for j in range(len(GL)):
if j != 0:
timeEntry = []
G = GL[x]
H = GL[j]
key = str(x) + " and " + str(j)
start = time()
union = disjoint_union(G, H)
timeEntry.append(time() - start)
start = time()
timeEntry.append(is_isomorphism(union))
timeEntry.append(time() - start)
timeList[key] = timeEntry
printTimeList(timeList)
timeList = dict()
for i in range(len(GL)):
for j in range(len(GL)):
if i == j:
timeEntry = []
G = GL[i]
H = GL[j]
key = str(i) + " and " + str(j)
start = time()
def count_automorphism(g):
h = disjoint_union(g, g)
return count_isomorphism(h)