Branching
The structural feature in Tree where multiple parallel paths exist between two points in the project graph.
Branching is the structural feature in Tree where multiple parallel paths exist between two points in the project graph. Branching lets teams explore alternatives, plan optional work, or run independent workstreams without committing to a single sequence.
What branching enables
Branching supports three common patterns:
- Exploration: when the team is deciding between two approaches, both can be planted as branches and developed independently until enough information exists to commit
- Optional work: branches that lead to outcomes the project may or may not need, available to develop if priorities shift but not required for project completion
- Independent workstreams: genuinely parallel work with separate prerequisites and separate deliverables, kept visually distinct without forcing artificial ordering
How branches behave
Branches can:
- Converge: two parallel branches feeding into the same downstream node, which won't unlock until every contributing branch completes its work
- Be pruned: removing a branch deletes its nodes and edges from the graph, with the decision preserved in the graph's history
- Be added mid-project: new branches can be planted as the team discovers new approaches or scope additions
Branching is what makes Tree different from a list. A list can express order but not divergence. Two paths in a list are either two lists or one list with priority rules. Neither captures the shape that a graph expresses naturally as branches.
When branching matters
Branching is most useful during the scoping phase, where the team hasn't yet committed to a specific approach. It's also useful for managing genuinely parallel work that doesn't fit a single sequence. For projects with clear, linear sequences and no decision points, branching adds little value beyond what a simpler structure already provides.
Tier availability
Branching is part of the core feature set, available on Free, Paid, and Team.
Related
LAST UPDATED · 2026-05-12


