Added example dijkstra algorithm #1572
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
Contributor
|
Hey @Irene-123! As @SkymanOne mentioned in #1571, this isn't an ink! specific example. Any examples that are part of this repository assume that readers already know Rust. If you're looking to get feedback on your Rust, or share your Rust knowledge with others, you should check out Exercism. |
Collaborator
|
Hey maybe we could add a section to https://github.com/paritytech/awesome-ink for links to user supplied examples? We definitely want to encourage this! |
Author
|
Thank you |
Collaborator
|
I haven't looked at the code but it sounds like this is not the type of computation one would want to do on-chain in a smart contract. Please continue to experiment with |
Author
|
Sure definitely I would try more realistic examples! |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
3 participants
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 was working on learning smart contracts and developed Dijkstra's Algorithm in rust which computes the shortest path between 2 nodes. I'm wondering if this is a good implementation of rust and could be added as an example for people to learn. I believe it could be very helpful for students and beginners to learn and get their hands on Rust! Thank you