Top-nodes algorithm: Difference between revisions

Revision as of 11:25, 18 November 2009

Revision as of 14:37, 27 January 2011

Line 11:

==Principle==

The calendar is stored as a [[binary tree]] where leafs represent elementary time periods. Other nodes represent the period of time covered by all their descendants.

<center>[[Image:AlgoRayroleArbre.jpgsvg|Example of a 7-hour calendar (with elementary periods of one hour)]]</center>

<center>''Example of a 7-hour calendar (with elementary periods of one hour)''</center>

Line 20:

and

* it is the root node, or at least one descendant of the parent node is outside of the reservation period of time.

<center>[[Image:AlgoRayroleResa.jpgsvg|Top-nodes for a reservation from 1:00 to 5:59]]</center>

<center>''Top-nodes for a reservation from 1:00 to 5:59''</center>