代码搜索：depth-first
找到约 51 项符合「depth-first」的源代码
代码结果 51
www.eeworm.com/read/324448/13262737
txt ch11i.txt
Chapter 11 Graphs: Instructor's CD questions
1. Which is not the name for a standard graph traversal?
*a) Preorder.
b) Depth first.
c) Breadth first.
2. Depth-first search is best implemente
www.eeworm.com/read/144216/5751895
pm find.pm
package File::Find;
use 5.005_64;
require Exporter;
require Cwd;
=head1 NAME
find - traverse a file tree
finddepth - traverse a directory structure depth-first
=head1 SYNOPSIS
use File::Find;
www.eeworm.com/read/396844/2407088
m dfs.m
function [d, pre, post, height, cycle, pred] = dfs(adj_mat, start, directed)
% DFS Perform a depth-first search of the graph starting from 'start'.
% [d, pre, post, height, cycle, pred] = dfs(adj_mat,
www.eeworm.com/read/395929/2430148
h cg_dfn.h
#ifndef cg_dfn_h
#define cg_dfn_h
/*
* Flags which mark a symbol as topologically ``busy'' or as
* topologically ``not_numbered'':
*/
#define DFN_BUSY -1
#define DFN_NAN 0
/*
* Depth-first numb
www.eeworm.com/read/101082/6249075
c 2.dfs.c
#ifndef lint
static char sccsid[] = "@(#)2.dfs.c 4.1 (Berkeley) 2/11/83";
#endif not lint
#include
#
/* depth-first search used to identify back edges, unreachable nodes;
each node v enter
www.eeworm.com/read/490761/6442124
m dfs.m
function [d, pre, post, cycle, f, pred] = dfs(adj_mat, start, directed)
% DFS Perform a depth-first search of the graph starting from 'start'.
% [d, pre, post, cycle, f, pred] = dfs(adj_mat, start,