Logo
Explore Help
Sign In
martin/Orienteering
Watch 1
Star 0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
8 Commits 1 Branch 0 Tags
f3a1f058c04b9e86b10a5b617426491cf375e3f5
T
Clone
Open with VS Code Open with VSCodium Open with Intellij IDEA
Download ZIP Download TAR.GZ Download BUNDLE
Martin Asprusten f3a1f058c0 Use a web worker to calculate, to avoid locking up the browser. Also, use semicolons between points, and fix bug where it is impossible to calculate route when receiving points in the URL
2026-08-29 13:43:19 +02:00
native
Use shared_ptr to avoid memory leaks
2026-08-29 09:31:26 +02:00
src
Use a web worker to calculate, to avoid locking up the browser. Also, use semicolons between points, and fix bug where it is impossible to calculate route when receiving points in the URL
2026-08-29 13:43:19 +02:00
static
initial commit
2026-08-29 09:29:39 +02:00
.gitignore
The generated files should not be stored in git
2026-08-29 09:31:18 +02:00
index.html
initial commit
2026-08-29 09:29:39 +02:00
package-lock.json
Use 64-bit WASM to allow more memory usage
2026-08-29 09:30:39 +02:00
package.json
Use 64-bit WASM to allow more memory usage
2026-08-29 09:30:39 +02:00
tsconfig.json
initial commit
2026-08-29 09:29:39 +02:00
S
Description
Load PPEN or XML files and solve the traveling salesman problem to find the shortest route between all marker posts
130 KiB
Languages
TypeScript 73.5%
C++ 18.5%
CSS 4%
HTML 4%
Powered by Gitea Version: 1.27.2 Page: 13ms Template: 2ms
Auto
English
Bahasa Indonesia Deutsch English Español Français Gaeilge Italiano Latviešu Magyar nyelv Nederlands Polski Português de Portugal Português do Brasil Suomi Svenska Türkçe Čeština Ελληνικά Български Русский Українська فارسی മലയാളം 日本語 简体中文 繁體中文(台灣) 繁體中文(香港) 한국어
Licenses API