Topic: Mingle Feature Requests / [candidate] More flexible trees

This discussion seems to be mostly focussed on the ability to have cards as children of other cards of the same type.

There is another use case mentioned in the initial suggestion/request (and re-raised here: http://studios.thoughtworks.com/discussion/forums/6/topics/574), which is to have a acyclic directed graph (not just a tree). This would require having cards able to have multiple parents irrespective of rules around the parent/child card type. Eg. A “story” card can be part of many “scenarios” (and “scenarios” have many “stories”), or a “task” can be required for many “stories” (and a “story” may consist of many “tasks”).

Topic: Mingle Feature Requests / Card trees as acyclic directed graphs

Well – the other thread seems to be a discussion more on having cycles where cards can have parent/child relationships with other cards of the same type – more a tree rather than a graph. But let’s re-invigorate the discussion there perhaps – so I’ll cross post into there….

Topic: Mingle Feature Requests / Card trees as acyclic directed graphs

Also – this feature would be incredibly helpful for tracking shared scope or dependencies. Often a “task” has to be performed for any of a group of stories – it is a dependency. It will have it’s own estimate of effort and this will be incurred for whatever story is played first.

Being able to have “tasks” that can have multiple stories as parents would provide the ability to track this. Obviously a story can have multiple tasks as children as well – so it is an example of an acyclic graph.

Topic: Mingle Feature Requests / Support for sqlite

It would be good if the mingle download would work out-of-the-box with sqlite. I don’t really want to have to install a full DB on my machine just to use mingle as a single user. It’s heavy weight and I have to remember to start/stop it when I begin/stop using mingle.

It would be much, much simpler if I could just download, run, specify where to read/write the DB file, and then use :) This would also make the barrier to entry for those trialing mingle much lower.

Topic: Mingle Feature Requests / Card trees as acyclic directed graphs

This was briefly mentioned in http://studios.thoughtworks.com/discussion/forums/6/topics/497 , but then largely ignored.

It would be very, very useful to have trees actually be acyclic directed graphs (rather than pure trees). There is a very obvious use-case for this, which is scenarios (or process mapping if you prefer).

If I have a card that represents a scenario (or process), it may have many children which are the stories that make up that scenario. But those stories may also be required for implementing a different scenario. So scenarios can have many stories as children, and stories can have many scenarios as parents (many-to-many relationship).

At the moment there is no easy way to do this other than create duplicates of stories or a card tree for each scenario.

Topic: Mingle Feature Requests / [candidate] Support a prioritized list

+1 (and I’ve been hounding you for a while on this Adam :) )