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?
     我们能不能回过头来谈谈你的小学和中学教育？

双语例句

• But backtracking on such reforms would indeed be a huge mistake, as the eurogroup and IMF argue.
  但就像欧元集团和IMF所主张的那样，逆转此类改革将是一个巨大错误。
• In the constitution of backtracking algorithm, the solution space tree has the massive redundant solutions.
  根据空间节点之间的铰链关系，提出了基于空间树的六自由度空间模型。
• And he has avoided the accusation that he is backtracking on his commitment to fiscal responsibility.
  与此同时，他也让人们难以再指责他背弃了自己对于财政责任的承诺。
• Effects of Cut Mechanisms on Backtracking in Visual Prolog
  VisualProlog截断机制对回溯的作用机理
• Each time the regex finds an intermediate tag and exits a lookahead, it throws away all backtracking positions from within the lookahead.
  正则表达式每次找到一个中间标签就退出一个前瞻，它在前瞻过程中丢弃所有回溯位置。
• In graph theory, to getting shortest path must compare all possible path, basically use backtracking, the Algorithm needs longer time.
  在图论中，一般求最短路径都是通过比较各种可能的路径后而得到的，基本上都是按树的回溯方式求得。
• 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.
  深度优先搜索将从一个初始节点开始搜索一个树形结构，并尽可能从一个分支开始搜索，在到达目标节点或分支的尽头后停止或回溯。
• Canonical LR Parsing Algorithm Based on State Backtracking Technique
  基于状态回朔技术的规范LR分析算法
• Leonard jumped in his car and started backtracking
  伦纳德跳进车里，开始原路折返。
• Backtracking techniques can be encoded by fairly short solution programs.
  回溯演算法可以写成很短的解题程式。