Is there an easy algorithm to
a) count the number of equivalent shortest paths on a manhattan grid
b) enumerate them systematically?
I wrote a dumb random algo and I could run it for a long time to count unique paths but I imagine there's a closed-form solution?
Conversation
Replying to
The concept of betweenness centrality is kinda relevant to that en.m.wikipedia.org/wiki/Betweenne
1
2
Replying to
heh looks like I'm empircally rediscovering that
Quote Tweet
manhattan grid possible world paths are really pretty if you add a bit of jitter to the path rendering
interesting how if you make random choices (weighted by bounding box side lengths) most paths sorta go through the middle

