Project Spine Visualization & Algorithm

Selected spine (one maximum-cardinality chain)

Regular Task

Finite Spine Construction

Step 1: Validate the DAG

Check task identifiers, reject cycles, and compute a topological order.

                                order = topologicalSort(tasks, dependencies)

                                require order.length == tasks.length

Step 2: Compute Reachability and Height

Use transitive reachability for comparability checks and longest-predecessor ranks for height.

                                rank(v) = 1 + max(rank(u))

                                height = max(rank)

Step 3: Recover a Maximum Chain

Follow the stored predecessor pointers from a height-eight endpoint.

                                spine = unwind(heightParent)

                                require spine.length == height

Step 4: Validate the Partitions

Check coverage, transitive incomparability, minimum size, and one spine task per part.

                                require coversEachTaskOnce(partition)

                                require everyPartIsAntichain(partition)

Step 5: Compare Selection Rules

Height selects one maximum-cardinality chain; CPM selects a maximum-duration path. The criteria differ, but a path can satisfy both. In this example the CPM path is another maximum-cardinality chain and is also a spine.

What's a Project Spine?

A spine is a chain paired with an antichain partition whose every part it meets. This prototype selects one maximum-cardinality chain for the finite DAG and verifies three compatible minimum partitions.

The property is existential, not universal: arbitrary antichains or arbitrarily refined partitions need not meet the chosen chain.

A chain may qualify under more than one selection rule. Here the CPM path is also maximum-cardinality and meets every displayed partition, so it is a second spine rather than a non-spine comparator.

What's an Antichain?

An antichain is a set of pairwise precedence-incomparable tasks. Logical parallelism does not guarantee simultaneous execution once resources, calendars or access constraints are considered.

The displayed layerings are deliberately compatible, programmatically verified minimum partitions—not arbitrary management groupings.

Why This Matters for Project Management

Topology check: a height-eight chain certifies one task in every verified precedence layer.
CPM comparison: the 17-day height-selected spine runs through G; the 19-day CPM-selected path runs through H and is also a spine.
Assurance: every displayed group is checked against transitive reachability.
Use: compare spine, critical, resource-constrained and high-risk tasks before deciding where to intervene.

Mountain Refuge Shed Project: Spine Analysis

Finite Spine Construction

What's a Project Spine?

What's an Antichain?

Why This Matters for Project Management