taskgraph_ts/tasks/implementation/analysis/bottlenecks.md at 131e3e929b50de5749c864fbd04c4e5e3ffda52d

Files

glm-5.1 131e3e929b Decompose architecture into 28 atomic implementation tasks

Break the @alkdev/taskgraph architecture specs into dependency-ordered
implementation tasks across 8 component directories: setup, schema,
error, graph, analysis, cost-benefit, frontmatter, api, and review.
Each task has clear acceptance criteria referencing specific architecture
docs. Three review tasks serve as quality gates at critical junction
points (schemas-and-errors, graph-complete, complete-library). The
dependency graph is validated acyclic with 9 topological levels enabling
significant parallelism across independent work streams.

2026-04-27 08:30:05 +00:00

1.2 KiB

Raw Blame History

id, name, status, depends_on, scope, risk, impact, level

name

status

depends_on

scope

risk

impact

level

analysis/bottlenecks

Implement bottlenecks analysis function

pending

graph/construction

graph/queries

narrow

low

component

implementation

Description

Implement bottlenecks(graph: TaskGraph): Array<{ taskId: string; score: number }> using graphology-metrics betweenness centrality. Bottleneck tasks are those on the most shortest paths between other nodes.

Acceptance Criteria

bottlenecks returns array of { taskId, score } objects sorted by score descending
Uses graphology-metrics betweenness centrality computation
Normalized scores (0.0–1.0 range)
Tasks with score 0 are still included (they're not bottlenecks)
Works on disconnected graphs (betweenness is 0 for disconnected components)
Unit tests: linear chain (middle node has highest betweenness), star graph (center has highest), independent nodes (all zero)

References

docs/architecture/api-surface.md — bottlenecks signature
docs/architecture/build-distribution.md — graphology-metrics dependency

Notes

To be filled by implementation agent

Summary

To be filled on completion

1.2 KiB Raw Blame History Unescape Escape