31. A path found by a query is the shortest path because of the preprocessing stage. 32. This process is continued to the 3rd " k "-shortest path . 33. They used the Moore algorithm to determine shortest paths and assigned all traffic to shortest paths. 34. They used the Moore algorithm to determine shortest paths and assigned all traffic to shortest paths . 35. In this case, due to hubs, the shortest paths become significantly smaller and scale as 36. This algorithm calculates the shortest path using the number of optical routers as the cost function. 37. The planned title of the second book was originally " The Shortest Path ". 38. In a splits network the phrenetic distance is that of the shortest path between two languages. 39. The sailboat does not take the shortest path to travel from one location to the other. 40. Suppose one wants the shortest path from vertex 1 to vertex " n ".
