FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
java/graph-algorithms/Dijkstra.java at master · AllAlgorithms/java · GitHub
Uh oh!
There was an error while loading.
Please reload this page
.
This repository was archived by the owner on Sep 7, 2025. It is now read-only.
AllAlgorithms
/
java
Public archive
Notifications
You must be signed in to change notification settings
Fork
83
Star
116
Code
Issues
3
Pull requests
6
Actions
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Security and quality
Insights
Expand file tree
Breadcrumbs
java
/
graph-algorithms
/
Dijkstra.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
141 lines (126 loc) · 4.4 KB
Breadcrumbs
java
/
graph-algorithms
/
Dijkstra.java
Copy path
File metadata and controls
141 lines (126 loc) · 4.4 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
import
java
.
util
.
HashSet
;
import
java
.
util
.
InputMismatchException
;
import
java
.
util
.
LinkedList
;
import
java
.
util
.
Queue
;
import
java
.
util
.
Scanner
;
import
java
.
util
.
Set
;
public
class
DijkstraQueue
{
private
int
distances
[];
private
Queue
<
Integer
>
queue
;
private
Set
<
Integer
>
settled
;
private
int
number_of_nodes
;
private
int
adjacencyMatrix
[][];
public
DijkstraQueue
(
int
number_of_nodes
)
{
this
.
number_of_nodes
=
number_of_nodes
;
distances
=
new
int
[
number_of_nodes
+
1
];
settled
=
new
HashSet
<
Integer
>();
queue
=
new
LinkedList
<
Integer
>();
adjacencyMatrix
=
new
int
[
number_of_nodes
+
1
][
number_of_nodes
+
1
];
}
public
void
dijkstra_algorithm
(
int
adjacency_matrix
[][],
int
source
)
{
int
evaluationNode
;
for
(
int
i
=
1
;
i
<=
number_of_nodes
;
i
++)
for
(
int
j
=
1
;
j
<=
number_of_nodes
;
j
++)
adjacencyMatrix
[
i
][
j
] =
adjacency_matrix
[
i
][
j
];
for
(
int
i
=
1
;
i
<=
number_of_nodes
;
i
++)
{
distances
[
i
] =
Integer
.
MAX_VALUE
;
}
queue
.
add
(
source
);
distances
[
source
] =
0
;
while
(!
queue
.
isEmpty
())
{
evaluationNode
=
getNodeWithMinimumDistanceFromQueue
();
settled
.
add
(
evaluationNode
);
evaluateNeighbours
(
evaluationNode
);
}
}
private
int
getNodeWithMinimumDistanceFromQueue
()
{
int
min
;
int
node
=
0
;
Iterator
<
Integer
>
iterator
=
queue
.
iterator
();
node
=
iterator
.
next
();
min
=
distances
[
node
];
for
(
int
i
=
1
;
i
<=
distances
.
length
;
i
++)
{
if
(
queue
.
contains
(
i
))
{
if
(
distances
[
i
] <=
min
)
{
min
=
distances
[
i
];
node
=
i
;
}
}
}
queue
.
remove
(
node
);
return
node
;
}
private
void
evaluateNeighbours
(
int
evaluationNode
)
{
int
edgeDistance
= -
1
;
int
newDistance
= -
1
;
for
(
int
destinationNode
=
1
;
destinationNode
<=
number_of_nodes
;
destinationNode
++)
{
if
(!
settled
.
contains
(
destinationNode
))
{
if
(
adjacencyMatrix
[
evaluationNode
][
destinationNode
] !=
Integer
.
MAX_VALUE
)
{
edgeDistance
=
adjacencyMatrix
[
evaluationNode
][
destinationNode
];
newDistance
=
distances
[
evaluationNode
] +
edgeDistance
;
if
(
newDistance
<
distances
[
destinationNode
])
{
distances
[
destinationNode
] =
newDistance
;
}
queue
.
add
(
destinationNode
);
}
}
}
}
public
static
void
main
(
String
...
arg
)
{
int
adjacency_matrix
[][];
int
number_of_vertices
;
int
source
=
0
;
Scanner
scan
=
new
Scanner
(
System
.
in
);
try
{
System
.
out
.
println
(
"Enter the number of vertices"
);
number_of_vertices
=
scan
.
nextInt
();
adjacency_matrix
=
new
int
[
number_of_vertices
+
1
][
number_of_vertices
+
1
];
System
.
out
.
println
(
"Enter the Weighted Matrix for the graph"
);
for
(
int
i
=
1
;
i
<=
number_of_vertices
;
i
++)
{
for
(
int
j
=
1
;
j
<=
number_of_vertices
;
j
++)
{
adjacency_matrix
[
i
][
j
] =
scan
.
nextInt
();
if
(
i
==
j
)
{
adjacency_matrix
[
i
][
j
] =
0
;
continue
;
}
if
(
adjacency_matrix
[
i
][
j
] ==
0
)
{
adjacency_matrix
[
i
][
j
] =
Integer
.
MAX_VALUE
;
}
}
}
System
.
out
.
println
(
"Enter the source "
);
source
=
scan
.
nextInt
();
DijkstraQueue
dijkstrasQueue
=
new
DijkstraQueue
(
number_of_vertices
);
dijkstrasQueue
.
dijkstra_algorithm
(
adjacency_matrix
,
source
);
System
.
out
.
println
(
"The Shorted Path to all nodes are "
);
for
(
int
i
=
1
;
i
<=
dijkstrasQueue
.
distances
.
length
-
1
;
i
++)
{
System
.
out
.
println
(
source
+
" to "
+
i
+
" is "
+
dijkstrasQueue
.
distances
[
i
]);
}
}
catch
(
InputMismatchException
inputMismatch
)
{
System
.
out
.
println
(
"Wrong Input Format"
);
}
scan
.
close
();
}
}
Back
|
FazBrowse Home
|
New Git URL