代码搜索：depth-first
找到约 51 项符合「depth-first」的源代码
代码结果 51
www.eeworm.com/read/460691/1558259
pm find.pm
package File::Find;
require 5.000;
require Exporter;
require Cwd;
=head1 NAME
find - traverse a file tree
finddepth - traverse a directory structure depth-first
=head1 SYNOPSIS
u
www.eeworm.com/read/414590/2144729
readme
Search Routines
There is no main() function in these files, but each demonstrates
a different search function.
bfs.C breadth-first search
dfs.C depth-first search
ifs.C i
www.eeworm.com/read/365029/9881488
cpp drawtree.cpp
#include "muscle.h"
#include "tree.h"
/***
Simple tree drawing algorithm.
y coordinate of node is index in depth-first traversal.
x coordinate is distance from root.
***/
static unsigned
www.eeworm.com/read/296774/7114335
c search.c
/* Breadth-first and depth-first routines for
searching multiple-inheritance lattice for GNU C++.
Copyright (C) 1987, 89, 92, 93, 94, 1995 Free Software Foundation, Inc.
Contributed by Michae
www.eeworm.com/read/123658/14618789
c search.c
/* Breadth-first and depth-first routines for
searching multiple-inheritance lattice for GNU C++.
Copyright (C) 1987, 89, 92, 93, 94, 1995 Free Software Foundation, Inc.
Contributed by Michae
www.eeworm.com/read/297233/8041648
c search.c
/* Breadth-first and depth-first routines for
searching multiple-inheritance lattice for GNU C++.
Copyright (C) 1987, 89, 92-96, 1997 Free Software Foundation, Inc.
Contributed by Michael Tie
www.eeworm.com/read/216502/4891478
c 2.dfs.c
#include
#
/* depth-first search used to identify back edges, unreachable nodes;
each node v entered by back edge replaced by
LOOPVX ->ITERVX -> v,
so that back edges entering v now enter
www.eeworm.com/read/158865/5594340
c search.c
/* Breadth-first and depth-first routines for
searching multiple-inheritance lattice for GNU C++.
Copyright (C) 1987, 89, 92-97, 1998, 1999 Free Software Foundation, Inc.
Contributed by Micha