TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Show HN: Eppstein’s k shortest paths in the web browser with OpenStreetMap

39 pointsby ctcliffalmost 9 years ago

1 comment

antoniomedranoalmost 9 years ago
This demo is useful in showing how useless KSP is for finding meaningful alternate routes. Basically, brute force enumeration requires generating massive numbers of paths before you get anything with any sort of spatial differentiation. Until then, all you get are tiny variations on the shortest path. Other methods are much more effective at finding locally optimal spatially diverse alternate routes with much much less effort. Gateway shortest paths are one such example.
评论 #12191092 未加载