Fix package declarations (#2576)

DataStructures/Graphs/A_Star.java

@@ -2,9 +2,8 @@
 	Time Complexity = O(E), where E is equal to the number of edges
 */
 
-package Graphs;
+package DataStructures.Graphs;
 
-import java.lang.reflect.Array;
 import java.util.*;
 
 public class A_Star {

DataStructures/Graphs/DIJSKSTRAS_ALGORITHM.java

@@ -4,9 +4,6 @@ for better understanding
 */
 package DataStructures.Graphs;
 
-import java.util.*;
-import java.io.*;
-
 class dijkstras{
 
     int k=9;

DataStructures/Graphs/KahnsAlgorithm.java

@@ -1,4 +1,4 @@
-package Graphs;
+package DataStructures.Graphs;
 
 import java.util.ArrayList;
 import java.util.Map;
@@ -104,7 +104,6 @@ class TopologicalSort<E extends Comparable<E>>{
      */
     ArrayList<E> topSortOrder(){
         calculateInDegree();
-        int count = 0;
         Queue<E> q = new LinkedList<E>();
         
         for(E vertex: inDegree.keySet()){

DataStructures/Graphs/Kruskal.java

@@ -1,3 +1,5 @@
+package DataStructures.Graphs;
+
 // Problem -> Connect all the edges with the minimum cost.
 // Possible Solution -> Kruskal Algorithm (KA), KA finds the minimum-spanning-tree, which means, the
 // group of edges with the minimum sum of their weights that connect the whole graph.