Try using Data.Graph module for topological sorting

kawu / dawg

Directed acyclic word graphs

BSD 2-Clause "Simplified" License

11 stars 1 forks source link

Try using Data.Graph module for topological sorting #13

Open kawu opened 11 years ago

kawu commented 11 years ago

Topological sorting is needed when translating an immutable automaton to a mutable one. When the graph is sorted topologically, it is easy to compute numbers of ingoing paths for each node in the graph.