Skip to content

Latest commit

 

History

History
32 lines (27 loc) · 837 Bytes

incremental_algorithms.md

File metadata and controls

32 lines (27 loc) · 837 Bytes
jupytext kernelspec
text_representation
extension format_name format_version jupytext_version
.md
myst
0.12
1.9.1
display_name language name
Python 3
python
python3

(sec_incremental)=

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 {meth}TreeSequence.edge_diffs method).

:::{todo} Create content. See issue 233 :::