Graph.Random provides graph functions that require randomness to work. Note that this module uses Random.Pcg rather than the standard library Random.
Generate a random topological sorting of a directed acyclic graph. Crashes if the graph contains cycles.
Elm-test fuzzer that generates random topological sortings of a directed acyclic graph. Crashes if the graph contains cycles.