Demonstrates FS (Finish-to-Start), SS (Start-to-Start), FF (Finish-to-Finish) and SF (Start-to-Finish) dependencies, plus lag (positive offset) and lead (negative offset).
Task B cannot start until Task A finishes. The dependency is expressed as a plain string (existing API — still works).
Task B cannot start until Task A starts. The arrow exits A's left edge and enters B's left edge.
Task B cannot finish until Task A finishes. The arrow exits A's right edge and enters B's right edge.
Task B cannot finish until Task A starts. The arrow exits A's left edge and enters B's right edge.
Lag (positive) delays B's start; lead (negative) means B can overlap A. The
lag value is stored on the dependency and available in the data model.
| Type | Meaning | Arrow from → to |
|---|---|---|
| FS | B cannot start until A finishes | A finish → B start |
| SS | B cannot start until A starts | A start → B start |
| FF | B cannot finish until A finishes | A finish → B finish |
| SF | B cannot finish until A starts (rare) | A start → B finish |