New Dijkstra's algorithm with better comments. #559
Closed
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
fixed bug in method gcd(int, int)
Add method for minimum number of coins required for given amount
Removing the Travis CI badge as it points to a dead URL. As this repository has [very few tests](https://github.com/TheAlgorithms/Java/search?q=Test&unscoped_q=Test), maybe a CI build might be a bit too much.
Remove Tracis CI badge from README.md
Bring fileName into correspondence with className which is marked as public
className is error
source coding is a little complex
Added MatrixFastPower.java
…rules commit divideconquer\ClosesPair.java Refactorized ClosestPair.java. Finding nearest cartesian points. Refactorized ClosestPair.java. Finding nearest cartesian points.
Refactorized ClosestPair.java in order to be compliant with java sun rules
fixed spelling mistakes
Added and explanation to SkylineProblem.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
I found that the previous Dijkstra algorithm that was build in an ineffective way. There were hard-coded magic numbers (1000000l) and a very large 2-dimensional array when it is not needed when using another implementation. No description was given on the input format the algorithm was expecting.
I found another algorithm on Rosetta Code website that has none of these issues from what I can tell.