commit b68bbbc5ac58caf5199b78a6250abd226c92f108
author Ray Milkey <ray@opennetworking.org> Mon Dec 18 10:05:49 2017 -0800
committer Thomas Vachuska <tom@opennetworking.org> Tue Dec 19 17:58:54 2017 +0000
tree 75f0642190cb160d25c7bc279c959abbb69e799e
parent 9922d5cd64d786e508c9e5c3e073e32613ba0a10

Sonar suggestion - use a secure random number generator

Change-Id: I28075845555bcbc384a49e07353b3192c413b8f7

utils/misc/src/main/java/org/onlab/graph/SrlgGraphSearch.java

diff --git a/utils/misc/src/main/java/org/onlab/graph/SrlgGraphSearch.java b/utils/misc/src/main/java/org/onlab/graph/SrlgGraphSearch.java
index d455c64..46a7cab 100644
--- a/utils/misc/src/main/java/org/onlab/graph/SrlgGraphSearch.java
+++ b/utils/misc/src/main/java/org/onlab/graph/SrlgGraphSearch.java
@@ -18,13 +18,13 @@
 package org.onlab.graph;
 
 
+import java.security.SecureRandom;
 import java.util.Map;
 import java.util.List;
 import java.util.HashMap;
 import java.util.HashSet;
-import java.util.Set;
 import java.util.Random;
-
+import java.util.Set;
 
 /**
  * SRLG Graph Search finds a pair of paths with disjoint risk groups; i.e
@@ -171,7 +171,7 @@
 
         boolean[] subset;
         boolean[] not;
-        Random r = new Random();
+        Random r = new SecureRandom();
 
         /**
          * Creates a Subset from the given subset array.