[<<][haskell][>>][..]
Sun Aug 19 11:13:25 EDT 2018

Data.Graph

The answer to the question "How to work with directed graphs in
Haskell.  Don't graphs need mutation or awkward infinite data
structions?"  is to use the adjacency list representation from
Data.Graph.



[Reply][About]
[<<][haskell][>>][..]