commit 8dc820868cf886719198f401a0e111b8f629d1ac
author Ray Milkey <ray@onlab.us> Fri Feb 20 16:22:38 2015 -0800
committer Gerrit Code Review <gerrit@onlab.us> Sat Feb 21 05:52:36 2015 +0000
tree c504445f76a6012e5d9e9dc9277cb9d7f4a454d4
parent bf23c550f1ea231f9b97196aebb01402c19d8a90

Fix some compiler warnings about unchecked types

Change-Id: Ib360aa05fd0e194a65bbc0b624447e4bdb4ced93

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

diff --git a/utils/misc/src/main/java/org/onlab/graph/KshortestPathSearch.java b/utils/misc/src/main/java/org/onlab/graph/KshortestPathSearch.java
index db8402d..31e2523 100644
--- a/utils/misc/src/main/java/org/onlab/graph/KshortestPathSearch.java
+++ b/utils/misc/src/main/java/org/onlab/graph/KshortestPathSearch.java
@@ -46,7 +46,7 @@
     // Initialize the graph.
     public KshortestPathSearch(Graph<V, E> graph) {
         immutableGraph = graph;
-        mutableGraph = new MutableAdjacencyListsGraph(graph.getVertexes(),
+        mutableGraph = new MutableAdjacencyListsGraph<>(graph.getVertexes(),
                 graph.getEdges());
     }
 
@@ -136,6 +136,7 @@
             }
         }
 
+    @SuppressWarnings({ "rawtypes", "unchecked" })
     private List<E> searchShortestPath(Graph<V, E> graph, V src, V dst) {
         // Determine the shortest path from the source to the destination by using the Dijkstra algorithm.
         DijkstraGraphSearch dijkstraAlg = new DijkstraGraphSearch();