搜索资源列表
bianli
- 用邻接矩阵确定图 输出深度优先遍历和广度优先遍历的结果-Map with the adjacency matrix to determine the depth first traversal and breadth of the output first traversal of the results
123
- 图的遍历的演示，用C++编写。。。 深度广度优先遍历-tu de bianli
bianli
- 实现图的遍历，输入图的各个结点，实现前序遍历，中序遍历，后序遍历-Implement graph traversal, each node input graph, to achieve pre-order traversal, inorder traversal, postorder traversal
bianli
- 浏览全部模型特征,并计算模型的外部曲线，包括一些特殊的基准面。-Computes the outline of a solid. This outline can include external datums.
tudebianli
- 图的遍历，很不错的程序哦，可以进行图的遍历，输入@分割节点-this is a program which can achieve tu de bianli you see