Created this project in order to compare native C code, Java and WebAssembly performance.
In order to do that, I've written a very simple implementation of Dijkstra Shortest Path algorithm using an adjancency matrix graph implementation.
-
Notifications
You must be signed in to change notification settings - Fork 0
mikhasd/wasm
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Doing some testing with webassembly
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published