githubwzk
diff --git a/‎data_structures/Graphs/Graphs.java
Lines changed: 7 additions & 0 deletions b/‎data_structures/Graphs/Graphs.java
Lines changed: 7 additions & 0 deletions
diff --git a/‎data_structures/Graphs/makefile
Lines changed: 0 additions & 3 deletions b/‎data_structures/Graphs/makefile
Lines changed: 0 additions & 3 deletions
@@ -42,6 +42,9 @@ public boolean removeAdjacentVertex(E to) {
     }
 
     /**
+     * this method removes an edge from the graph between two specified
+     * verticies
+     *
      * @param from the data of the vertex the edge is from
      * @param to the data of the vertex the edge is going to
      * @return returns false if the edge doesn't exist, returns true if the edge exists and is removed
@@ -58,6 +61,9 @@ public boolean removeEdge(E from, E to) {
         return fromV.removeAdjacentVertex(to);
     }
     /**
+     * this method adds an edge to the graph between two specified
+     * verticies 
+     *
      * @param from the data of the vertex the edge is from
      * @param to the data of the vertex the edge is going to
      * @return returns true if the edge did not exist, return false if it already did
@@ -84,6 +90,7 @@ public boolean addEdge(E from, E to) {
     }
 
     /**
+     * this gives a list of verticies in the graph and their adjacencies
      * 
      * @return returns a string describing this graph
      */
Original file line number	Diff line number	Diff line change
`@@ -42,6 +42,9 @@ public boolean removeAdjacentVertex(E to) {`
`42`	`42`	`}`
`43`	`43`
`44`	`44`	`/**`
	`45`	`+ * this method removes an edge from the graph between two specified`
	`46`	`+ * verticies`
	`47`	`+ *`
`45`	`48`	`* @param from the data of the vertex the edge is from`
`46`	`49`	`* @param to the data of the vertex the edge is going to`
`47`	`50`	`* @return returns false if the edge doesn't exist, returns true if the edge exists and is removed`
`@@ -58,6 +61,9 @@ public boolean removeEdge(E from, E to) {`
`58`	`61`	`return fromV.removeAdjacentVertex(to);`
`59`	`62`	`}`
`60`	`63`	`/**`
	`64`	`+ * this method adds an edge to the graph between two specified`
	`65`	`+ * verticies`
	`66`	`+ *`
`61`	`67`	`* @param from the data of the vertex the edge is from`
`62`	`68`	`* @param to the data of the vertex the edge is going to`
`63`	`69`	`* @return returns true if the edge did not exist, return false if it already did`
`@@ -84,6 +90,7 @@ public boolean addEdge(E from, E to) {`
`84`	`90`	`}`
`85`	`91`
`86`	`92`	`/**`
	`93`	`+ * this gives a list of verticies in the graph and their adjacencies`
`87`	`94`	`*`
`88`	`95`	`* @return returns a string describing this graph`
`89`	`96`	`*/`