Proposal for Data.Graph : Improve graph creation complexity when nodes have "consecutive" keys

[Ivan Lazar Miljenovic]

On 3 April 2018 at 09:24, Olivier S. <olivier.sohn at gmail.com> wrote:
> So it seems using Data.IntMap would be a good compromise?

IntMap only works if `node ~ Int`; otherwise we lose generality.

My preferences are:

* A typeclass (unfortunately Foldable for a Map is only on the values,
not on the Key; unless you provide a wrapper?)
* Lists (despite the issues you've pointed out, people can always
convert Maps, IntMaps, etc. to lists to convert those values to a
Graph)
* Map

-- 
Ivan Lazar Miljenovic
Ivan.Miljenovic at gmail.com
http://IvanMiljenovic.wordpress.com