diff options
author | Jonas Smedegaard <dr@jones.dk> | 2025-04-29 06:03:56 +0200 |
---|---|---|
committer | Jonas Smedegaard <dr@jones.dk> | 2025-04-29 06:11:41 +0200 |
commit | a5c3599d7bc7a9ef5583ad2d50a55975f030fbea (patch) | |
tree | db4ed74e48997d4b4450148116a9c990978a1641 /src/com.example.portfolio3/com/example/portfolio3/EdgeGraph.java | |
parent | 03d2d06e8f5bfadd79912efb94e8931e54296735 (diff) |
declare variables final when possible
Diffstat (limited to 'src/com.example.portfolio3/com/example/portfolio3/EdgeGraph.java')
-rw-r--r-- | src/com.example.portfolio3/com/example/portfolio3/EdgeGraph.java | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/src/com.example.portfolio3/com/example/portfolio3/EdgeGraph.java b/src/com.example.portfolio3/com/example/portfolio3/EdgeGraph.java index 22cfe87..979b118 100644 --- a/src/com.example.portfolio3/com/example/portfolio3/EdgeGraph.java +++ b/src/com.example.portfolio3/com/example/portfolio3/EdgeGraph.java @@ -17,7 +17,7 @@ class EdgeGraph extends AbstractGraph { Set<Edge> edges=new HashSet<>(); /// foo - public void insertEdge(Vertex v1,Vertex v2,int w){ + public void insertEdge(final Vertex v1, final Vertex v2, final int w){ edges.add(new Edge(v1,v2,w)); } @@ -25,14 +25,14 @@ class EdgeGraph extends AbstractGraph { public Collection<Edge> edges(){return edges;} /// foo - public Collection<Edge> outEdge(Vertex v){ + public Collection<Edge> outEdge(final Vertex v){ ArrayList<Edge> outEdge=new ArrayList<>(); for(Edge e:edges)if(e.from()==v)outEdge.add(e); return outEdge; } /// foo - public Integer getWeight(Vertex v1,Vertex v2){ + public Integer getWeight(final Vertex v1, final Vertex v2){ // linear in number of edges in the graph for(Edge e:edges){ if(e.from()==v1 && e.to()==v2)return e.weight(); |