I want to implement the dijkstra algorithm and have to set each note at the beginning to infinity.
I would like to know, if there is any function in Java which makes it easy.
Asked
Active
Viewed 221 times
-1
-
2First show us what you have implemented. – kk. Jun 08 '17 at 12:40
-
1If you're talking about distance, simply take -1. A valid distance can't be <1 so you can easily identify -1 as "unseen". – Felix Jun 08 '17 at 12:42
-
Or use `null` and store all distance in `Long` objects – OneCricketeer Jun 08 '17 at 12:45
-
@rollback In dijkstra, we initialize the distance array with positive infinity. – Sanket Makani Jun 08 '17 at 12:46
1 Answers
1
Double.POSITIVE_INFINITY if you are using Double to store your data.
Also note that this is not a number, which is nice depending on what you want to do. Double supports this concept.
Demogorii
- 656
- 5
- 16