diff options
author | Jonas Smedegaard <dr@jones.dk> | 2025-04-20 19:39:42 +0200 |
---|---|---|
committer | Jonas Smedegaard <dr@jones.dk> | 2025-04-20 19:39:42 +0200 |
commit | 79e04705c6eeed95992e5753a8328aad90e02f68 (patch) | |
tree | cc75e2753cf09097d60037f7ba44b4055ba19c42 /com/example/portfolio3/EdgeGraph.java | |
parent | d008224669e9b9cd9264c4779f0c660f32b7458b (diff) |
move each auxiliary class to own file, to please javadoc
Diffstat (limited to 'com/example/portfolio3/EdgeGraph.java')
-rw-r--r-- | com/example/portfolio3/EdgeGraph.java | 37 |
1 files changed, 37 insertions, 0 deletions
diff --git a/com/example/portfolio3/EdgeGraph.java b/com/example/portfolio3/EdgeGraph.java new file mode 100644 index 0000000..ae9cbe9 --- /dev/null +++ b/com/example/portfolio3/EdgeGraph.java @@ -0,0 +1,37 @@ +package com.example.portfolio3; + +// origin: <https://moodle.ruc.dk/course/section.php?id=211877> + +/// EdgeGraph - One big set of all edges in the graph +class EdgeGraph extends AbstractGraph { + + /// foo + EdgeGraph() {} + + /// foo + Set<Edge> edges=new HashSet<>(); + + /// foo + public void insertEdge(Vertex v1,Vertex v2,int w){ + edges.add(new Edge(v1,v2,w)); + } + + /// foo + public Collection<Edge> edges(){return edges;} + + /// foo + public Collection<Edge> outEdge(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){ + // linear in number of edges in the graph + for(Edge e:edges){ + if(e.from()==v1 && e.to()==v2)return e.weight(); + } + return null; + } +} |