Added example dijkstra algorithm #1571
Closed
Conversation
This file contains 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
Irene-123
requested review from
cmichi,
ascjones and
HCastano
as code owners
|
Hi @Irene-123. Thank you for your effort. With regard to your Dijkstra Algorithm, it is definitely a cool idea. However, it doesn't utilise any ink! API and can not be deployed on chain. I advise you to go to ink! docs and leverage ink! API to turn your code into a deployable contract. |
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.
Hello. I've written a smart contract which is an implementation of the Dijkstra Algorithm to find the shortest path between 2 nodes.
The smart contract uses another file
graph.inwhich has thevec(source, destination, cost)and the result is printed. Though this is a very basic implementation ofrustwhich is quite academic but if you find it useful and worthy please accept my project.