Topolojik Sıralama (Topological Sort) Algoritması

1function topologicalSort(graph: Record): { result: string[], hasCycle: boolean } {
2  const visited: Record = {};
3  const tempVisited: Record = {};
4  const result: string[] = [];
5  let hasCycle = false;
6  
7  function dfs(node: string) {
8    if (tempVisited[node]) {
9      hasCycle = true;
10      return;
11    }
12    if (visited[node]) {
13      return;
14    }
15    tempVisited[node] = true;
16    const neighbors = graph[node] || [];
17    for (const neighbor of neighbors) {
18      dfs(neighbor);
19    }
20    visited[node] = true;
21    tempVisited[node] = false;
22    result.unshift(node);
23  }
24  
25  for (const node of Object.keys(graph)) {
26    if (!visited[node]) {
27      dfs(node);
28    }
29  }
30  
31  return { result, hasCycle };
32}