From a5c3599d7bc7a9ef5583ad2d50a55975f030fbea Mon Sep 17 00:00:00 2001
From: Jonas Smedegaard <dr@jones.dk>
Date: Tue, 29 Apr 2025 06:03:56 +0200
Subject: declare variables final when possible

---
 src/com.example.portfolio3/com/example/portfolio3/AdjListGraph.java | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

(limited to 'src/com.example.portfolio3/com/example/portfolio3/AdjListGraph.java')

diff --git a/src/com.example.portfolio3/com/example/portfolio3/AdjListGraph.java b/src/com.example.portfolio3/com/example/portfolio3/AdjListGraph.java
index babaaaa..765eeca 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(Vertex v1,Vertex v2,int w){
+  public 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>());
@@ -33,14 +33,14 @@ public class AdjListGraph extends AbstractGraph {
   }
 
   /// foo
-  public Collection<Edge> outEdge(Vertex v){
+  public Collection<Edge> outEdge(final Vertex v){
     if(!outEdge.containsKey(v))
       return new HashSet<Edge>();
     return outEdge.get(v);
   }
 
   /// foo
-  public Integer getWeight(Vertex v1,Vertex v2){
+  public Integer getWeight(final Vertex v1, final Vertex v2){
     // linear in number of outedges from vertices
     if(!outEdge.containsKey(v1))return null;
     for(Edge e:outEdge.get(v1)){
-- 
cgit v1.2.3