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

Format code with prettier (#3375)

Browse Source
This commit is contained in:
acbin
2022-10-03 17:23:00 +08:00
committed by GitHub
parent 32b9b11ed5
commit e96f567bfc
464 changed files with 11483 additions and 6189 deletions
Download Patch File Download Diff File Expand all files Collapse all files

33
src/main/java/com/thealgorithms/others/Dijkstra.java
View File

@@ -31,7 +31,8 @@ public class Dijkstra {
new Graph.Edge("c", "d", 11),
new Graph.Edge("c", "f", 2),
new Graph.Edge("d", "e", 6),
new Graph.Edge("e", "f", 9),};
new Graph.Edge("e", "f", 9),
};
private static final String START = "a";
private static final String END = "e";
@@ -47,6 +48,7 @@ public class Dijkstra {
}
class Graph {
// mapping of vertex names to Vertex objects, built from a set of Edges
private final Map<String, Vertex> graph;
@@ -117,13 +119,23 @@ class Graph {
if (dist != vertex.dist) {
return false;
}
if (name != null ? !name.equals(vertex.name) : vertex.name != null) {
if (
name != null ? !name.equals(vertex.name) : vertex.name != null
) {
return false;
}
if (previous != null ? !previous.equals(vertex.previous) : vertex.previous != null) {
if (
previous != null
? !previous.equals(vertex.previous)
: vertex.previous != null
) {
return false;
}
if (neighbours != null ? !neighbours.equals(vertex.neighbours) : vertex.neighbours != null) {
if (
neighbours != null
? !neighbours.equals(vertex.neighbours)
: vertex.neighbours != null
) {
return false;
}
@@ -136,7 +148,8 @@ class Graph {
result = 31 * result + (name != null ? name.hashCode() : 0);
result = 31 * result + dist;
result = 31 * result + (previous != null ? previous.hashCode() : 0);
result = 31 * result + (neighbours != null ? neighbours.hashCode() : 0);
result =
31 * result + (neighbours != null ? neighbours.hashCode() : 0);
return result;
}
@@ -175,7 +188,10 @@ class Graph {
*/
public void dijkstra(String startName) {
if (!graph.containsKey(startName)) {
System.err.printf("Graph doesn't contain start vertex \"%s\"%n", startName);
System.err.printf(
"Graph doesn't contain start vertex \"%s\"%n",
startName
);
return;
}
final Vertex source = graph.get(startName);
@@ -222,7 +238,10 @@ class Graph {
*/
public void printPath(String endName) {
if (!graph.containsKey(endName)) {
System.err.printf("Graph doesn't contain end vertex \"%s\"%n", endName);
System.err.printf(
"Graph doesn't contain end vertex \"%s\"%n",
endName
);
return;
}