来自专业的译者、企业、网页和免费的翻译库。
in 1979, he became the first recipient of the richard e. bellman control heritage award from the american automatic control council.
in 1979, he became the first recipient of the richard e. bellman control heritage award from the american automatic control council.
it works by using the bellman–ford algorithm to compute a transformation of the input graph that removes all negative weights, allowing dijkstra's algorithm to be used on the transformed graph.
este algoritmo trabalha com base no algoritmo de bellman-ford, para computar uma transformação de um grafo de entrada, que remove todas os pesos negativos, permitindo o uso do algoritmo de dijkstra no grafo transformado.