其中中间节点法给出了详细的数学证明，穷举搜索法给出了具体的算法。
Middle node law among them give and publish detailed mathematics prove, exhaust and search for law give and produce the concrete algorithm.
然而，看看可行的、首选的航班数量如此之多时，我们应该认识到不要再用穷举搜索法对每一次查询进行验证。
However looking at the total number of possible flights to ones that are viable and preferable should start to eliminate the need to apply Brute Force searching to every single query.
但是对现有的计算机来说，使用穷举法在如此庞大的搜索空间中寻求最优解，几乎是不可能的。
But to all computers nowadays, it's hardly to obtain its best answer in such huge researching space by using common enumeration.
但是对现有的计算机来说，使用穷举法在如此庞大的搜索空间中寻求最优解，几乎是不可能的。
But to all computers nowadays, it's hardly to obtain its best answer in such huge researching space by using common enumeration.
应用推荐