This should take a collection of digraphs and return a subset of it, consisting of just digraphs that are unique up to isomorphism.
A rudimentary way of doing this is iteratively adding digraphs to a new list, checking IsIsomorphicDigraph with all existing list entries before every addition (slow!) but there must be ways to improve this. For example:
- Checking known properties/attributes that would rule out isomorphisms
- Computing quick unknown properties/attributes that would rule out isomorphisms
- Computing canonical representations and hashing
This should take a collection of digraphs and return a subset of it, consisting of just digraphs that are unique up to isomorphism.
A rudimentary way of doing this is iteratively adding digraphs to a new list, checking
IsIsomorphicDigraphwith all existing list entries before every addition (slow!) but there must be ways to improve this. For example: