搜索资源列表
traverse-of-graphs
- 利用邻接矩阵或邻接表存储一张图，分别采用图的深度优先搜索和广度优先搜索遍历该图，并输出遍历结果-Using the adjacency matrix or adjacency list storage a picture, using depth-first search and the breadth first search traversal of the graph, and the output traversal results
BinaryTree
- 在vxworks环境中实现对二差树的multitasking操作，包括，插入，搜索，深度优先，广度优先读取，并采用xworks的内核函数在任务切换间准确记录每个任务执行的时间-Multitasking operation on binary tree in Vxworks
BFS
- c语言广度优先搜索算法的实现，输入几个节点，生成树，然后经广度优先搜索算法输出-c language breadth-first search algorithm, enter the number of nodes, spanning tree, and then by the breadth-first search algorithm output
COLORING
- 图用邻接矩阵表示，程序逻辑为，首先实现了用于确定一种有效颜色的函数color（），然后，按照深度优先和违反约束则回溯的策略进行搜索。-Map with the adjacency matrix that logic to, first of all to achieve the color used to determine the function of an effective color (), and then, in accordance with the depth-first an
vga_Display
- 用图形图像的显示，硬件编程的代码，可以作为单片机学习的参考(The code is easy to learn, and you can make use of it to improve your skills)