Add FlattenGraph for GraphNode

xray/services/scan.go

@@ -2,6 +2,7 @@ package services
 
 import (
 	"encoding/json"
+	"github.com/jfrog/gofrog/datastructures"
 	"github.com/jfrog/jfrog-client-go/utils/log"
 	"net/http"
 	"strings"
@@ -189,6 +190,34 @@ type GraphNode struct {
 	Parent *GraphNode `json:"-"`
 }
 
+// FlattenGraph creates a set of dependencies from the given graph, and a map of the paths to each dependency.
+func FlattenGraph(graph []*GraphNode) []*GraphNode {
+	flatGraph := []*GraphNode{}
+	depsSet := datastructures.MakeSet[string]()
+	for _, node := range graph {
+		flatGraph = append(flatGraph, getUniqueDependencies(node, depsSet)...)
+	}
+	return []*GraphNode{{Id: "root", Nodes: flatGraph}}
+}
+
+func getUniqueDependencies(node *GraphNode, depsSet *datastructures.Set[string]) []*GraphNode {
+	uniqueDeps := []*GraphNode{}
+	// Append current node
+	if !depsSet.Exists(node.Id) {
+		uniqueDeps = append(uniqueDeps, &GraphNode{Id: node.Id})
+		depsSet.Add(node.Id)
+	}
+	// Append current node children
+	for _, dependency := range node.Nodes {
+		if !depsSet.Exists(dependency.Id) {
+			depsSet.Add(dependency.Id)
+			uniqueDeps = append(uniqueDeps, &GraphNode{Id: dependency.Id})
+			uniqueDeps = append(uniqueDeps, getUniqueDependencies(dependency, depsSet)...)
+		}
+	}
+	return uniqueDeps
+}
+
 type OtherComponentIds struct {
 	Id     string `json:"component_id,omitempty"`
 	Origin int    `json:"origin,omitempty"`

xray/services/scan_test.go

@@ -2,6 +2,8 @@ package services
 
 import (
 	"fmt"
+	"github.com/jfrog/gofrog/datastructures"
+	"github.com/stretchr/testify/assert"
 	"testing"
 )
 
@@ -47,3 +49,32 @@ func TestCreateScanGraphQueryParams(t *testing.T) {
 		})
 	}
 }
+
+func TestFlattenGraph(t *testing.T) {
+	nodeA := &GraphNode{Id: "A"}
+	nodeB := &GraphNode{Id: "B"}
+	nodeC := &GraphNode{Id: "C"}
+	nodeD := &GraphNode{Id: "D"}
+	nodeE := &GraphNode{Id: "E"}
+	nodeF := &GraphNode{Id: "F"}
+
+	// Set dependencies
+	nodeA.Nodes = []*GraphNode{nodeB, nodeC}
+	nodeB.Nodes = []*GraphNode{nodeC, nodeD}
+	nodeC.Nodes = []*GraphNode{nodeD}
+	nodeD.Nodes = []*GraphNode{nodeE, nodeF}
+	nodeF.Nodes = []*GraphNode{nodeA, nodeB, nodeC}
+
+	// Create graph
+	graph := []*GraphNode{nodeA, nodeB, nodeC}
+	flatGraph := FlattenGraph(graph)
+
+	// Check that the graph has been flattened correctly
+	assert.Equal(t, len(flatGraph[0].Nodes), 6)
+	set := datastructures.MakeSet[string]()
+	for _, node := range flatGraph[0].Nodes {
+		assert.Len(t, node.Nodes, 0)
+		assert.False(t, set.Exists(node.Id))
+		set.Add(node.Id)
+	}
+}