← 中文资源

简体中文版本

构建图遍历服务

构建图遍历服务:完整覆盖 graph traversal,含 Adjacency store、BFS engine 与测试的端到端实现。

阅读英文原文

项目概述

本项目实现一个面向 graph traversal 的完整系统,核心要解决的问题是 answering shortest-path and reachability queries over a graph that changes between queries。整体由 Adjacency store、BFS engine、Dijkstra engine、Path materializer、Graph snapshot 五个模块组成,每个模块单一职责、可独立测试,最后通过集成测试验证端到端正确性。设计上把 a query that hits a disconnected component and walks the entire reachable set before returning empty 作为第一类需求先行处理,而非事后再补。

架构与关键决策

数据模型为 an adjacency list keyed by node id with weighted edges, backed by a read-mostly copy swapped atomically on updates。Adjacency store 定义其余阶段共同依赖的数据形状并在边界处校验输入;BFS engine 承载 graph traversal 的正确性逻辑;Dijkstra engine 专门处理 a query that hits a disconnected component and walks the entire reachable set before returning empty,在失败路径上给出明确的拒绝、重试或降级策略;Path materializer 提供可观测性,每次操作输出带关联 id 的结构化事件;Graph snapshot 在过载时按既定方式降级,避免过载演变为数据损坏。配置与代码分离,使风险变更可经 diff 审阅。

实施与测试

按五个阶段依次实现 Adjacency store、BFS engine、Dijkstra engine、Path materializer、Graph snapshot,每阶段配套聚焦单测。集成测试组合各模块并驱动真实 graph traversal 场景:先验证正常路径,再刻意触发 a query that hits a disconnected component and walks the entire reachable set before returning empty 并断言系统降级而非损坏。所有依赖均在进程内或被桩替换,用例在 CI 中确定可复现。

限制与后续

  • 单区域设计,多区域复制超出范围。
  • Adjacency store 默认进程内,未水平共享。
  • 无鉴权层,假定部署在强制身份的边缘之后。

代码示例

# setup for graph-traversal-service
pnpm init
pnpm add fastify redis
pnpm add -D typescript tsx vitest
graph_traversal_service/
├── src/index.ts
├── src/adjacency-store.ts
├── src/bfs-engine.ts
├── tests/graph_traversal_service.test.ts
└── package.json
// Adjacency store: graph traversal core
export function adjacencystore(input: AdjacencystoreInput): AdjacencystoreResult {
  // Build the adjacency store that anchors graph traversal and defines the core data shape.
  return processAdjacencystore(input);
}
// BFS engine — handles graph traversal Add the bfs engine so
export class Bfsengine {
  constructor(private opts: BfsengineOptions) {}
  async run(ctx: Context): Promise<BfsengineOutput> {
    return this.execute(ctx);
  }
}
// Dijkstra engine: graph traversal stage
export const dijkstraengine = (next: Next) => async (req: Request) => {
  const out = await transform(req);
  return next(out);
};
// Path materializer for graph traversal
export async function pathmaterializer(stream: AsyncIterable<Chunk>): Promise<Aggregate> {
  let acc = init();
  for await (const c of stream) acc = merge(acc, c);
  return acc;
}
// Graph snapshot: graph traversal finalization
export function graphsnapshot(state: State): Result {
  validate(state);
  return finalize(state);
}
# run the graph traversal test suite
pnpm vitest run