Hi, On Jan 19, 2008 6:05 PM, Thomas Hartman <[EMAIL PROTECTED]> 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 _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
