algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2026-03-13 08:40:43 +08:00
Code Issues Packages Projects Releases Wiki Activity

style: include OCP_OVERLY_CONCRETE_PARAMETER (#5833)

Browse Source
This commit is contained in:
Piotr Idzik
2024-10-14 22:46:28 +02:00
committed by GitHub
parent 3af4cfd7c8
commit 8886e0996a
28 changed files with 46 additions and 33 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
src/main/java/com/thealgorithms/datastructures/graphs/AStar.java
View File

@@ -94,7 +94,7 @@ public final class AStar {
}
// Initializes the graph with edges defined in the input data
static void initializeGraph(Graph graph, ArrayList<Integer> data) {
static void initializeGraph(Graph graph, List<Integer> data) {
for (int i = 0; i < data.size(); i += 4) {
graph.addEdge(new Edge(data.get(i), data.get(i + 1), data.get(i + 2)));
}

2
src/main/java/com/thealgorithms/datastructures/graphs/EdmondsBlossomAlgorithm.java
View File

@@ -30,7 +30,7 @@ public final class EdmondsBlossomAlgorithm {
* @param vertexCount The number of vertices in the graph.
* @return A list of matched pairs of vertices.
*/
public static List<int[]> maximumMatching(List<int[]> edges, int vertexCount) {
public static List<int[]> maximumMatching(Iterable<int[]> edges, int vertexCount) {
List<List<Integer>> graph = new ArrayList<>(vertexCount);
// Initialize each vertex's adjacency list.