ben.carrasco/prowler
1
0
Fork 0
mirror of https://github.com/prowler-cloud/prowler.git synced 2026-07-24 13:01:56 +00:00
Code Issues Packages Projects Releases Wiki Activity

fix(attack-paths): highlight single path upstream instead of all paths

Browse Source 
Changed upstream traversal to follow only one parent at each level
instead of all parents. This prevents the entire graph from lighting
up when selecting a node that has multiple ancestors with many children.

- Upstream: now uses find() to get first parent only
- Downstream: unchanged, still highlights all descendants
This commit is contained in:
Andoni A.
2026-01-08 18:18:44 +01:00
parent 7bb5354275
commit 2388a053ee
1 changed files with 12 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files
ui/app/(prowler)/attack-paths/(workflow)/query-builder/_components/graph/attack-path-graph.tsx
+12 -9
View File
@@ -91,7 +91,9 @@ const AttackPathGraphComponent = forwardRef<
selectedNodeIdRef.current = selectedNodeId ?? null;
}, [selectedNodeId]);
// Helper function to find all edges in the path from a given node
// Helper function to find edges in the path from a given node
// Upstream: follows only ONE parent path (first parent at each level) to avoid lighting up siblings
// Downstream: follows ALL children recursively
const getPathEdges = (
nodeId: string,
edges: Array<{ sourceId: string; targetId: string }>,
@@ -99,20 +101,21 @@ const AttackPathGraphComponent = forwardRef<
const pathEdgeIds = new Set<string>();
const visitedNodes = new Set<string>();
// Traverse upstream (find all sources leading to this node)
// Traverse upstream - only follow ONE parent at each level (first found)
// This creates a single path to the root, not all paths
const traverseUpstream = (currentNodeId: string) => {
if (visitedNodes.has(`up-${currentNodeId}`)) return;
visitedNodes.add(`up-${currentNodeId}`);
edges.forEach((edge) => {
if (edge.targetId === currentNodeId) {
pathEdgeIds.add(`${edge.sourceId}-${edge.targetId}`);
traverseUpstream(edge.sourceId);
}
});
// Find the first parent edge only
const parentEdge = edges.find((edge) => edge.targetId === currentNodeId);
if (parentEdge) {
pathEdgeIds.add(`${parentEdge.sourceId}-${parentEdge.targetId}`);
traverseUpstream(parentEdge.sourceId);
}
};
// Traverse downstream (find all targets from this node)
// Traverse downstream (find ALL targets from this node)
const traverseDownstream = (currentNodeId: string) => {
if (visitedNodes.has(`down-${currentNodeId}`)) return;
visitedNodes.add(`down-${currentNodeId}`);