代码搜索：depth-first
找到约 51 项符合「depth-first」的源代码
代码结果 51
www.eeworm.com/read/197407/7998678
cpp dfstree.cpp
// find a depth-first spanning tree
#include
#include "lg2.h"
#include "edge.h"
void main(void)
{
LinkedGraph G(0);
Edge DT[100];
// try three graphs
for (in
www.eeworm.com/read/129320/5974271
java dfsedgetypes.java
/*
* Generic graph library
* Copyright (C) 2003,2004 University of Maryland
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser Genera
www.eeworm.com/read/390183/8480262
pm dfs.pm
package Graph::Traversal::DFS;
use strict;
use Graph::Traversal;
use base 'Graph::Traversal';
sub current {
my $self = shift;
$self->{ order }->[ -1 ];
}
sub see {
my $sel
www.eeworm.com/read/147693/12538578
pl fig11_7.pl
% Figure 11.7 A depth-first search program that avoids cycling.
% solve( Node, Solution):
% Solution is an acyclic path (in reverse order) between Node and a goal
solve( Node, Solution)
www.eeworm.com/read/138383/13238241
tex dfirst_cursor.tex
\verb+state_type+ & depth-first cursor & The type of the states
handles of the underlying DFA. \\ \hline
\verb+char_type+ & depth-first cursor & The type of the transitions
letters. \\ \hline
\verb+t
www.eeworm.com/read/162135/10332248
m rr_factor.m
function lst = rr_factor(Q,D,m)
% Roth-Ruckstein algorithm for finding roots of a bivariate polynomial
%initialize
p = -1;
deg = -1;
t = 2;
u = 1;
coeff = gf(0,m);
f = gf([],m);
% Check first if we
www.eeworm.com/read/196983/8037790
h dfs.h
/*****************************************************************************
* *
* -------------------------------- dfs.
www.eeworm.com/read/347853/11631251
pro ch07ex09.pro
/*
Turbo Prolog 2.0 Chapter 7, Example Program 9
Copyright (c) 1986, 88 by Borland International, Inc
*/
/* Traversing a tree by depth-first search
and printing each eleme
www.eeworm.com/read/147693/12538696
pl fig11_8.pl
% Figure 11.8 A depth-limited, depth-first search program.
% depthfirst2( Node, Solution, Maxdepth):
% Solution is a path, not longer than Maxdepth, from Node to a goal
depthfirst2( Node,