The most basic formula for calculating directions from location A to B is Dijkstra's Algorithm a.k.a. Uniform Cost Search.
This involves repeatedly popping the closest intersection off a priority queue & enqueueing all its neighbours. Adding the road's distance to the distance to this intersection as the priority in that priority queue.
Yesterday I discussed how in our string-centric hardware we'd use an edgetable keyed by DGGS IDs to represent the road network. So this priority queue?
1/3?
alcinnz
npub186…snt98
2024-09-28 20:31:17 UTC
Author Public Key
npub186lgefknfnkgychnfjancqnv4k4yrdzxal486lw0p80z6vmley9qgsnt98Seen on
wss://relay.momostr.pinkPublished at
2024-09-28 20:31:17 UTCEvent JSON
{
"id": "097afb72817685cd4d97ce24a62740482949946f04c563e422baaa096057af43",
"pubkey": "3ebe8ca6d34cec8262f34cbb3c026cadaa41b446efea7d7dcf09de2d337fc90a",
"created_at": 1727555477,
"kind": 1,
"tags": [
[
"proxy",
"https://floss.social/@alcinnz/113217075786154318",
"web"
],
[
"proxy",
"https://floss.social/users/alcinnz/statuses/113217075786154318",
"activitypub"
],
[
"L",
"pink.momostr"
],
[
"l",
"pink.momostr.activitypub:https://floss.social/users/alcinnz/statuses/113217075786154318",
"pink.momostr"
],
[
"-"
]
],
"content": "The most basic formula for calculating directions from location A to B is Dijkstra's Algorithm a.k.a. Uniform Cost Search.\n\nThis involves repeatedly popping the closest intersection off a priority queue \u0026 enqueueing all its neighbours. Adding the road's distance to the distance to this intersection as the priority in that priority queue.\n\nYesterday I discussed how in our string-centric hardware we'd use an edgetable keyed by DGGS IDs to represent the road network. So this priority queue?\n\n1/3?",
"sig": "277cdcc211160946d9ca95f62dcc194803d7b3ebf7ca1e7df1f7c3938a59028860033a021b3abec127e549b2fc11dfcdce9b356026da251cd1fb6676d45e947a"
}