搜索资源列表
erchashu
- 本文利用C语言实现了简单的二叉树,每个结点只保存一个整数,并且,由于非常简单,树的根结点是确定的,而不是输入的。确定根结点以后,用户输入的每一个数都被insert到树中(-999表示停止),利用深度优先的方法。建立好二 叉 树以后,分别利用深度优先(DFS)和广度优先(BFS)进行了遍历, -In this paper, a simple C language binary tree, each node only stores an integer, and, due to the very
sicily
- 关于图的广度优先搜索和深度优先搜索算法,结构体描述。还有二叉树的重建,根据先序和中序重构二叉树-DFS and BFS
Binary-Tree
- 对二叉树进行操作,包括二叉树的创建和对二叉树进行深度和广度优先遍历-Operations, including the creation of a binary tree, and the depth and breadth-first traversal of a binary tree on binary tree
bitree
- 用C语言实现建立二叉树,并对所建立的二叉树进行先序遍历、广度优先遍历、深度优先的中序遍历。-Build a binary tree using C language and conduct preorder, breadth-first traversal, depth-first traversal on the established binary tree.
depth-first-traversal
- 这是一个数据结构中二叉树的邻接链表的建立以及广度优先遍历和深度优先遍历的算法,对于初学者来说,这样的算法简单易懂,非常容易上手-This is to establish and breadth of a binary tree data structure adjacency list first traversal and depth-first traversal algorithm, for starters, this algorithm is simple to understand
software-design-I
- c++实现的非常详细的数据结构与算法代码,队列,链表,三元组,哈弗曼树,树的各种递归,非递归遍历算法,树与森林相互转化算法,图的深度,广度优先搜索算法,双连通算法,强连通算法,拓扑排序算法,最短路径算法,哈希,快速排序,归并排序等等。-C++ very detailed data structure and algorithm code, queues, linked lists, three tuple Havermann tree, various recursive tree, non r
0301_treeScan
- 列举了大部分树的遍历方法,包括深度优先遍历,广度优先遍历,morris遍历等(tree scan method, deep first, wide first, morris)
Tree_Graph
- 本工程包含二叉树和图的相关基本操作,源码包括二叉树的前序、中序、后序、层次遍历,求树高和树宽,创建、删除二叉树或某个结点,通过前序和中序序列得后序序列;图的创建(邻接矩阵或邻接表表示),深度优先和广度优先搜索,求关键路径,普里姆算法求最小生成树等,放到Visual C++工作区即可使用。(This project contains the basic operation of the binary tree and the graph. The source code includes the
最小生成树
- 本文件包含最小生成树程序,深度优先搜索,广度优先搜索,prim算法等,满足对树状图学习的小伙伴们下载,绝对是良心推荐,可以直接运行程序。(This file contains minimum spanning tree program, depth first search, breadth first search, PRIM algorithm, etc., which satisfies the downloads of tree learning partners. It is abso