From d008224669e9b9cd9264c4779f0c660f32b7458b Mon Sep 17 00:00:00 2001 From: Jonas Smedegaard Date: Sun, 20 Apr 2025 19:30:30 +0200 Subject: add minimally commented default constructor to please javadoc --- com/example/portfolio3/GraphAlgorithms.java | 3 +++ com/example/portfolio3/Graphs.java | 19 ++++++++++++++++++- 2 files changed, 21 insertions(+), 1 deletion(-) (limited to 'com') diff --git a/com/example/portfolio3/GraphAlgorithms.java b/com/example/portfolio3/GraphAlgorithms.java index c542689..ce68349 100644 --- a/com/example/portfolio3/GraphAlgorithms.java +++ b/com/example/portfolio3/GraphAlgorithms.java @@ -8,6 +8,9 @@ import java.util.*; /// foo public class GraphAlgorithms { + /// foo + GraphAlgorithms() {} + /// Calculates the length of a path or any other collection of edes /// /// does not require the edges to form a path diff --git a/com/example/portfolio3/Graphs.java b/com/example/portfolio3/Graphs.java index 639c4fd..d1ffc9d 100644 --- a/com/example/portfolio3/Graphs.java +++ b/com/example/portfolio3/Graphs.java @@ -5,7 +5,12 @@ package com.example.portfolio3; import java.util.*; /// foo -public class Graphs {} +public class Graphs { + + /// foo + Graphs() {} + +} /// foo class Vertex{ @@ -90,6 +95,9 @@ interface Graph { /// foo abstract class AbstractGraph implements Graph{ + /// foo + AbstractGraph() {} + /// foo private HashMap vertexMap=new HashMap<>(); @@ -134,6 +142,9 @@ abstract class AbstractGraph implements Graph{ /// EdgeGraph - One big set of all edges in the graph class EdgeGraph extends AbstractGraph { + /// foo + EdgeGraph() {} + /// foo Set edges=new HashSet<>(); @@ -168,6 +179,9 @@ class EdgeGraph extends AbstractGraph { /// foo class AdjListGraph extends AbstractGraph { + /// foo + AdjListGraph() {} + /// foo private Map> outEdge= new HashMap<>(); @@ -210,6 +224,9 @@ class AdjListGraph extends AbstractGraph { /// foo class AdjMapGraph extends AbstractGraph { + /// foo + AdjMapGraph() {} + /// foo private Map> outEdge = new HashMap<>(); -- cgit v1.2.3