Content deleted Content added
Added wikilinks |
m fixed lint errors – obsolete HTML tags |
||
(One intermediate revision by one other user not shown) | |||
Line 1:
The '''top-nodes algorithm''' is an [[algorithm]] for managing a resource reservation calendar. The algorithm has been first published in 2003,<ref>[https://archive.
The algorithm allows users to:
Line 9:
==Principle==
The calendar is stored as a [[binary tree]] where leaves represent elementary time periods. Other nodes represent the period of time covered by all their descendants.
The period of time covered by a reservation is represented by a set of "top-nodes". This set is the minimal set of nodes that exactly cover the reservation period of time.
Line 17:
* all its descendants are inside the reservation period of time, and
* it is the root node, or at least one descendant of the parent node is outside of the reservation period of time.
The following value is stored in each node:
|