搜索资源列表
Binary-Tree
- 对二叉树进行操作,包括二叉树的创建和对二叉树进行深度和广度优先遍历-Operations, including the creation of a binary tree, and the depth and breadth-first traversal of a binary tree on binary tree
Common-algorithms-classic-code
- 数据结构中介绍的常见经典算法,排序、二叉树深度、广度优先搜索、高精度加减乘除等-Common data structures described in the classical algorithms, sorting, binary tree depth, breadth-first search, high-precision addition, subtraction, etc.
Romania_Trip
- 罗马利亚度假问题分别用宽度优先、深度优先、贪婪算法和 A*算法求解“罗马利亚度假问题”。(Respectively, width first, depth first, greedy algorithm and A* algorithm to solve "Luo Maria holiday" problem".)
加强图
- 图 深度优先搜索遍历和 邻接矩阵,闫蔚敏版,简单易懂,适合平时交作业(Graph depth first search and adjacency matrix, Yan Yumin version, simple, suitable for everyday homework)
迷宫问题
- 图的遍历实践与迷宫问题求解。根据参考书《算法》第4.1节和4.2节关于图的邻接表的创建,使用说明;深度优先遍历(DFS)和广度优先遍历(BFS)算法的实现过程;结合迷宫问题的特点,分别编写基于深度优先遍历(DFS)和广度优先遍历(BFS)思想的迷宫求解过程算法。(Maze problem solving)