From e8f78118f081ab5b45003848434fa4778b213b56 Mon Sep 17 00:00:00 2001
From: naveensrinivasan <172697+naveensrinivasan@users.noreply.github.com>
Date: Wed, 21 Aug 2024 20:09:56 -0500
Subject: [PATCH] Fixed the failing test

Signed-off-by: naveensrinivasan <172697+naveensrinivasan@users.noreply.github.com>
---
 pkg/graph/cache_test.go | 4 ----
 1 file changed, 4 deletions(-)

diff --git a/pkg/graph/cache_test.go b/pkg/graph/cache_test.go
index 3799c3f..12d1cf9 100644
--- a/pkg/graph/cache_test.go
+++ b/pkg/graph/cache_test.go
@@ -66,7 +66,6 @@ func TestRandomGraphDependenciesWithControlledCircles(t *testing.T) {
 		}
 
 		// Set random dependencies, allowing controlled circles
-		r := rand.New(rand.NewSource(time.Now().UnixNano()))
 		cycleProbability := 0.01 // 1% chance to create a cycle
 		for i := 0; i < n; i++ {
 			possibleDeps := rand.Perm(n - i)                   // Generate a random permutation of indices [0, min(90, n-i)-1]
@@ -147,9 +146,6 @@ func TestRandomGraphDependenciesNoCircles(t *testing.T) {
 			nodes[i] = node
 		}
 
-		// Set random dependencies, ensuring no duplicates and no backward dependencies
-		r := rand.New(rand.NewSource(time.Now().UnixNano()))
-
 		m := map[int][]int{}
 
 		for i := 0; i < n; i++ {