mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-12-19 07:00:35 +08:00
style: enable MultipleVariableDeclarations in checkstyle (#5175)
Co-authored-by: vaibhav <vaibhav.waghmare@techprescient.com>
This commit is contained in:
@@ -63,7 +63,8 @@ class Graph {
|
||||
*/
|
||||
public static class Edge {
|
||||
|
||||
public final String v1, v2;
|
||||
public final String v1;
|
||||
public final String v2;
|
||||
public final int dist;
|
||||
|
||||
Edge(String v1, String v2, int dist) {
|
||||
@@ -198,7 +199,8 @@ class Graph {
|
||||
* Implementation of dijkstra's algorithm using a binary heap.
|
||||
*/
|
||||
private void dijkstra(final NavigableSet<Vertex> q) {
|
||||
Vertex u, v;
|
||||
Vertex u;
|
||||
Vertex v;
|
||||
while (!q.isEmpty()) {
|
||||
// vertex with shortest distance (first iteration will return source)
|
||||
u = q.pollFirst();
|
||||
|
||||
Reference in New Issue
Block a user