#graphs

4 posts· Last used Jul 19

Google IDX Product Manager Kirupa Chinnathambi writes a code-backed, step-by-step review of Dijkstra's famous graph algorithm, depth, and breadth first search, touching up on Bellman-Ford and A*. This reminded me of a uni assignment where we recommended shortest path routes to passengers based on geo data from London Tube stations, using A* to compute them. "Dijkstra's Shortest Path Algorithm" #algorithms #datastructures #graphs #dfs #bfs #dijkstra #astar #compsci #javascript #programming
1
0
1
0
Replying to @deivudesu@mastodon.social
Building this around ego-graphs (subgraphs of the real underlying social network, centred around one user) allows for a much simpler (and more decentralised) model than protocols like #ActivityPub, #Matrix etc, that need to reconcile multiple participants having equal rights on a discussion space… The trade-off, is that it does not scale very well: these ego-graphs must remain at a manageable size (~10-15k people). … which is a feature, not a bug™ #mastodon #telegram #signal #graphs 3/ 🧵
1
1
6
0
You've seen all posts