public class TimeEventWeightedHash extends Object
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).
.Modifier and Type | Field and Description |
---|---|
protected long |
epsilon |
Modifier and Type | Method and Description |
---|---|
static TimeEventWeightedHash |
buildHash(List<? extends TimeEvent> events) |
static TimeEventWeightedHash |
buildHash(List<? extends TimeEvent> events,
long epsilon)
Returns the Greatest Weighted Path of TimeEvents
|
List<? extends TimeEvent> |
getGreatestWeightedPathAsOrderedList() |
String |
toString() |
public static TimeEventWeightedHash buildHash(List<? extends TimeEvent> events)
public static TimeEventWeightedHash buildHash(List<? extends TimeEvent> events, long epsilon)
public List<? extends TimeEvent> getGreatestWeightedPathAsOrderedList()
Copyright © 1999-2015 Apache OODT. All Rights Reserved.