Cleanup

Author: dkapil

.classpath

@@ -23,5 +23,22 @@
 			<attribute name="maven.pomderived" value="true"/>
 		</attributes>
 	</classpathentry>
+	<classpathentry kind="src" path="target/generated-sources/annotations">
+		<attributes>
+			<attribute name="optional" value="true"/>
+			<attribute name="maven.pomderived" value="true"/>
+			<attribute name="ignore_optional_problems" value="true"/>
+			<attribute name="m2e-apt" value="true"/>
+		</attributes>
+	</classpathentry>
+	<classpathentry kind="src" output="target/test-classes" path="target/generated-test-sources/test-annotations">
+		<attributes>
+			<attribute name="optional" value="true"/>
+			<attribute name="maven.pomderived" value="true"/>
+			<attribute name="ignore_optional_problems" value="true"/>
+			<attribute name="m2e-apt" value="true"/>
+			<attribute name="test" value="true"/>
+		</attributes>
+	</classpathentry>
 	<classpathentry kind="output" path="target/classes"/>
 </classpath>

.settings/org.eclipse.jdt.apt.core.prefs

@@ -0,0 +1,2 @@
+eclipse.preferences.version=1
+org.eclipse.jdt.apt.aptEnabled=false

.settings/org.eclipse.jdt.core.prefs

@@ -1,6 +1,7 @@
-#Tue May 08 11:52:13 IST 2018
-org.eclipse.jdt.core.compiler.problem.forbiddenReference=warning
-org.eclipse.jdt.core.compiler.codegen.targetPlatform=1.8
 eclipse.preferences.version=1
-org.eclipse.jdt.core.compiler.source=1.8
+org.eclipse.jdt.core.compiler.codegen.targetPlatform=1.8
 org.eclipse.jdt.core.compiler.compliance=1.8
+org.eclipse.jdt.core.compiler.problem.forbiddenReference=warning
+org.eclipse.jdt.core.compiler.processAnnotations=disabled
+org.eclipse.jdt.core.compiler.release=disabled
+org.eclipse.jdt.core.compiler.source=1.8

src/graph/apps/BFS.java

@@ -6,20 +6,17 @@
 import graph.models.Graph;
 import graph.models.Vertex;
 
-// TODO: Auto-generated Javadoc
 /**
- * The Class BFS.
+ * BFS.
  *
- * @param <T>
- *            the generic type
+ * @param <T> the generic type
  */
 public class BFS<T, W> {
 
 	/**
 	 * Search.
 	 *
-	 * @param graph
-	 *            the graph
+	 * @param graph the graph
 	 */
 	public BFS(Graph<T, W> graph) {
 		for (Vertex<T> vertex : graph.getAllVertices()) {
@@ -54,10 +51,8 @@ public BFS(Graph<T, W> graph) {
 	/**
 	 * Prints the path.
 	 *
-	 * @param source
-	 *            the source
-	 * @param target
-	 *            the target
+	 * @param source the source
+	 * @param target the target
 	 */
 	public void printPath(Vertex<T> source, Vertex<T> target) {
 		System.out.println("Printing Path Between " + source + " and " + target);
@@ -68,10 +63,8 @@ public void printPath(Vertex<T> source, Vertex<T> target) {
 	/**
 	 * Prints the.
 	 *
-	 * @param source
-	 *            the source
-	 * @param target
-	 *            the target
+	 * @param source the source
+	 * @param target the target
 	 */
 	private void print(Vertex<T> source, Vertex<T> target) {
 		if (target == source) {

src/graph/apps/DFS.java

@@ -3,12 +3,10 @@
 import graph.models.Graph;
 import graph.models.Vertex;
 
-// TODO: Auto-generated Javadoc
 /**
- * The Class DFS.
+ * The DFS.
  *
- * @param <T>
- *            the generic type
+ * @param <T> the generic type
  */
 public class DFS<T, W> {
 
@@ -17,8 +15,7 @@ public class DFS<T, W> {
 	/**
 	 * Instantiates a new dfs.
 	 *
-	 * @param graph
-	 *            the graph
+	 * @param graph the graph
 	 */
 	public DFS(Graph<T, W> graph) {
 		for (Vertex<T> vertex : graph.getAllVertices()) {
@@ -37,12 +34,9 @@ public DFS(Graph<T, W> graph) {
 	/**
 	 * Visit.
 	 *
-	 * @param graph
-	 *            the graph
-	 * @param u
-	 *            the vertex
-	 * @param time
-	 *            the time
+	 * @param graph the graph
+	 * @param u     the vertex
+	 * @param time  the time
 	 */
 	public void visit(Graph<T, W> graph, Vertex<T> u) {
 		time = time + 1;

src/graph/apps/Kruskal.java

@@ -14,12 +14,23 @@
 import graph.models.Graph;
 import graph.models.Vertex;
 
+/**
+ * Kruskal
+ *
+ * @param <T> the generic type
+ * @param <W> the generic type
+ */
 public class Kruskal<T, W extends Comparable<W>> {
 
 	Graph<T, W> graph;
 
 	Map<Vertex<T>, ForestElement<T>> vertexForestElementMap = new HashMap<>();
 
+	/**
+	 * Build
+	 *
+	 * @param graph the graph
+	 */
 	public void build(Graph<T, W> graph) {
 		DisjointSet<ForestElement<T>> disjointSet = new DisjoinSetForest<>();
 

src/graph/apps/Prim.java

@@ -7,8 +7,18 @@
 import graph.models.Graph;
 import graph.models.Vertex;
 
+/**
+ * Prim
+ *
+ * @param <T> the generic type
+ */
 public class Prim<T> {
 
+	/**
+	 * Build
+	 *
+	 * @param graph the graph
+	 */
 	public void build(Graph<T, Integer> graph) {
 		for (Vertex<T> vertex : graph.getAllVertices()) {
 			vertex.setParent(null);
@@ -40,6 +50,14 @@ public void build(Graph<T, Integer> graph) {
 		}
 	}
 
+	/**
+	 * Weight.
+	 *
+	 * @param graph the graph
+	 * @param u     the u
+	 * @param v     the v
+	 * @return the int
+	 */
 	private int weight(Graph<T, Integer> graph, Vertex<T> u, Vertex<T> v) {
 		return graph.getEdge(u, v).getWeight();
 	}

src/graph/apps/SCC.java

@@ -9,12 +9,10 @@
 import graph.models.Graph;
 import graph.models.Vertex;
 
-// TODO: Auto-generated Javadoc
 /**
- * The Class DFS.
+ * SCC
  *
- * @param <T>
- *            the generic type
+ * @param <T> the generic type
  */
 public class SCC<T, W> {
 
@@ -23,10 +21,9 @@ public class SCC<T, W> {
 	List<LinkedList<Vertex<T>>> sccS = new ArrayList<>();
 
 	/**
-	 * Instantiates a new dfs.
+	 * Instantiates a new scc.
 	 *
-	 * @param graph
-	 *            the graph
+	 * @param graph the graph
 	 */
 	public SCC(Graph<T, W> graph) {
 
@@ -61,13 +58,10 @@ public SCC(Graph<T, W> graph) {
 	/**
 	 * Visit.
 	 *
-	 * @param graphT
-	 *            the graph
-	 * @param u
-	 *            the vertex
+	 * @param graphT the graph
+	 * @param u      the vertex
 	 * @param scc
-	 * @param time
-	 *            the time
+	 * @param time   the time
 	 */
 	public void visit(Graph<T, W> graphT, Vertex<T> u, List<Vertex<T>> scc) {
 		scc.add(u);

src/graph/apps/TopologicalSort.java

@@ -6,9 +6,8 @@
 import graph.models.Graph;
 import graph.models.Vertex;
 
-// TODO: Auto-generated Javadoc
 /**
- * The Class DFS.
+ * Topological Sort
  *
  * @param <T>
  *            the generic type

src/graph/models/Edge.java

@@ -2,14 +2,11 @@
 
 import java.util.Objects;
 
-// TODO: Auto-generated Javadoc
 /**
- * The Class Edge.
+ * The Edge.
  *
- * @param <T>
- *            the generic type
- * @param <W>
- *            the generic type
+ * @param <T> the generic type
+ * @param <W> the generic type
  */
 public class Edge<T, W> {
 
@@ -23,97 +20,42 @@ public class Edge<T, W> {
 
 	int capacity;
 
-	/**
-	 * Gets the source.
-	 *
-	 * @return the source
-	 */
 	public Vertex<T> getSource() {
 		return source;
 	}
 
-	/**
-	 * Sets the source.
-	 *
-	 * @param source
-	 *            the new source
-	 */
 	public void setSource(Vertex<T> source) {
 		this.source = source;
 	}
 
-	/**
-	 * Gets the destination.
-	 *
-	 * @return the destination
-	 */
 	public Vertex<T> getDestination() {
 		return destination;
 	}
 
-	/**
-	 * Sets the destination.
-	 *
-	 * @param destination
-	 *            the new destination
-	 */
 	public void setDestination(Vertex<T> destination) {
 		this.destination = destination;
 	}
 
-	/**
-	 * Gets the weight.
-	 *
-	 * @return the weight
-	 */
 	public W getWeight() {
 		return weight;
 	}
 
-	/**
-	 * Sets the weight.
-	 *
-	 * @param weight
-	 *            the new weight
-	 */
 	public void setWeight(W weight) {
 		this.weight = weight;
 	}
 
-	/**
-	 * Sets the capacity.
-	 *
-	 * @param capacity
-	 *            the new capacity
-	 */
 	public void setCapacity(int capacity) {
 		this.capacity = capacity;
 	}
 
-	/**
-	 * Gets the capacity.
-	 *
-	 * @return the capacity
-	 */
 	public int getCapacity() {
 		return capacity;
 	}
 
-	/**
-	 * Sets the flow.
-	 *
-	 * @param flow
-	 *            the new flow
-	 */
 	public void setFlow(int flow) {
 		this.flow = flow;
 	}
 
-	/**
-	 * Gets the flow.
-	 *
-	 * @return the flow
-	 */
 	public int getFlow() {
 		return flow;
 	}

src/graph/models/GraphList.java

@@ -9,14 +9,11 @@
 import java.util.Map.Entry;
 import java.util.Set;
 
-// TODO: Auto-generated Javadoc
 /**
- * The Class GraphList.
+ * GraphList.
  *
- * @param <T>
- *            the generic type
- * @param <W>
- *            the generic type
+ * @param <T> the generic type
+ * @param <W> the generic type
  */
 public class GraphList<T, W> implements Graph<T, W> {