This concerns two changes:
1) The two list commands in NautyGraphFromEdges are combined into one
loop. Therefore the list "edges" is only traversed once. Furthermore the
function call i->i[1] is replaced in both cases, which gives another
factor of 2.
2) The combination SortedList(DuplicateFreeList()) is replaced by Set(),
which gives a huge speedup, as shown in this example:
This concerns two changes: 1) The two list commands in NautyGraphFromEdges are combined into one loop. Therefore the list "edges" is only traversed once. Furthermore the function call i->i[1] is replaced in both cases, which gives another factor of 2. 2) The combination SortedList(DuplicateFreeList()) is replaced by Set(), which gives a huge speedup, as shown in this example: