diff options
author | Jonas Smedegaard <dr@jones.dk> | 2025-04-21 11:27:58 +0200 |
---|---|---|
committer | Jonas Smedegaard <dr@jones.dk> | 2025-04-21 13:58:38 +0200 |
commit | 015142523902d387a9755c0c113433c818ddcbfe (patch) | |
tree | 62136bee312a5dd62ee79b87407ca90a8e9ae1c9 | |
parent | 67ff2ddc41b9b97b64d2ffde6d1674203be22d07 (diff) |
make some classes public, to permit reuse
-rw-r--r-- | com/example/portfolio3/AdjListGraph.java | 4 | ||||
-rw-r--r-- | com/example/portfolio3/Graph.java | 2 | ||||
-rw-r--r-- | com/example/portfolio3/GraphAlgorithms.java | 2 | ||||
-rw-r--r-- | com/example/portfolio3/MatrixGraph.java | 4 | ||||
-rw-r--r-- | com/example/portfolio3/Vertex.java | 2 |
5 files changed, 7 insertions, 7 deletions
diff --git a/com/example/portfolio3/AdjListGraph.java b/com/example/portfolio3/AdjListGraph.java index 416f646..a677d3e 100644 --- a/com/example/portfolio3/AdjListGraph.java +++ b/com/example/portfolio3/AdjListGraph.java @@ -5,10 +5,10 @@ package com.example.portfolio3; import java.util.*; /// Adjecency List Graph - A map from vertices to set of outedges from the vertex -class AdjListGraph extends AbstractGraph { +public class AdjListGraph extends AbstractGraph { /// foo - AdjListGraph() {} + public AdjListGraph() {} /// foo private Map<Vertex,Set<Edge>> outEdge= new HashMap<>(); diff --git a/com/example/portfolio3/Graph.java b/com/example/portfolio3/Graph.java index 750f996..6e58029 100644 --- a/com/example/portfolio3/Graph.java +++ b/com/example/portfolio3/Graph.java @@ -5,7 +5,7 @@ package com.example.portfolio3; import java.util.*; /// foo -interface Graph { +public interface Graph { /// foo /// @param v foo diff --git a/com/example/portfolio3/GraphAlgorithms.java b/com/example/portfolio3/GraphAlgorithms.java index ce68349..3be7c70 100644 --- a/com/example/portfolio3/GraphAlgorithms.java +++ b/com/example/portfolio3/GraphAlgorithms.java @@ -287,7 +287,7 @@ public class GraphAlgorithms { /// foo /// @param g foo - static void printGraph(Graph g) { + public static void printGraph(Graph g) { for(Vertex v: sortVertex(g.vertices())) { System.out.println(v.toString()); for(Edge e:sortEdgesTo(g.outEdge(v))) diff --git a/com/example/portfolio3/MatrixGraph.java b/com/example/portfolio3/MatrixGraph.java index f3a5bde..29005b7 100644 --- a/com/example/portfolio3/MatrixGraph.java +++ b/com/example/portfolio3/MatrixGraph.java @@ -5,7 +5,7 @@ package com.example.portfolio3; import java.util.*; /// Matrix Graph: weights are stored in a twodimensional array -class MatrixGraph extends AbstractGraph { +public class MatrixGraph extends AbstractGraph { /// foo private Integer[][] matrix=null; // made in constructor @@ -22,7 +22,7 @@ class MatrixGraph extends AbstractGraph { /// foo /// @param numVertex maximum number of vertices allowed - MatrixGraph(int numVertex){ + public MatrixGraph(int numVertex){ this.numVertex=numVertex; matrix =new Integer[numVertex][numVertex]; index2vertex=new Vertex[numVertex]; diff --git a/com/example/portfolio3/Vertex.java b/com/example/portfolio3/Vertex.java index efc739c..9881159 100644 --- a/com/example/portfolio3/Vertex.java +++ b/com/example/portfolio3/Vertex.java @@ -5,7 +5,7 @@ package com.example.portfolio3; import java.util.*; /// foo -class Vertex{ +public class Vertex{ /// foo private String name; |