首页> 外国专利> TREE TRAVERSAL WITH BACKTRACKING IN CONSTANT TIME

TREE TRAVERSAL WITH BACKTRACKING IN CONSTANT TIME

机译:不断回溯的树遍历

摘要

A method, computer readable medium, and system are disclosed for performing tree traversal with backtracking in constant time. The method includes the steps of traversing a tree, maintaining a bit trail variable and a current key variable during the traversing, where the bit trail variable includes a first plurality of bits indicating tree levels on which a node has been postponed along a path from the root of the tree during the traversing, and the current key variable includes a second plurality of bits indicating a number of a current node within the tree, and performing backtracking within the tree during the traversing, utilizing the bit trail variable and the current key variable.
机译:公开了一种用于在恒定时间内执行具有回溯的树遍历的方法,计算机可读介质和系统。该方法包括以下步骤:遍历树,在遍历期间保持位尾变量和当前键变量,其中,该位尾变量包括第一多个位,该第一多个位指示沿着从路径到路径的路径已经推迟了节点的树级别。在遍历期间树的根,并且当前键变量包括第二多个位,指示树内当前节点的数量,并在遍历期间利用位尾变量和当前键变量在树内执行回溯。

著录项

  • 公开/公告号US2017206231A1

    专利类型

  • 公开/公告日2017-07-20

    原文格式PDF

  • 申请/专利权人 NVIDIA CORPORATION;

    申请/专利号US201715409429

  • 发明设计人 NIKOLAUS BINDER;ALEXANDER KELLER;

    申请日2017-01-18

  • 分类号G06F17/30;

  • 国家 US

  • 入库时间 2022-08-21 13:52:04

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号