Mostly just fixing typos
Change-Id: If543e9190035016161dfedd51136d66b799b8e26
diff --git a/src/main/java/org/onosproject/segmentrouting/ECMPShortestPathGraph.java b/src/main/java/org/onosproject/segmentrouting/ECMPShortestPathGraph.java
index 2e2041c..e9a59ba 100644
--- a/src/main/java/org/onosproject/segmentrouting/ECMPShortestPathGraph.java
+++ b/src/main/java/org/onosproject/segmentrouting/ECMPShortestPathGraph.java
@@ -31,7 +31,7 @@
/**
* This class creates bandwidth constrained breadth first tree and returns paths
- * from root Device to leaf Devicees which satisfies the bandwidth condition. If
+ * from root Device to leaf Devices which satisfies the bandwidth condition. If
* bandwidth parameter is not specified, the normal breadth first tree will be
* calculated. The paths are snapshot paths at the point of the class
* instantiation.
@@ -281,7 +281,7 @@
* Return the complete info of the computed ECMP paths for each Device
* learned in multiple iterations from the root Device.
*
- * @return the hash table of Devicees learned in multiple Dijkstra
+ * @return the hash table of Devices learned in multiple Dijkstra
* iterations and corresponding ECMP paths to it from the root
* Device
*/
@@ -305,8 +305,8 @@
* Return the complete info of the computed ECMP paths for each Device
* learned in multiple iterations from the root Device.
*
- * @return the hash table of Devicees learned in multiple Dijkstra
- * iterations and corresponding ECMP paths in terms of Devicees to
+ * @return the hash table of Devices learned in multiple Dijkstra
+ * iterations and corresponding ECMP paths in terms of Devices to
* be traversed to it from the root Device
*/
public HashMap<Integer, HashMap<DeviceId,