set methods final to avoid uncertain subclassing

1 files changed, 4 insertions, 4 deletions

diff --git a/src/com.example.portfolio3/com/example/portfolio3/AdjListGraph.java b/src/com.example.portfolio3/com/example/portfolio3/AdjListGraph.java
index f90172e..f6e1130 100644
--- a/src/com.example.portfolio3/com/example/portfolio3/AdjListGraph.java
+++ b/src/com.example.portfolio3/com/example/portfolio3/AdjListGraph.java
@@ -18,7 +18,7 @@ public class AdjListGraph extends AbstractGraph {
 	private Map<Vertex,Set<Edge>> outEdge = new HashMap<>();
 
 	/// 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) {
 		Edge e = new Edge(v1, v2, w);
 		if (!outEdge.containsKey(e.from())) {
 			outEdge.put(e.from(), new HashSet<Edge>());
@@ -27,7 +27,7 @@ public class AdjListGraph extends AbstractGraph {
 	}
 
 	/// foo
-	public Collection<Edge> edges() {
+	public final Collection<Edge> edges() {
 		Set<Edge> edges = new HashSet<>();
 		for (Vertex v: outEdge.keySet()) {
 			edges.addAll(outEdge.get(v));
@@ -37,7 +37,7 @@ public class AdjListGraph extends AbstractGraph {
 	}
 
 	/// foo
-	public Collection<Edge> outEdge(final Vertex v) {
+	public final Collection<Edge> outEdge(final Vertex v) {
 		if (!outEdge.containsKey(v)) {
 			return new HashSet<Edge>();
 		}
@@ -46,7 +46,7 @@ public class AdjListGraph extends AbstractGraph {
 	}
 
 	/// foo
-	public Integer getWeight(final Vertex v1, final Vertex v2) {
+	public final Integer getWeight(final Vertex v1, final Vertex v2) {
 
 		// linear in number of outedges from vertices
 		if (!outEdge.containsKey(v1)) {