[Haskell-cafe] Functional GUI combinators for arbitrary graphs of components?

[Brian Hulley]

Taral wrote:
> On 12/1/06, Brian Hulley <brianh at metamilk.com> wrote:
>> This problem is so general (ie converting a cyclic graph into an
>> expression tree such that each node appears no more than once) that
>> I'm sure someone somewhere must already have determined whether or
>> not there can be a solution, though I don't know where to look or
>> what to search for.
>
> I suggest you check the Functional Graph Library (FGL). It's shipped
> as part of GHC.

Thanks for the suggestion. FGL itself (afaics) doesn't seem to have what I 
was looking for but "graph algorithm" would be a good place to start 
looking.

Brian.
-- 
http://www.metamilk.com