set methods final to avoid uncertain subclassing

1 files changed, 4 insertions, 4 deletions

diff --git a/src/com.example.portfolio3/com/example/portfolio3/MatrixGraph.java b/src/com.example.portfolio3/com/example/portfolio3/MatrixGraph.java
index 67c095e..463bf8d 100644
--- a/src/com.example.portfolio3/com/example/portfolio3/MatrixGraph.java
+++ b/src/com.example.portfolio3/com/example/portfolio3/MatrixGraph.java
@@ -51,12 +51,12 @@ public class MatrixGraph extends AbstractGraph {
 	}
 
 	/// foo
-	public void insertEdge(final Vertex v1, final Vertex v2, final int w) {
+	public final void insertEdge(final Vertex v1, final Vertex v2, final int w) {
 		matrix[getIndex(v1)][getIndex(v2)] = w;
 	}
 
 	/// foo
-	public Collection<Edge> edges() {
+	public final Collection<Edge> edges() {
 		HashSet<Edge> edges = new HashSet<>();
 		for (int i = 0; i < numVertex; i++) {
 			for (int j = 0; j < numVertex; j++) {
@@ -72,7 +72,7 @@ public class MatrixGraph extends AbstractGraph {
 	}
 
 	/// foo
-	public Collection<Edge> outEdge(final Vertex v1) {
+	public final Collection<Edge> outEdge(final Vertex v1) {
 		HashSet<Edge> edges = new HashSet<>();
 		int i = vertex2index.get(v1);
 		for (int j = 0; j < numVertex; j++) {
@@ -87,7 +87,7 @@ public class MatrixGraph extends AbstractGraph {
 	}
 
 	/// foo
-	public Integer getWeight(final Vertex v1, final Vertex v2) {
+	public final Integer getWeight(final Vertex v1, final Vertex v2) {
 
 		// constant time operation
 		return matrix[vertex2index.get(v1)][vertex2index.get(v2)];