Update README.md

README.md

@@ -7,22 +7,22 @@ The graphs in this assignment are **undirected** and **unweighted**:
 
 ### Task 1
 Implement the remaining methods in `AdjacencySet.java`. Methods:
- * `addNode(V node)`
- * `removeNode(V node)`
+ * `addVertice(V vertice)`
+ * `removeVertice(V vertice)`
  * `addEdge(V u, v v)`
  * `removeEdge(V u, V v)`
- * `hasNode(V node)`
+ * `hasVertice(V vertice)`
 
 ✅ Run `AdjacencySetTest` to check your solution. The task is passed if all tests pass.
 
 
 ### Task 2
-An essential part of graph theory is to be able to search through a graph. In this task we want to know whether two nodes `u` and `v` are connected.
+An essential part of graph theory is to be able to search through a graph. In this task we want to know whether two vertices `u` and `v` are connected.
 
 <img align="center" src="images/Lab5_graph.png" width="400"/>
 
-In the graph above `0` and `2` are connected since there is a direct edge between them. `3` and `2` are also connected since there are nodes inbetween that connect them. <br></br>
-While `2` and `5`  are not connected since there are noe edges that directly connect them or any inbetween other nodes.
+In the graph above `0` and `2` are connected since there is a direct edge between them. `3` and `2` are also connected since there are vertices inbetween that connect them. <br></br>
+While `2` and `5`  are not connected since there are no edges that directly connect them or any inbetween other vertices.
 
 **TODO: Implement `GraphSearch::connected`.**