~brendanrbrown

https://brendanbrown.digital

Trackers

~brendanrbrown/random-cycle

Last active 1 year, 6 months ago

#1 Implement Sattolo's algorithm 1 year, 6 months ago

Comment by ~brendanrbrown on ~brendanrbrown/random-cycle

brendanrbrown referenced this ticket in commit ca895ac.

#1 Implement Sattolo's algorithm 1 year, 6 months ago

Comment by ~brendanrbrown on ~brendanrbrown/random-cycle

brendanrbrown referenced this ticket in commit 41548de.

REPORTED RESOLVED IMPLEMENTED

#2 algebraic-graphs implementations 1 year, 6 months ago

Ticket created by ~brendanrbrown on ~brendanrbrown/random-cycle

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.