~brendanrbrown/random-cycle#2: 
algebraic-graphs implementations

algebraic-graphs has lots of neat functionality for manipulating graph objects. It would be great to support that with random cycle selection for the basic Graph a type.

As shown in the tests, algebraic-graphs makes it very easy to construct a cycle partition graph from a set of edges, so it would take just a few lines to draw a random cycle graph partition then transform it to a Graph Int. But I would be interested to see whether there is an efficient implementation using just the algebraic-graphs API.

Status
REPORTED
Submitter
~brendanrbrown
Assigned to
No-one
Submitted
1 year, 6 months ago
Updated
1 year, 6 months ago
Labels
No labels applied.