A new technique breaks Dijkstra's 70-year-old record: it finds routes faster in huge networks, changing graph theory forever.

If it uses recursion to do the inserts, you'd probably gain quite a bit using a non-recursive sorting algorithm. Memory allocation might also be a big factor if you're reading in the entire file into ...