# Revision history [back]

First, there are time limits on calculations on sagenb.org which you may be running into. Have you tried running it on a computer that you can run long-running calculations on?

Second, I simplified your code quite a bit. I use the actual automorphism group as an item in the tuple, since apparently the calls to gap may be part of the problem, from the discussion above:

import collections
lglist=collections.Counter()

lglist.clear()
for k in range(4,15):
for g in graphs.nauty_geng(str(k) + "-C -d3 -D3"):
if g.vertex_connectivity()>=3:
lglist[(k, g.vertex_connectivity(), g.automorphism_group())]+=1

for item in lglist.items():
print item


First, there are time limits on calculations on sagenb.org which you may be running into. Have you tried running it on a computer that you can run long-running calculations on?

Second, I simplified your code quite a bit. I use the actual automorphism group as an item in the tuple, since apparently the calls to gap may be part of the problem, from the discussion above:

import collections
lglist=collections.Counter()

lglist.clear()
for k in range(4,15):
for g in graphs.nauty_geng(str(k) + "-C -d3 -D3"):
if g.vertex_connectivity()>=3:
lglist[(k, g.vertex_connectivity(), g.automorphism_group())]+=1

for item in lglist.items():
print item
html.table(lglist.items())


First, there are time limits on calculations on sagenb.org which you may be running into. Have you tried running it on a computer that you can run long-running calculations on?

Second, I simplified your code quite a bit. I use the actual automorphism group as an item in the tuple, since apparently the calls to gap may be part of the problem, from the discussion above:

import collections
lglist=collections.Counter()

lglist.clear()
for k in range(4,15):
for g in graphs.nauty_geng(str(k) + "-C -d3 -D3"):
if g.vertex_connectivity()>=3:
lglist[(k, g.vertex_connectivity(), g.automorphism_group())]+=1

html.table(lglist.items())
for k,v in lglist.items():
print v,k