algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-27 06:23:08 +08:00
Code Issues Packages Projects Releases Wiki Activity

style: enable LocalVariableName in CheckStyle (#5191)

Browse Source 
* style: enable LocalVariableName in checkstyle

* Removed minor bug

* Resolved Method Name Bug

* Changed names according to suggestions
This commit is contained in:
S. Utkarsh
2024-05-28 23:59:28 +05:30
committed by GitHub
parent 81cb09b1f8
commit 25d711c5d8
45 changed files with 418 additions and 417 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
src/main/java/com/thealgorithms/datastructures/graphs/BipartiteGrapfDFS.java
View File

@ -54,23 +54,23 @@ public final class BipartiteGrapfDFS {
BufferedReader read = new BufferedReader(new InputStreamReader(System.in));
int t = Integer.parseInt(read.readLine().trim());
while (t-- > 0) {
String[] S = read.readLine().trim().split(" ");
int V = Integer.parseInt(S[0]);
int E = Integer.parseInt(S[1]);
String[] str1 = read.readLine().trim().split(" ");
int numVertices = Integer.parseInt(str1[0]);
int numEdges = Integer.parseInt(str1[1]);
ArrayList<ArrayList<Integer>> adj = new ArrayList<>();
for (int i = 0; i < V; i++) {
for (int i = 0; i < numVertices; i++) {
adj.add(new ArrayList<>());
}
for (int i = 0; i < E; i++) {
String[] s = read.readLine().trim().split(" ");
int u = Integer.parseInt(s[0]);
int v = Integer.parseInt(s[1]);
adj.get(u).add(v);
adj.get(v).add(u);
for (int i = 0; i < numEdges; i++) {
String[] str2 = read.readLine().trim().split(" ");
int vertexU = Integer.parseInt(str2[0]);
int vertexV = Integer.parseInt(str2[1]);
adj.get(vertexU).add(vertexV);
adj.get(vertexV).add(vertexU);
}
boolean ans = isBipartite(V, adj);
boolean ans = isBipartite(numVertices, adj);
if (ans) {
System.out.println("YES");
} else {

20
src/main/java/com/thealgorithms/datastructures/graphs/DIJSKSTRAS_ALGORITHM.java
View File

@ -8,18 +8,18 @@ class dijkstras {
int k = 9;
int minDist(int[] dist, Boolean[] Set) {
int minDist(int[] dist, Boolean[] set) {
int min = Integer.MAX_VALUE;
int min_index = -1;
int minIndex = -1;
for (int r = 0; r < k; r++) {
if (!Set[r] && dist[r] <= min) {
if (!set[r] && dist[r] <= min) {
min = dist[r];
min_index = r;
minIndex = r;
}
}
return min_index;
return minIndex;
}
void print(int[] dist) {
@ -31,22 +31,22 @@ class dijkstras {
void dijkstra(int[][] graph, int src) {
int[] dist = new int[k];
Boolean[] Set = new Boolean[k];
Boolean[] set = new Boolean[k];
for (int i = 0; i < k; i++) {
dist[i] = Integer.MAX_VALUE;
Set[i] = Boolean.FALSE;
set[i] = Boolean.FALSE;
}
dist[src] = 0;
for (int c = 0; c < k - 1; c++) {
int u = minDist(dist, Set);
int u = minDist(dist, set);
Set[u] = Boolean.TRUE;
set[u] = Boolean.TRUE;
for (int v = 0; v < k; v++) {
if (!Set[v] && graph[u][v] != 0 && dist[u] != Integer.MAX_VALUE && dist[u] + graph[u][v] < dist[v]) {
if (!set[v] && graph[u][v] != 0 && dist[u] != Integer.MAX_VALUE && dist[u] + graph[u][v] < dist[v]) {
dist[v] = dist[u] + graph[u][v];
}
}

6
src/main/java/com/thealgorithms/datastructures/graphs/PrimMST.java
View File

@ -15,16 +15,16 @@ class PrimMST {
int minKey(int[] key, Boolean[] mstSet) {
// Initialize min value
int min = Integer.MAX_VALUE;
int min_index = -1;
int minIndex = -1;
for (int v = 0; v < V; v++) {
if (!mstSet[v] && key[v] < min) {
min = key[v];
min_index = v;
minIndex = v;
}
}
return min_index;
return minIndex;
}
// A utility function to print the constructed MST stored in