Implement `QuotientsDigraph`

[james-d-mitchell]

As the title says, it'd be good to have a function that computed all the quotients of a given digraph. I'm not sure how feasible this is really, but it'd be great to have something that worked for small examples.

[mpan322]

Meeting Disucssion:

• Want to get a list where every quotient digraph in it is unique.
• Number possible partitions is the bell number of number of verticies i.e. super inefficient to check them all.
• Potentially backtracking search using the stabalizer of the set. (out of my knowledge - somone who knows please add clarification for this)

[mtorpey]

@mpan322, are you still interested in this? Just trying to make sure the project board is up to date.

[mtorpey]

Moved back to Unassigned for now, but let me know if that's wrong!

[mtorpey]

What does it mean for a quotient to be unique? Do we want this up to isomorphism or up to =?

If up to isomorphism, then I guess we could use Bliss/NautyCanonicalLabelling and the graph's automorphism group to get started. Is that true?