Skip to content

New Dijkstra's algorithm with better comments. #559

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
wants to merge 42 commits into from
Closed

New Dijkstra's algorithm with better comments. #559

wants to merge 42 commits into from

Conversation

rmakynen
Copy link
Contributor

@rmakynen rmakynen commented Oct 8, 2018

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.

Christian Bender and others added 30 commits July 25, 2018 17:07
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
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
Added and explanation to SkylineProblem.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

10 participants