Timeline for Why do calculations need to be made before jumping into hyperspace?

3 events

when toggle format	what		by	license	comment
Oct 3, 2014 at 7:49	comment	added	Luaan		@Snowman Well, they're obviously not searching for the best route by far. In fact, they're trying to fly as straight as possible, regardless of whether it's the fastest way, allowing you to partition the graph a lot. It might be that the straight path is more fuel efficient, while the detour is faster, of course. But finding the absolute best isn't necessary most of the time - it might make sense when you make the same run over and over again, but that could easily be calculated offline. And knowing more about hyperspace topology would likely help a lot as well.
Oct 3, 2014 at 2:14	comment	added	user31563		I am not so sure a modern desktop computer could calculate a route through a digraph with hundreds of millions of nodes in seconds, especially since the weight implies finding a "good" or best route. Graph calculations tend to be exponential, and can easily bring a modern desktop to its knees. Source: I recently finished an M.S. in Computer Science and actually performed such a simulation as part of my algorithms class. My Core i7 calculated a digraph a small fraction of that size and took around 12 hours.
Oct 2, 2014 at 13:18	history	answered	Luaan	CC BY-SA 3.0