1 | initial version |

Not that you are not iterating over all graphs on `\{0,...,9\}`

, but on all *isomorphism classes of graphs*, which is a much harder task. I do not check the internals of the algorithm, but one can imagine that at some points, it has to backtrack or search a lot before finding a new graph, that was not found before.

Note that there is a faster alternative using nauty library, you can replace `graphs(10)`

with `graphs.nauty_geng(10)`

.

2 | No.2 Revision |

Not that you are not iterating over all graphs on {0,...,9}, but on all `\{0,...,9\}`

, *isomorphism classes of graphs*, which is a much harder task. I do not check the internals of the algorithm, but one can imagine that at some points, it has to backtrack or search a lot before finding a new graph, that was not found before.

Note that there is a faster alternative using nauty library, you can replace `graphs(10)`

with `graphs.nauty_geng(10)`

.

3 | No.3 Revision |

Not that you are not iterating over all graphs on {0,...,9}, but on all *isomorphism classes of graphs*, which is a much harder task. I ~~do ~~did not check the internals of the algorithm, but one can easily imagine that at some points, it has to backtrack ~~or search ~~(or search) a lot before finding a new graph, that was not found before.

Note that there is a faster alternative using nauty library, you can replace `graphs(10)`

with `graphs.nauty_geng(10)`

.

4 | No.4 Revision |

~~Not ~~Note that you are not iterating over all graphs on {0,...,9}, but on all *isomorphism classes of graphs*, which is a much harder task. I did not check the internals of the algorithm, but one can easily imagine that at some points, it has to backtrack (or search) a lot before finding a new graph, that was not found before.

`graphs(10)`

with `graphs.nauty_geng(10)`

.

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.