backtracking

英 [ˈbæktrækɪŋ]

美 [ˈbæktrækɪŋ]

v.  原路返回; 折回; 折返; (屈于压力而)改变声明(或主张)，出尔反尔; 退缩
backtrack的现在分词

现在分词：backtracking　

计算机

COCA.43330

柯林斯词典

• VERB 改变（说法、决定等）；出尔反尔
  If youbacktrack ona statement or decision you have made, you do or say something that shows that you no longer agree with it or support it.
  1. The committee backtracked by scrapping the controversial bonus system...
     委员会改变主意，放弃了有争议的奖金制度。
  2. The finance minister backtracked on his decision.
     财政部长收回了他的决定。
• VERB 原路返回
  If youbacktrack, you go back along a path or route you have just used.
  1. Leonard jumped in his car and started backtracking...
     伦纳德跳进车里，开始原路折返。
  2. We had to backtrack to the corner and cross the street.
     我们不得不原路返回到拐角处过街。
• VERB 倒回（描述或解释内容）
  If youbacktrackin an account or explanation, you talk about things which happened before the ones you were previously talking about.
  1. Can we just backtrack a little bit and look at your primary and secondary education?
     我们能不能回过头来谈谈你的小学和中学教育？

双语例句

• It also has a method to determine the next child node to consider after backtracking.
  它还使用一种方法判断在返回后下一个要进行猜测的子节点。
• In graph theory, to getting shortest path must compare all possible path, basically use backtracking, the Algorithm needs longer time.
  在图论中，一般求最短路径都是通过比较各种可能的路径后而得到的，基本上都是按树的回溯方式求得。
• For example, top-down parsers are guaranteed to find every possible production, but can be extremely slow because of frequence ( exponention order) backtracking.
  例如，top-down解析器可以确保找到每一个可能的产品，但可能会非常慢，因为要频繁地（指数级）进行回溯。
• Effects of Cut Mechanisms on Backtracking in Visual Prolog
  VisualProlog截断机制对回溯的作用机理
• According to the "surplus character", a" surplus heuristic backtracking "strategy is put forward by improving the efficiency of backtracking greatly.
  根据选管工艺的余料特性，提出了余料启发式回溯的求解策略，大大地提高了回溯效率。
• Canonical LR Parsing Algorithm Based on State Backtracking Technique
  基于状态回朔技术的规范LR分析算法
• In a large storage area, the use of tunnels and cross aisles reduces travel time and minimizes backtracking.
  在一个大型的存储区域，使用隧道和跨过道减少旅行时间和最大限度地减少回溯。
• Implementing Fast Searching and Selective Backtracking in LP Environments
  LP环境下快速搜索与选择回溯的实现
• Depth-first search is an algorithm for searching a tree structure starting from an initial node and exploring as far as possible along a branch until either the goal node or a dead end is reached before stopping or backtracking.
  深度优先搜索将从一个初始节点开始搜索一个树形结构，并尽可能从一个分支开始搜索，在到达目标节点或分支的尽头后停止或回溯。
• To help you catch runaway backtracking early, always test your regexes with long strings that contain partial matches.
  为帮助你早日把握回溯失控，总是用包含特殊匹配的长字符串测试你的正则表达式。