Builds a time sorted hash where the top value has the earliest time. This hash is a directional graph. It builds all possible paths from top node to leaf nodes. At any time you can ask for the greatest weighted path in the hash -- that is, the path from root node to a leaf node which fills the most time. Epsilon is TimeEvent objects allowed time overlap (it is of the same unit of measurement that is used in you TimeEvent objects added to this hash).
.
|
|