[Haskell-cafe] functional graphs

Benja Fallenstein benja.fallenstein at gmail.com
Sat Jan 19 13:15:52 EST 2008


On Jan 19, 2008 6:05 PM, Thomas Hartman <tphyahoo at gmail.com> wrote:
> Do you just assume that every two nodes have an edge between them [...]?

Since that's what "complete graph" means, I assume so =-)

- Benja

More information about the Haskell-Cafe mailing list