(graph: Graph)
| 50 | * Transpose a directed graph i.e. reverse the direction of the edges. |
| 51 | */ |
| 52 | export function transposeGraph(graph: Graph) { |
| 53 | verifyGraph(graph); |
| 54 | const transposed: Graph<Set<string>> = {}; |
| 55 | for (const [nodeName, connectedNodes] of Object.entries(graph)) { |
| 56 | for (const connectedNode of connectedNodes) { |
| 57 | if (!transposed[connectedNode]) { |
| 58 | transposed[connectedNode] = new Set(); |
| 59 | } |
| 60 | if (!transposed[nodeName]) { |
| 61 | // Make sure the node itself ends up in the transposed graph. |
| 62 | transposed[nodeName] = new Set(); |
| 63 | } |
| 64 | transposed[connectedNode].add(nodeName); |
| 65 | } |
| 66 | } |
| 67 | return transposed; |
| 68 | } |
| 69 | |
| 70 | /** |
| 71 | * Topologically sort a directed acyclic graph. |
no test coverage detected
searching dependent graphs…