Hi Felix, Thanks a lot for all the details.
Correct me if I'm wrong, it appears I am indeed questioning the approach where a graph (rather than a view) was to be defined by a filter, which may for the time being be restricted to tags and, as you say, may be extended to allow entering a plaintext filter expression (yay!). If one wanted to manually edit a graph, this is helpful to get to an initial set of tiddlers that one wants represented in a graph (rather than a view), but one may want to add additional tiddlers that don't correspond to any such filter expression. In other words, while it is entirely neat to be able to generate dynamic graphs based on filters, perhaps some kind of "free graph" may be an approach to be able to select and add individual tiddlers without any filter constraints to a given graph, in fact, the filter being a means to only temporarily constrain a given graph to a certain subset of it and when removed, to revert to one particular graph, rather than an overall graph of all tiddlers and all edges. So, the question seems: (How) might it be possible to have different *graphs* in one and the same wiki? When I say "graph", I am really not talking about a visual representation (*view*) but about a nodetree, the underlying information structure whereas two independent nodes of two separate graphs may indeed relate to one and the same tiddler. For example, let's say I have the tids... - Mum - Dad - Kiddo I may want one *graph* for general relationships showing... Mum => parent of => Kiddo Dad => parent of => Kiddo Mum => married to => Dad (btw. can an edge be bidirectional?) ...and another more task oriented *graph* that shows... Dad => brings to school => Kiddo Mum => brings to bed => Kiddo Dad => brings flowers for => Mum I guess there's quite a difference between the filter-based, *dynamically generated* graph you produce now and a *static, manually* edited graph, whereas the former feels impressively powerful and dynamic, but the latter is what people may desire just as much, and in fact perhaps more corresponds to a basic capability one would hope to find in representing tiddlers in a graph. For now, let's say I'm quite curious as to how you might envision / implement node-filtering :-) - tb -- You received this message because you are subscribed to the Google Groups "TiddlyWiki" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/tiddlywiki. For more options, visit https://groups.google.com/d/optout.
