• After your code has walked through the complete chain of linked dependencies, you can represent it visually using a tree viewer.

    在代码遍历完整个链接依赖性链之后,我们就可以使用一个树视图来直观地将其表示出来。

    youdao

  • Algorithms are proposed for tracing boundary and extracting vertex chain code and obtaining the tree structure of contours from 8-adjacent and 4-adjacent images.

    分别就八近邻图像和四近邻图像给出了边界跟踪、顶点链码抽取及围线树结构的生成算法。

    youdao

  • Algorithms are proposed for tracing boundary and extracting vertex chain code and obtaining the tree structure of contours from 8-adjacent and 4-adjacent images.

    分别就八近邻图像和四近邻图像给出了边界跟踪、顶点链码抽取及围线树结构的生成算法。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定