A Gentle Introduction to Ted Nelson's ZigZag Structure (2002)
nongnu.org
nongnu.org
A ZigZag structure is an undirected graph. Nodes are arranged in an n-dimensional space. For each coordinate axis, every node can only have one edge in the plus-1-along-coordinate direction, and one edge in the minus-1-along-the-coordinate. I.e. no diagonal connections, and max one connection in each "cardinal direction" (+ and - in n dimensions = 2n directions).
In its simplest form, a ZigZag structure can be an n-dimensional grid, where each node is connected to its direct neighbors in the grid. In 2D, that would give you a spreadsheet. However, ZigZag can do more: you can have loops along any axis, e.g. a spreadsheet where the columns "wrap around". Furthermore, ZigZag supports looping the columns of only one particular row: a normal 2D spreadsheet, except that row 13 only has 4 columns, and those columns are wrapped up in a loop. You could also have sparse grids - where nodes are missing, and the edges skip over the missing node.
The idea is to have something that locally, if you look only at the surrounding nodes, always looks like a neat n-dimensional grid. But the global topology can be totally whacky.
I have no idea what you would use such a thing for.
Ditto. Every few years I look at this again, and I never can figure out what to use it for. At any rate, yours is a very good summary, thank you.
This can be said for pretty much all of Ted's work. Interesting and thought provoking, nonetheless.
Presenting graph-structured data in a way that the graph has sufficient restrictions on it to be representable usefully in a UI.
In some sense all data structures are just restrictions on graph data structures. So why not just use graphs directly more often? Because the full freedom of graphs can result in a lot of situations that are pathological for both algorithms and UIs, such as graphs that mostly have one node connected to one node, except suddenly there's a node with 1,000,000 connections, which raises obvious UI issues.
To the extent this is not used today, it's probably because in the end it's still too general and has been outcompeted by all the other UI widgets we have that take more advantage of all the menagerie of local structures we have identified. It turns out that we are generally willing to do the work to create specialized representations for those things. We do lose some generality, but, again, we seem willing to do the work to specialize, so it all mostly works out. Only a very few people are out there working with data with so little such specialized support that they are reduced to working with raw graphs directly, and they already mostly have no choice but to learn to deal with the graphs directly and would be as frustrated trying to jam them into this structure as they would any other structure that restricts graphs.
That sounds similar to the mathematical definition of a manifold: something that locally looks like an Euclidean space, but globally isn't.
Reminds me of those "Choose Your Own Advenuture" children's novels from the 80s.
Many of the oldest microcomputer ones, like Scott Adams' adventure games (and from your description, DikuMUD), are exactly what's described here, except as you note, with more than four directions: typically there are either six or ten (adding NW, NE, SW, SE to N, W, E, S, Up, Down), and I remember some that added "IN" and "OUT" as unique exit names. Other systems allow an arbitrary number of connections defined within the node, such as MUCK rooms or links between Twine nodes. Basically, these are multi-cardinal linked lists.
At risk of editorializing, I get this sort of feeling from a lot of my encounters with Ted Nelson's work: he and his more ardent defenders are very, very insistent about how visionary he is, but I often come away with "that's neat but not terribly practical" or, like here, "aren't these new names for stuff that already existed?" (Also, about 100% of the time I read about the history of his work, I'm left with "he would have had something there if he'd been willing/able to play nicely with others.")
"It is a sad story. It is an infuriating story." http://lambda-the-ultimate.org/node/233#comment-1715
> What is claimed is:
> 1. A method for visualizing data on a display, comprising:
> ...
In other words it seems like it could replace a spreadsheet as a way to explore data, but not _necessarily_ by storing the data any differently
I haven't looked at it much, so not sure quite what the state of it all is.
Mandela moment for me? Hmmm.
From Wikipedia: "He coined the terms hypertext and hypermedia in 1963 and published them in 1965."
Edit to add: I just noticed that the last update to that page was in 2002. When I hit the box about CSS, Mozilla, Netscape Navigator 4.7, and WML I did hard double-take.
Some visionaries prove to be prophets and seers. Some have ideas that are bogus. Due to the nature of visionary ideas, this is most of the time unknown -- e.g. Julian Jaynes's bicameral mind.
A crank is a visionary whose ideas are knowably bogus: e.g. Rupert Sheldrake. (A charlatan is unlike a crank because he has no idee fixe, no vision -- he moves opportunistically. A conspiracist is similarly unlike a crank because it bites at anything that moves.)
Whether Ted Nelson is a crank is left as an exercise for the reader.
https://hn.algolia.com/?dateRange=all&page=0&prefix=true&que...
That's not a mess, that's a graph.
Wasn't that another passion project?
https://cmap.ihmc.us/ https://en.wikipedia.org/wiki/CmapTools