A method to account for different calendars along the driving path(s):
For a collection of incomplete predecessors
When the lowest dependency float <> 0
normalize dependency float to set the lowest value equal to 0
this accounts for scenarios where a predecessor task with a 7 day calendar is driving a successor task with a 5 day calendar but the dependency float is > 0 because the network spans a weekend (or other nonworking time)
A method to account for different calendars along the driving path(s):