Loading video...
Video Failed to Load
For 41 years, to find shortest paths in a graph, the Dijkstra’s algorithm, was seen as the best possible way. Not any longer: Now a team from Tsinghua University has beaten it. They created the first faster algorithm for directed shortest paths since 1984. • Faster than Dijkstra on... show more
95,270 views • 6 months ago •via X (Twitter)
0 Comments
No comments available
Comments from the original post will appear here
