Топологическая сортировка

1function topoSort(graph: Map<string, string[]>): string[] {
2  const indeg = new Map<string, number>()
3  for (const [v] of graph) indeg.set(v, 0)
4  for (const targets of graph.values()) {
5    for (const t of targets) indeg.set(t, (indeg.get(t) ?? 0) + 1)
6  }
7 
8  const queue: string[] = [...indeg.entries()]
9    .filter(([, d]) => d === 0)
10    .map(([v]) => v)
11 
12  const order: string[] = []
13  while (queue.length > 0) {
14    const v = queue.shift() as string
15    order.push(v)
16    for (const t of graph.get(v) ?? []) {
17      indeg.set(t, (indeg.get(t) ?? 0) - 1)
18      if ((indeg.get(t) ?? 0) === 0) queue.push(t)
19    }
20  }
21 
22  return order
23}