shhossain · shhossain · Dec 26, 2023 · Dec 1, 2023 · Dec 2, 2023 · Dec 2, 2023
diff --git a/Algorithms/Graphs/Tree Based Algorithms/readme.md b/Algorithms/Graphs/Tree Based Algorithms/readme.md
@@ -1,4 +1,4 @@
 # TREE
-You might be wondering why this data structure is being explained again as it is already present in the data structures directory. That is because this is a special kind of a data structure that can be called as a special form of a graph. A graph containg n nodes and n-1 edges can be called as  a tree provided all the nodes are connected to each other. This is used to solve a variety of different problems especially in competitive programming.
+You might be wondering why this data structure is being explained again as it is already present in the data structures directory. That is because this is a special kind of a data structure that can be called as a special form of a graph. A graph containing n nodes and n-1 edges can be called a tree provided all the nodes are connected to each other. This is used to solve a variety of different problems especially in competitive programming.
 
 
diff --git a/Algorithms/Graphs/graphImages/directedCyclesFlightsGraph.png b/Algorithms/Graphs/graphImages/directedCyclesFlightsGraph.png
diff --git a/Algorithms/Graphs/graphImages/directedFlightsGraph.png b/Algorithms/Graphs/graphImages/directedFlightsGraph.png
diff --git a/Algorithms/Graphs/graphImages/directedTreeFlightsGraph.png b/Algorithms/Graphs/graphImages/directedTreeFlightsGraph.png
diff --git a/Algorithms/Graphs/graphImages/disconnectedFlightsGraph.png b/Algorithms/Graphs/graphImages/disconnectedFlightsGraph.png
diff --git a/Algorithms/Graphs/graphImages/undirectedFlightsGraph.png b/Algorithms/Graphs/graphImages/undirectedFlightsGraph.png
diff --git a/Algorithms/Graphs/graphImages/weightedDirectedFlightsGraph.png b/Algorithms/Graphs/graphImages/weightedDirectedFlightsGraph.png
diff --git a/Algorithms/Graphs/readme.md b/Algorithms/Graphs/readme.md
diff --git a/Algorithms/readme.md b/Algorithms/readme.md
@@ -53,7 +53,7 @@ Graphs are used to model pairwise relations between objects and are the most use
  - Isolated vertex - Has no edges pointing to the vertex, and it has no outgoing edges. Its in-degree and out-degree is zero.
  - Source vertex - Has no edges point to the vertex, its in-degree is zero.
  - Sink vertex - Has no outgoing edges, it’s out-degree is zero.
- - [Articulation Points](Graphs/Articulation%20Points/readme.md) - A vertex that creates an undirected graph if it is removed from the graph..
+ - [Articulation Points](Graphs/Articulation%20Points/readme.md) - A vertex in an undirected graph that would created a disconnected graph if removed.
 
 ### Types of Graphs
 - Undirected Graph - A graph where edges of the graph are two-way paths or relations.