* Calculate the impact radius of a node * * Returns all nodes that could be affected by changes to this node. * * @param nodeId - ID of the node * @param maxDepth - Maximum depth to traverse (default: 3) * @returns Subgraph containing potentially impacted nodes
(nodeId: string, maxDepth: number = 3)
| 1741 | * @returns Subgraph containing potentially impacted nodes |
| 1742 | */ |
| 1743 | getImpactRadius(nodeId: string, maxDepth: number = 3): Subgraph { |
| 1744 | return this.traverser.getImpactRadius(nodeId, maxDepth); |
| 1745 | } |
| 1746 | |
| 1747 | /** |
| 1748 | * Find the shortest path between two nodes |
no outgoing calls
no test coverage detected