Removed some warnings

Author: William Fiset

src/test/java/com/williamfiset/algorithms/datastructures/fibonacciheap/FibonacciHeapTest.java

@@ -96,7 +96,7 @@ public void returnsOrderedItemsFromRandomInsert() {
     final List<Integer> expected = new ArrayList<Integer>();
 
     for (int i = 0; i < 1000; i++) {
-      Integer number = new Integer(r.nextInt(10000));
+      Integer number = r.nextInt(10000);
       expected.add(number);
       queue.add(number);
     }
@@ -134,7 +134,7 @@ public void addAllAndContinsItem() {
   public void clearQueue() {
     final Random r = new Random(System.currentTimeMillis());
     for (int i = 0; i < 1000; i++) {
-      Integer number = new Integer(r.nextInt(10000));
+      Integer number = r.nextInt(10000);
       queue.add(number);
     }
 

src/test/java/com/williamfiset/algorithms/graphtheory/BridgesAdjacencyListIterativeTest.java

@@ -109,7 +109,7 @@ public void testGraphInSlides() {
     List<Integer> bridges = solver.findBridges();
     List<Pair<Integer, Integer>> sortedBridges = getSortedBridges(solver.findBridges());
 
-    List<Pair> expected = ImmutableList.of(Pair.of(2, 3), Pair.of(3, 4), Pair.of(2, 5));
+    List<Pair<Integer, Integer>> expected = ImmutableList.of(Pair.of(2, 3), Pair.of(3, 4), Pair.of(2, 5));
 
     assertThat(sortedBridges).containsExactlyElementsIn(expected);
   }
@@ -133,7 +133,7 @@ public void testDisconnectedGraph() {
     BridgesAdjacencyList solver = new BridgesAdjacencyList(graph, n);
     List<Pair<Integer, Integer>> sortedBridges = getSortedBridges(solver.findBridges());
 
-    List<Pair> expected =
+    List<Pair<Integer, Integer>> expected =
         ImmutableList.of(
             Pair.of(0, 1),
             Pair.of(1, 2),
@@ -150,7 +150,7 @@ private static List<Pair<Integer, Integer>> getSortedBridges(List<Integer> bridg
     for (int i = 0; i < bridgeNodes.size(); i += 2) {
       int node1 = bridgeNodes.get(i);
       int node2 = bridgeNodes.get(i + 1);
-      Pair pair;
+      Pair<Integer, Integer> pair;
       if (node1 < node2) {
         pair = Pair.of(node1, node2);
       } else {