Top-nodes Algorithm - Principle

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.

Example of a 7-hour calendar (with elementary periods of one hour)

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.

A node of the binary tree is a "top-node" for a given reservation if

  • 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.
Top-nodes for a reservation from 1:00 to 5:59

The following value is stored in each node:

q(node) = max(q(left child), q(right child)) + total amount of reserved resource for all reservations having this node as a "top-node"

(for code optimization, the two parts of this sum are usually stored separately.)

Read more about this topic:  Top-nodes Algorithm

Famous quotes containing the word principle:

    As in an icicle the agnostic abides alone. The vital principle is taken out of all endeavor for improving himself or bettering his fellows. All hope in the grand possibilities of life are blasted.
    Anna Julia Cooper (1859–1964)

    If there be one principle more deeply rooted than any other in the mind of every American, it is that we should have nothing to do with conquest.
    Thomas Jefferson (1743–1826)

    The sons of Judah have to choose that God may again choose them.... The divine principle of our race is action, choice, resolved memory.
    George Eliot [Mary Ann (or Marian)