Graph.Random provides graph functions that require randomness to work.
topologicalSortFuzzer : Graph comparable data edgeData -> Fuzzer (List comparable)
Elm-test fuzzer that generates random topological sortings of a directed acyclic graph. Hangs if the graph contains cycles.
randomTopologicalSort : Graph comparable data edgeData -> Random.Generator (List comparable)
Generate a random topological sorting of a directed acyclic graph. Hangs if the graph contains cycles.