求翻译：建立链路时间成本模型，将路由问题转化为时间相关性Bellman-Ford问题，从而将最短路径NP-Hard问题转化为多项式时间模型进行求解，计算路由。是什么意思？

Time to establish the link cost model, the routing problem into a time-related problems Bellman-Ford, which will be the shortest path NP-Hard problems in polynomial time into solving model to calculate the route.

Time-cost model, a link will be translated into a routing problem - Ford Bellman issues related to time of the shortest path, and thus will be transformed into NP - Hard issues for many of the time, calculation models be resolved by road.

The establishment link time cost model, will transform the route question as the time relevant Bellman-Ford question, thus the most short-path NP-Hard question will transform for the multinomial time model carries on the solution, will calculate the route.

Establish link-time cost model, routing problems into time dependence Bellman-Ford problem, thus NP-Hard the shortest path problems into model for solving polynomial time, calculating routes.

Establish link-time cost model, routing problems into time dependence Bellman-Ford problem, thus NP-Hard the shortest path problems into model for solving polynomial time, calculating routes.