From 5c81924d5c9d57aa0d906be7cc45aef49a1e7c06 Mon Sep 17 00:00:00 2001 From: khanhkhanhlele Date: Wed, 5 Nov 2025 14:37:52 +0700 Subject: [PATCH] Fix typos in src/main/java/com/thealgorithms/datastructures/graphs/MatrixGraphs.java --- .../com/thealgorithms/datastructures/graphs/MatrixGraphs.java | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) 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)) {