undefined | Better HN

0 pointscopper15y ago0 comments

Wouldn't the Data.Graph.Inductive representation of a graph satisfy this (It might not be O(1), but it's pretty close)? I must admit that I find it hard to see what a zipper for a graph should look like, though.

0 comments

3 comments · 1 top-level

eru15y ago· 2 in thread

I know how to get a zipper for a static graph by Tying the Knot (http://haskell.org/haskellwiki/Tying_the_Knot). But writing one where you can add and remove nodes and edges seems much harder.

You already know how a zipper for a tree looks like. And you have probably seen a functional queue. Generalizing from both of those, you can imagine how a zipper would work.

I can write down the types and all, even if I don't know of any implementation. But that's probably a topic for a blog post, or so.

copperOP15y ago

I think I understand that, but without actually writing it out, it's going to be impossible to test.

The types I was talking about go as: type Context a b = (Adj b, Node, a, Adj b) type Adj b = [(b, Node)]

It definitely allows traversal, and adding nodes seems to be possible, too (judging from the api, of course, it ought to be :)

eru15y ago

From the types you give, I can't see how it works. Would you please elaborate?

j / k navigate · click thread line to collapse