#directed graph

1 story

#algorithm #c-hd #computational complexity #dijkstra #formal verification #graph theory #lean #mathematical proof #non-negative weights #runtime bound #shortest path

C-HD Algorithm Achieves Faster Shortest Path Computation
New algorithm finds exact shortest paths in directed graphs with non-negative weights faster than Dijkstra's method for specific input sizes.
Vals · 1m