diff --git a/src/main/java/com/thealgorithms/datastructures/graphs/MatrixGraphs.java b/src/main/java/com/thealgorithms/datastructures/graphs/MatrixGraphs.java
index c1d47df457da..a54b0b75e4dc 100644
--- a/src/main/java/com/thealgorithms/datastructures/graphs/MatrixGraphs.java
+++ b/src/main/java/com/thealgorithms/datastructures/graphs/MatrixGraphs.java
@@ -141,7 +141,7 @@ private int[][] adjacency() {
      *
      * @param from the parent vertex to check for adjacency
      * @param to the child vertex to check for adjacency
-     * @return whether or not the vertices are adjancent
+     * @return whether or not the vertices are adjacent
      */
     private boolean adjacencyOfEdgeDoesExist(int from, int to) {
         return (this.adjacency()[from][to] != AdjacencyMatrixGraph.EDGE_NONE);
@@ -162,7 +162,7 @@ public boolean vertexDoesExist(int aVertex) {
      *
      * @param from the parent vertex to check for adjacency
      * @param to the child vertex to check for adjacency
-     * @return whether or not the vertices are adjancent
+     * @return whether or not the vertices are adjacent
      */
     public boolean edgeDoesExist(int from, int to) {
         if (this.vertexDoesExist(from) && this.vertexDoesExist(to)) {