Wiki source code of Data structure

Last modified by mqheikki@helsinki_fi on 2024/02/07 06:49
Show last authors
1 An idea of data structure to be tested:
2
3 **Accession**: information about the accession and its provenance. Location, collecting date, collector, identifications etc.
4
5 **Branch**: events tied to a location in garden: describes what has been done to the parts of an accession. These form a branching structure where the history of each individual plant can be tracked. The 'tails' of the branches show what kinds of descendants of the accession are present in the garden.
6
7 Below is an example where a single plant and 10 grams of seeds were collected, and have resulted in 1+7 plants in garden, 8 sown but ungerminated seeds, and some amount of seeds in seed storage.
8
9 When only part of one branch is tended, the system automatically splits the branch in two. This is controlled by the inclusive-field. For example: If there is 10 grams of seeds, out of which 15 individual seeds are sown, the user marks this as non-inclusive. Then the system understands that there are still some seeds (10 grams - 15 in this case) in storage, and creates a new branch for the stored seeds automatically (branch ID P6 in the example).
10
11 //Example~://
12
13 [[image:attach:accession.png]]