Incremental algorithms

Much of the efficiency of the tskit approach comes from the use of incremental algorithms. By considering only the difference between adjacent trees, incremental algorithms avoid having to perform the same calculation multiple times on different trees.

This tutorial will explain the philosophy behind incremental algorithms, and provide examples of how to create your own (e.g. using the TreeSequence.edge_diffs() method).

Todo

Create content. See issue 233