alkdev/taskgraph_ts
2
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

docs(analysis/bottlenecks): mark task as completed

Browse Source
This commit is contained in:
glm-5.1
2026-04-27 12:36:14 +00:00
parent 8d1b478a8c
commit e074275bcf
1 changed files with 12 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

21
tasks/implementation/analysis/bottlenecks.md
View File

@@ -1,7 +1,7 @@
--- ---
id: analysis/bottlenecks id: analysis/bottlenecks
name: Implement bottlenecks analysis function name: Implement bottlenecks analysis function
status: pending status: completed
depends_on: depends_on:
- graph/construction - graph/construction
- graph/queries - graph/queries
@@ -17,12 +17,12 @@ Implement `bottlenecks(graph: TaskGraph): Array<{ taskId: string; score: number
## Acceptance Criteria ## Acceptance Criteria
- [ ] `bottlenecks` returns array of `{ taskId, score }` objects sorted by score descending - [x] `bottlenecks` returns array of `{ taskId, score }` objects sorted by score descending
- [ ] Uses `graphology-metrics` betweenness centrality computation - [x] Uses `graphology-metrics` betweenness centrality computation
- [ ] Normalized scores (0.0–1.0 range) - [x] Normalized scores (0.0–1.0 range)
- [ ] Tasks with score 0 are still included (they're not bottlenecks) - [x] Tasks with score 0 are still included (they're not bottlenecks)
- [ ] Works on disconnected graphs (betweenness is 0 for disconnected components) - [x] 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) - [x] Unit tests: linear chain (middle node has highest betweenness), star graph (center has highest), independent nodes (all zero)
## References ## References
@@ -31,8 +31,11 @@ Implement `bottlenecks(graph: TaskGraph): Array<{ taskId: string; score: number
## Notes ## Notes
> To be filled by implementation agent Graphology-metrics betweenness centrality throws on empty graphs (mnemonist FixedStack requires positive capacity). Handled by returning empty array when `graph.raw.order === 0`.
## Summary ## Summary
> To be filled on completion Implemented `bottlenecks(graph: TaskGraph): BottleneckResult[]` using `graphology-metrics` betweenness centrality with `normalized: true`.
- Created: `src/analysis/bottleneck.ts` (bottlenecks function + BottleneckResult interface)
- Modified: `test/analysis.test.ts` (replaced placeholder with 20 tests covering all acceptance criteria)
- Tests: 20, all passing (linear chain, star graph, independent nodes, disconnected graph, diamond, empty graph, single node, sorted output, normalized scores)