When Edsger W. Dijkstra published his algorithm in 1959, computer networks were barely a thing. The algorithm in question found the shortest path between any two nodes on a graph, with a variant ...

Dijkstra's algorithm is used to find the shortest path from one node to all others in a graph. It is basically the standard BFS algorithm plus a greedy idea. If the graph has negative weight edges, ...

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on directed graphs with real non-negative edge weights in the comparison-addition ...

A terrain-weighted Voronoi political map simulator. Players claim territory by placing cities either through the web client or the Discord bot. Territory borders are computed server-side using ...