代码搜索：plot
找到约 10,000 项符合「plot」的源代码
代码结果 10,000
www.eeworm.com/read/409477/11321590
m resplot.m
% RESPLOT.M (RESult PLOTing)
%
% This function plots some of the results during computation.
%
% Syntax: resplot(Chrom,IndAll,ObjV,Best,gen)
%
% Input parameters:
% Chrom - Matrix
www.eeworm.com/read/264211/11325809
m cellular3.m
% 画蜂房（六角形网格）
n=6;a=0:2*pi/n:2*pi;y0=sin(a);x0=cos(a);
p=5;q=5;x1=[];y1=[];x2=[];y2=[];
for i=0:p
for j=0:q
x=x0+i*1.5;y=y0+(j+mod(i,2)/2)*sqrt(3);
plot(x,y),hold on
end
www.eeworm.com/read/264066/11330942
asv firfilterdesign.asv
wp=0.2;ws=0.4;Rp=1;As=20; % 定义滤波器参数(可修改)
[n,wc]=buttord(wp,ws,Rp,As); % 计算滤波器阶次和3dB截止频率
[b,a]=butter(n,wc); % 设计巴特沃斯滤波器
w=[0:pi/200:pi];
www.eeworm.com/read/264066/11330957
m impulscx.m
function impulscx(x,ts); %ts为码元宽度
n=length(x);
t1=ts*n;
t=0:0.1:t1;
y=0;
for i=0:n-1
y=x(i+1)*rectpuls((t-(2*i+1)/2*ts),ts)+y;
end
plot(t,y);
grid on
www.eeworm.com/read/264066/11330973
m call_dlp2bs.m
%call_dlp2bs.m 数字低通滤波器到数字带阻滤波器
function []=call_dlp2bs(h1,h2)
axes(h1);hold off
plot([0,0],[-1.2,1.2],'linestyle','-.','color','g');hold on
plot([-2,2],[0,0],'linestyle','-.','color','g');axis([-1
www.eeworm.com/read/264066/11330977
m call_dlp2bp.m
%call_dlp2bp.m 数字低通滤波器到数字带通滤波器
function []=call_dlp2bp(h1,h2)
axes(h1);hold off;
plot([0,0],[-1.2,1.2],'linestyle','-.','color','g');hold on
plot([-1.2,1.2],[0,0],'linestyle','-.','color','g');axi
www.eeworm.com/read/264066/11331055
m firfilterdesign.m
wp=0.2;ws=0.4;Rp=1;As=20; % 定义滤波器参数(可修改)
[n,wc]=buttord(wp,ws,Rp,As); % 计算滤波器阶次和3dB截止频率
[b,a]=butter(n,wc); % 设计巴特沃斯滤波器
w=[0:pi/200:pi];
www.eeworm.com/read/263959/11335720
m fig2_6.m
x = 0:0.1:10;
y = x.^2 - 10.*x + 26;
figure(1)
subplot(2,2,1)
plot(x,y);
title ('Linear Plot');
xlabel ('x');
ylabel ('y');
grid on;
subplot(2,2,2)
semilogx(x,y);
title ('Semilog x Plot');
www.eeworm.com/read/263879/11338204
m kruskal.m
function [out,len]=kruskal(map)
%求最小生成树算法,通过kruskal算法求最优树,并给出相应图像.
%用法:
% 首先输入矩阵:
% map=[起点1 终点1 边长1;起点2 终点2 边长2;............;起点n 终点n 边长n]
% 再用[out,len]=kruskal(map)求最优树
%参数说明
% map----3列邻接
www.eeworm.com/read/263879/11338205
m dijkstra.m
function [p,v]=dijkstra(map,u1,u2)
%求网络最短路径的dijkstra算法
%用法:
% 首先输入矩阵:
% map=[起点1 终点1 边长1;起点2 终点2 边长2;............;起点n 终点n 边长n]
% 和u1,u2
% 注意：这里map为无向图。
% 再用[p,v]=dijkstra(map,u1,u2)求最短路径