代码搜索:Distance

找到约 8,736 项符合「Distance」的源代码

代码结果 8,736
www.eeworm.com/read/209261/15224436

lbl 1j0-919-xxx.lbl

; ; VAG-COM label file ; ; VW Golf IV / Bora / Jetta IV (1J) ; ; component: J285 - instrument cluster (#17) ; ; p/n: 1J?-919-???-??? ; ; tested with: 1J0 919 861 D ; 1J0 919 881
www.eeworm.com/read/171459/9753348

cpp a2.cpp

#include #include using namespace std; #include #include //宏定义 #define MAZE(m,n) maze[(m)*N+(n)] #define DISTANCE(m,n) distance[(m)*N+(n)] //结构定义 ty
www.eeworm.com/read/477052/6744668

c qsort_large.c

#include #include #include #define UNLIMIT #define MAXARRAY 60000 /* this number, if too large, will cause a seg. fault!! */ struct my3DVertexStruct { int x, y, z;
www.eeworm.com/read/263897/11337635

c qsort_large.c

#include #include #include #define UNLIMIT #define MAXARRAY 60000 /* this number, if too large, will cause a seg. fault!! */ struct my3DVertexStruct { int x, y, z;
www.eeworm.com/read/213679/15127754

h classify.h

#include #include #include #include #include #include using namespace std; class point { public: float _x; float _y; int _type;
www.eeworm.com/read/270992/11013595

m flysquare.m

%flysquare.m/created by PJNahin for "Duelling Idiots"(1/19/99) %This m-file simulates the distance-squared between 100,000 %pairs of flies, landing at random in the unit square. % % rand('state',
www.eeworm.com/read/442927/7641964

m aggclust.m

function level = aggclust(distance, method) %aggClust: Hierarchical (agglomerative) clustering % Usage: level = aggclust(distance, method) % distance: 2D distance matrix of data points, with diago
www.eeworm.com/read/494702/6360696

txt 2009-2-20pku2253.txt

/* 题意 :两个forger 一个froger 要蹦到另外一个froger处 他们的最短距离是这样定义的 : The frog distance (humans also call it minimax distance) between two stones therefore is defined as the minimum necessary jump range over a
www.eeworm.com/read/327948/13054107

m pr3_30_ss_attenuationloggraph_receivedpower-distance.m

%Problem 3.30; %Attenuation of the received power with distance; clear all; close all; r=[2 3 3.84 4]; %power of distance in a propagation model; x=[1:0.1:5]; %lg of distance; y=-10*r'*x; %rece