代码搜索：递归回溯
找到约 2,805 项符合「递归回溯」的源代码
代码结果 2,805
www.eeworm.com/read/208856/15234141
cpp algo0903.cpp
Status SecondOptimal(BiTree &T, ElemType R[], float sw[],
int low, int high) { // 算法9.3
// 由有序表R[low..high]及其累计权值表sw
// (其中sw[0]==0)递归构造次优查找树T。
int i,j;
float m
www.eeworm.com/read/207200/15280038
c recursivedropanalysis.c
/* 4.6 递归下降分析法 */
#include
#include
#include
#define INPUT_AND_DISPLAY(); /* 读一个单词的二元式并输出单词种别 */ \
fscanf(fileInput,"%c ",&t.cod
www.eeworm.com/read/37274/1070862
c ch07_23.c
#include
double rec_factorial(int );
double factorial(int );
int main(void)
{
int n;
printf("请输入要计算的阶乘数:");
scanf("%d",&n);
printf("递归函数:\n%d!=%.0lf\n",n,rec_factorial(n));
pri
www.eeworm.com/read/38039/1093255
mnu asmregopt.mnu
ASM#REG#OPT 装配再生选项
# remove the # sign and enter foreign help string in this line
Recursive 递归
Regenerate the part's references before regenerating part itself.
在再生零件本身之前再生此零件的参照。
Simple 简单
Do not re
www.eeworm.com/read/306178/3748466
c xgrep.c
// xgrep.c
// write by JackyBoy@CuteRabbit Studio for SDXL & CCTX 1999/6/1
// 为了避免递归太深，请不要设置进入级别超过16级. JackyBoy
inherit F_CLEAN_UP;
int help();
int do_grep(string,string,int);
string resolvePath(stri
www.eeworm.com/read/306178/3748699
c xgrep.c
// xgrep.c
// write by JackyBoy@CuteRabbit Studio for SDXL & CCTX 1999/6/1
// 为了避免递归太深，请不要设置进入级别超过16级. JackyBoy
inherit F_CLEAN_UP;
int help();
int do_grep(string,string,int);
string resolvePat
www.eeworm.com/read/306178/3748719
c xscan.c
// xgrep.c
// write by JackyBoy@CuteRabbit Studio for SDXL & CCTX 1999/6/1
// 为了避免递归太深，请不要设置进入级别超过16级. JackyBoy
inherit F_CLEAN_UP;
int help();
int do_grep(string,string,int);
string resolvePath(stri
www.eeworm.com/read/294906/3914717
c inordertraverse.c
Status InorderTraverse(BiTree T,Status(*Visit)(TElemType e)){
//中序遍历二叉树的非递归算法，对每个元素调用函数Visit
InitStack(S); p = T;
while(p || !StackEmpty(S)){
if(p){
Push(S,p);
p = p->lchild;
}
www.eeworm.com/read/360652/2960637
txt 算法 7.2.txt
算法 7.2
void DFS(Graph G, int v)
{
// 从第v个顶点出发递归地深度优先遍历图G。
visited[v] = TRUE; VisitFunc(v); // 访问第v个顶点
for ( w=FirstAdjVex(G, v); w!=0; w=NextAdjVex(G, v, w) )
if
www.eeworm.com/read/154509/5636889
txt 算法 7.2.txt
算法 7.2
void DFS(Graph G, int v)
{
// 从第v个顶点出发递归地深度优先遍历图G。
visited[v] = TRUE; VisitFunc(v); // 访问第v个顶点
for ( w=FirstAdjVex(G, v); w!=0; w=NextAdjVex(G, v, w) )
if