Dan Handwerker

The static figures that are linked to [here](https://github.com/ME-ICA/tedana/issues/355#issuecomment-515593755) should still be fairly accurate. You or I can tweak them depending on your specific needs.

That's definitely possible, but I don't think something like that currently exists. I'm definitely not getting to it this week, but check back with me in a week or two.

The GraphViz code I've included above still models the current algorithm. The other versions are slightly prettier, but the nice thing about about GraphViz is it should be eventually possible...

My biased opinion is that the information in the flow chart used in the [tedana OHBM 2020 poster](https://github.com/ME-ICA/tedana-ohbm-2020/blob/master/docs/OHBM2020_1083_tedana_poster_with_links.pdf) is currently the most accurate summary of what the code is doing...

From the March 2021 dev call: Dan volunteers to do this, based on Taylor’s #622, but will not take offense if someone else gets to it first. A short-term option...

I'm not particularly fond of carpet plots, but I also agree. The weighted combination of the echoes is the most likely to be useful.

I just noticed this PR has been sitting around and looks like it's close to merge-able, but still a draft. Anything critical to do before opening this up for review...

@ME-ICA/tedana-devs Josh and I have been working on this and there's been lots of progress. I updated the initial comment to keep track of what's done and what still needs...

Here's the poll for scheduling a decision tree walk-through meeting sometime in the next two weeks: https://doodle.com/meeting/participate/id/9b6wn5Ld I've already limited to times I could be available. @tsalo @eurunuela @notZaki &...

I guess I'm the grumpy elder here who thinks that, if you're using software you should at least read enough of the documentation to know what they ask you to...