搜索资源列表
tree
- 模拟linux下的shell中的目录系统，把目录抽象为一个多叉树，目录的打印比较有创意，虽然和pstree的打印结果很像，程序中用了大量的递归，简化了代码的长度，增强了可读性-Simulation of the shell under linux directory in the system, the abstract for more than one directory-tree, print directory of more creative, though, and print th
pstree
- 在linux下利用c语言实现的进程树的打印，主要通过/proc下的目录中的进程文件，获取status中的进程信息内容，然后利用递归实现进程树的打印-Under the linux process using c language to print the tree, primarily through/proc directory under the file in the process, the process to obtain status information, and then u
BrowseDir
- vc递归法遍历磁盘目录的程序源码，希望对大家有所帮助-vc disk directory traversal recursion program source code, we want to help
test2
- 编译原理的实验，是一个词法分析工具，采用下降递归法实现的-Compiler theory of the experiment, a lexical analysis tool, implemented using recursion down
BrowseDir
- 递归法遍历磁盘目录\BrowseDir,很不错的vc源码，希望能对大家有所帮助-Recursion through the disk directory \ BrowseDir, very good vc source code, I hope you can help
Graph-traversal
- 图的遍历，图的深度递归遍历算法，深度遍历非递归算法，图的广度遍历-Graph traversal.The depth traverseof the graph including recursion algorithm or not and breadth traverse of the chart.
Large-integer-factorial
- 本实例实现了一个计算大整数阶乘的程序。通常使用递归来计算一个整数的阶乘。但是， 因为ii.算本身能够表示的最大整数是有限的，所以能够计算的阶乘整数要受到限制。本程序使 用数组来存储结果，因而很好地解决了这个问题,只要有足够大的数组就能计.任意大的整数0-Examples of the realization of a to calculate large integer factorial program. Usually use recursion to calculate the facto
Test
- Koch雪花的构图方法，递归模型的实现算法，建立平面二维坐标系，原点位于屏幕客户区中心，x轴水平向右为正，y轴铅直向上为正。 以原点为圆心绘制半径为r的圆，与y轴交于P0点。从P0点开始，顺时针方向将圆三等分，得到P1和P2点。P0P1P2构成等边三角形。 沿着等边三角形的三条边外侧分别绘制三段递归深度为4，夹角为60°的Koch曲线，形成Koch雪花。 -Koch snowflake patterning method, recursive algorithm model, the
p3
- 写递归函数的递归定义的数据结构和数学抽象。 用递归来实现链表和树。(含链表和树的各种操作)-writing recursive functions that operate on recursively‐defined data structures and mathematical abstractions. Use recursion to realize lists and trees.
gpio-tegra
- This lock class tells lockdep that GPIO irqs are in a different category than their parents, so it won t report false recursion.
nf_log_ipv6
- One level of recursion won t kill us for Linux v2.13.6.
Train-scheduling-problem
- 代码中用编号依次为1，2，3，……，n表示停在铁路调度站入口处的车厢序列。用一个栈形象地表示为火车的调度站。利用栈先进后出的性质，结合递归和回溯算法，实现编号1…n的车厢的所有可能的序列和每种序列的出入栈变化过程。-Followed by number 1,2,3, ......, n represents the sequence in the car parked at the entrance to the railway station scheduling. With a stack
levinsondurbin_FLP
- Solve the normal equations using the Levinson-Durbin recursion.
ir_function_detect_recursion
- \file ir_function_detect_recursion.cpp Determine whether a shader contains static recursion.
partial_sum
- Problem: there is no 0-element given.Parallel partial sum implementation, two-phase approach,.no recursion.
get_streambuf
- Table to maintain a heap profile data inside, i.e. the set of currently active heap memory allocations. thread-unsafe and non-reentrant code: each instance object must be used by one thread at a time w o self-recursion.
preempt
- must be macros to avoid header recursion hell.
prom_printf
- Printn prints a number n in base b. We don t use recursion to avoid deep kernel stacks.
sprintn
- sprintn formats a number n in base b and puts output to callers buffer. We don t use recursion to avoid deep kernel stacks.