Compare commits
2 Commits
82befabe64
...
1fe3e8e7cb
Author | SHA1 | Date |
---|---|---|
filifa | 1fe3e8e7cb | |
filifa | c163aa0f23 |
|
@ -70,13 +70,7 @@ func (g *projectNetwork) forwardPass(toposort []*activity) {
|
||||||
// backwardPass computes the late times and slack for each activity using the
|
// backwardPass computes the late times and slack for each activity using the
|
||||||
// early times
|
// early times
|
||||||
func (g *projectNetwork) backwardPass(toposort []*activity) {
|
func (g *projectNetwork) backwardPass(toposort []*activity) {
|
||||||
n := len(toposort)
|
for i := len(toposort) - 1; i >= 0; i-- {
|
||||||
|
|
||||||
end := toposort[n-1]
|
|
||||||
end.lateFinish = end.earlyFinish
|
|
||||||
end.lateStart = end.lateFinish - end.duration
|
|
||||||
|
|
||||||
for i := n - 2; i >= 0; i-- {
|
|
||||||
a := toposort[i]
|
a := toposort[i]
|
||||||
g.setLateTimes(a)
|
g.setLateTimes(a)
|
||||||
}
|
}
|
||||||
|
@ -84,25 +78,30 @@ func (g *projectNetwork) backwardPass(toposort []*activity) {
|
||||||
|
|
||||||
// setEarlyTimes sets the early times for an activity
|
// setEarlyTimes sets the early times for an activity
|
||||||
func (g *projectNetwork) setEarlyTimes(a *activity) {
|
func (g *projectNetwork) setEarlyTimes(a *activity) {
|
||||||
es := 0.0
|
|
||||||
predecessors := g.To(a.ID())
|
predecessors := g.To(a.ID())
|
||||||
for predecessors.Next() {
|
for predecessors.Next() {
|
||||||
p := predecessors.Node().(*activity)
|
p := predecessors.Node().(*activity)
|
||||||
es = math.Max(es, p.earlyFinish)
|
if a.earlyStart < p.earlyFinish {
|
||||||
|
a.earlyStart = p.earlyFinish
|
||||||
|
}
|
||||||
}
|
}
|
||||||
a.earlyStart = es
|
|
||||||
a.earlyFinish = a.earlyStart + a.duration
|
a.earlyFinish = a.earlyStart + a.duration
|
||||||
}
|
}
|
||||||
|
|
||||||
// setLateTimes sets the late times for an activity
|
// setLateTimes sets the late times for an activity
|
||||||
func (g *projectNetwork) setLateTimes(a *activity) {
|
func (g *projectNetwork) setLateTimes(a *activity) {
|
||||||
lf := math.Inf(1)
|
a.lateFinish = math.Inf(1)
|
||||||
successors := g.From(a.ID())
|
successors := g.From(a.ID())
|
||||||
for successors.Next() {
|
for successors.Next() {
|
||||||
s := successors.Node().(*activity)
|
s := successors.Node().(*activity)
|
||||||
lf = math.Min(lf, s.lateStart)
|
if a.lateFinish > s.lateStart {
|
||||||
|
a.lateFinish = s.lateStart
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
if a.lateFinish == math.Inf(1) {
|
||||||
|
a.lateFinish = a.earlyFinish
|
||||||
}
|
}
|
||||||
a.lateFinish = lf
|
|
||||||
a.lateStart = a.lateFinish - a.duration
|
a.lateStart = a.lateFinish - a.duration
|
||||||
a.slack = a.lateFinish - a.earlyFinish
|
a.slack = a.lateFinish - a.earlyFinish
|
||||||
}
|
}
|
||||||
|
|
Loading…
Reference in New Issue