Live data from Hacker News

Show HN: Grit – a multitree-based personal task manager

github.com

11–20 of 47 posts

Re: Show HN: Grit – a multitree-based personal task manager

#11
post #7

What's the difference between a dag and a multitree? The wikipedia article was confusing - it seems that it prevents diamond shapes? Like where 1 leads to both 2 and 3, and where 2 and 3 both lead to 4?

Precisely; a multi-tree has a unique path between two nodes. On the same note, I wonder what is the relation between dags/multitrees and semilattices. They seem to be very similar concepts afaict.

Oh, so you can only crosslink from different root nodes. That makes sense.

There are so many ways to structure todos. In this case, it appears to be using subtasks specifically to break things down in various ways, and it's a cool implementation.

I personally think of todos as having dependencies, like a simplified PERT chart, which would more require a DAG. If I brought in the ability to generalize groups of that graph (or in the other direction, take a general node and "break it down" into a group of nodes), I guess I'm thinking of a multi-graph there. That sounds really hard. :)

Re: Show HN: Grit – a multitree-based personal task manager

#12
How do you handle ordering?

I noticed:

    $ grit add -p 5 Bread
    (5) -> (6)
    $ grit add -p 5 Milk
    (5) -> (7)
    $ grit add -p 5 Eggs
    (5) -> (8)
led to:

    ├──[ ] Get groceries (5)
    │   ├──[ ] Bread (6)
    │   ├──[ ] Eggs (8)
    │   └──[ ] Milk (7)
And I didn't see anything about reordering tasks in the readme. Is everything sorted by title?

Re: Show HN: Grit – a multitree-based personal task manager

#13
Wow a very cool idea. The idea of many root nodes for different views seems interesting. Unfortunatly it does not build on my pc, it seems to import an absolute path in the go build command of the Makefile, which it can not do. (cannot import absolute path)

Since I never really worked with go, I don't know where to start here.

Re: Show HN: Grit – a multitree-based personal task manager

#14
post #12

How do you handle ordering? I noticed: $ grit add -p 5 Bread (5) -> (6) $ grit add -p 5 Milk (5) -> (7) $ grit add -p 5 Eggs (5) -> (8) led to: ├──[ ] Get groceries (5) │ ├──[ ] Bread (6) │ ├──[ ] Eggs (8) │ └──[ ] Milk (7) And I didn't see anything about reordering tasks in the readme. Is everything sorted by title?

Yes, it's sorted by name in natural order. I haven't decided yet which would work best as default (this vs insertion order) -- feedback is welcome. This works well for numbered book chapters, something I personally find useful. In any case, the defaults will be configurable -- when I implement config :)

(Another thing on the TODO list is adding an optional priority score for each task, and sorting those on top of the list in all tree views.)

Re: Show HN: Grit – a multitree-based personal task manager

#15

Wow a very cool idea. The idea of many root nodes for different views seems interesting. Unfortunatly it does not build on my pc, it seems to import an absolute path in the go build command of the Makefile, which it can not do. (cannot import absolute path) Since I never really worked with go, I don't know where to start here.

Thanks! Please open an issue on github if have an account there. System information would be particularly helpful.

Re: Show HN: Grit – a multitree-based personal task manager

#16

TiddlyWiki uses a similar data model for table of contents by default and I love it! I think the multitree constraint is a good idea over a general DAG.

Tiddlywinks is one of those things that is too good to actually monetize. It's amazing software. In you can run on it on a server or on an a flasdrive. Or just from dropbox.

Re: Show HN: Grit – a multitree-based personal task manager

#19

I use a flat text file with exactly this structure, just indenting when I need a new layer. I tried fiddling with it with vim folds but in the end just ended up deleting things I finish. I learned this from a friend at work.

From a quick glance at the README this supports a slightly more interesting structure than an indented text file: it's actually a DAG where large subgraphs are trees. This allows links between different nodes. That's not possible in an indented text file.
Post reply on HN