代码搜索：DFS
找到约 1,955 项符合「DFS」的源代码
代码结果 1,955
www.eeworm.com/read/361402/10054549
java dfs.java
// dfs.java
// demonstrates depth-first search
// to run this program: C>java DFSApp
////////////////////////////////////////////////////////////////
class StackX
{
private final int SIZE
www.eeworm.com/read/359349/10154092
m dfs.m
n=-5:10;
x=0.5.^n.*(u(n)-u(n-5));
xs=0.5.^(n+5).*(u(n+5)-u(n))+0.5.^n.*(u(n)-u(n-5))+0.5.^(n-5).*(u(n-5)-u(n-10))+0.5.^(n-10).*(u(n-10)-u(n-15));
subplot(211)
stem(n,xs,'.')
title('The curve of a
www.eeworm.com/read/280929/10279472
m dfs.m
function [Xk] = dfs(xn,N)
% Computes Discrete Fourier Series Coefficients
% ---------------------------------------------
% [Xk] = dfs(xn,N)
% Xk = DFS coeff. array over 0
www.eeworm.com/read/160361/10538953
m dfs.m
function [Xk]=dfs(xn,N)
%------------------
%[Xk]=dfs(xn,N)
%
n=[0:1:N-1];
k=[0:1:N-1];
WN=exp(-j*2*pi/N);
nk=n'*k;
WNnk=WN.^nk;
Xk=xn*WNnk;
www.eeworm.com/read/160223/10555775
m dfs.m
function [Xk] = dfs(xn,N)
% Computes Discrete Fourier Series Coefficients
% ---------------------------------------------
% [Xk] = dfs(xn,N)
% Xk = DFS coeff. array over 0
www.eeworm.com/read/422885/10604802
cpp dfs.cpp
// DFS.cpp: implementation of the DFS class.
//
//////////////////////////////////////////////////////////////////////
#include "stdafx.h"
#include "DFS.h"
///////////////////////////////////
www.eeworm.com/read/422885/10604852
h dfs.h
// DFS.h: interface for the DFS class.
//
//////////////////////////////////////////////////////////////////////
#if !defined(H_DFS)
#define H_DFS
#if _MSC_VER > 1000
#pragma once
#endif //
www.eeworm.com/read/351296/10661602
dsp dfs.dsp
# Microsoft Developer Studio Project File - Name="dfs" - Package Owner=
# Microsoft Developer Studio Generated Build File, Format Version 6.00
# ** DO NOT EDIT **
# TARGTYPE "Win32 (x86) Conso
www.eeworm.com/read/351296/10661606
dsw dfs.dsw
Microsoft Developer Studio Workspace File, Format Version 6.00
# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
###############################################################################
www.eeworm.com/read/351296/10661611
cpp dfs.cpp
/*
例如，下面的地图(黑色的格子代表墙，其它格子都是可以行走的)
如果要从左上角走到右下角，深度优先搜索的次序如下(A->Z->a->o)：
g g g g g g g g g g g
g Ａ g ａ g ｄ ｅ ｆ c c g
g Ｂ g Ｚ ｂ ｃ g ｇ g g g
g Ｃ Ｘ Ｙ g c g ｈ c c g
g