Jerome Kelleher

To really do this efficiently for sites we'd need a method for efficiently seeking to particular trees, so I'm putting this in the random access project.

In general we need higher level APIs for accessing and modifying metadata schemas - do we have some issues open to track this @benjeffery? At the moment you have to...

This would be very handy in the msprime tutorial, for example, where we want to show tree sequences with node colours corresponding to different populations.

These are great ideas @hyanwong, but I think we should keep the focus of draw_svg clear, and not muddy it with extra jobs to do. It'll be a very complicated...

Also, support for unary nodes would be good (but I suspect this will happen automatically)

Related: #24 and #4

They are overlapping though, aren't they? We *should* be able to get them from the existing indexes though, by binary searching the in-order and out-order indexes...

See also #685

I've thought about this again, and no, I can't see anyway of doing this efficiently without a different type of index. The indexes we have tell us the order in...

> To do this you'd need to find the first in edge i that has i.right > target, then you also find the first out edge o that has o.right...