(graph, package, affectedPackages)
| 59 | // This function performs a depth-first-search to add affected packages that |
| 60 | // transitively depend on the given package. |
| 61 | function traverseDependencyGraph(graph, package, affectedPackages) { |
| 62 | // Terminate early if the package has been visited. |
| 63 | if (affectedPackages.has(package)) { |
| 64 | return; |
| 65 | } |
| 66 | |
| 67 | const consumingPackages = graph[package]; |
| 68 | |
| 69 | if (!consumingPackages) { |
| 70 | return; |
| 71 | } |
| 72 | |
| 73 | consumingPackages.forEach(consumingPackage => { |
| 74 | traverseDependencyGraph(graph, consumingPackage, affectedPackages); |
| 75 | affectedPackages.add(consumingPackage); |
| 76 | }); |
| 77 | } |
| 78 | |
| 79 | exports.exec = exec; |
| 80 | exports.constructDependencyGraph = constructDependencyGraph; |
no test coverage detected
searching dependent graphs…