-
MATLAB courseware, the courseware is Chinese, and more easy to learn, for people...
MATLAB课件，该课件是中文的，较容易学习，对于不熟悉英语的人有一定的好处。-MATLAB courseware, the courseware is Chinese, and more easy to learn, for people who are not familiar with English, have a certain advantage.
- 2023-02-03 08:20:04下载
- 积分：1
-
一种图像增强算法，主要应用于平板电视视频处理器芯片
一种图像增强算法，主要应用于平板电视视频处理器芯片-An image enhancement algorithm, mainly used in flat-panel TV video processor chip
- 2023-01-17 19:25:03下载
- 积分：1
-
javasript零基础学习教程，编程初学者的福音，喜欢的朋友可以来
javasript零基础学习教程，编程初学者的福音，喜欢的朋友可以来-javasript zero-based learning tutorials, programmer s gospel, like a friend can come
- 2022-07-17 18:48:25下载
- 积分：1
-
在一个划分成网格的操场上，n个士兵散乱地站在网格点上。网格点由整数坐标(x,y)表示。士兵们可以沿网格边上、下、左、右移动一步，但在同一时刻任一网格点上只能有一...
在一个划分成网格的操场上，n个士兵散乱地站在网格点上。网格点由整数坐标(x,y)表示。士兵们可以沿网格边上、下、左、右移动一步，但在同一时刻任一网格点上只能有一名士兵。按照军官的命令，士兵们要整齐地列成一个水平队列，即排列成(x,y),(x+1,y),…,(x+n-1,y)。如何选择x 和y的值才能使士兵们以最少的总移动步数排成一列。
实验任务：计算使所有士兵排成一行需要的最少移动步数。-In a grid divided into the playground, n soldiers stood scattered on the grid points. Grid point by the integer coordinates (x, y) express. Soldiers along the edge of the grid, down, left and right moving step, but at the same time any one grid point has only one soldier. In accordance with the officer s command, the soldiers should be neatly列成level queue, that is arranged in (x, y), (x+ 1, y), ..., (x+ N-1, y). How to choose x and y values to make the soldiers with the minimum of the total moves one line up. Experimental tasks: the calculation so that all the soldiers lined up his required minimum moves.
- 2023-03-23 13:10:03下载
- 积分：1
-
图论中最小生成树Kruskal算法 及画图程序 M
图论中最小生成树Kruskal算法 及画图程序 M-函数
格式 [Wt,Pp]=mintreek(n,W)：n为图顶点数,W为图的带权邻接矩阵，不构成边的两顶点之间的权用inf表示。显示最小生成树的边及顶点, Wt为最小生成树的权,Pp(:,1:2)为最小生成树边的两顶点,Pp(:,3)为最小生成树的边权,Pp(:,4)为最小生成树边的序号 附图,红色连线为最小生成树的图
例如
n=6 w=inf*ones(6)
w(1,[2,3,4])=[6,1,5] w(2,[3,5])=[5,3]
w(3,[4,5,6])=[5,6,4] w(4,6)=2 w(5,6)=6
[a,b]=mintreek(n,w)
-Graph theory Kruskal minimum spanning tree algorithm and Paint program M-function format [Wt, Pp] = mintreek (n, W): n for the map Vertices, W for weighted graph adjacency matrix, does not constitute the edge of the two vertices of between the right to express with inf. Show the minimum spanning tree of edges and vertices, Wt right for the Minimum Spanning Tree, Pp (:, 1:2) for the minimum spanning tree edges of the two vertices, Pp (:, 3) for the minimum spanning tree of the right side, Pp ( :, 4) For the minimum spanning tree graph edge serial number, red connection for the minimum spanning tree of graph such as n = 6 w = inf* ones (6) w (1, [2,3,4]) = [ 6,1,5]
- 2022-01-30 21:32:39下载
- 积分：1
-
Systemview 动态系统分析及通信系统仿真设计最全的版本共15章
Systemview 动态系统分析及通信系统仿真设计最全的版本共15章-Systemview Dynamic Systems Analysis and Design of Communication System Simulation version of the most wide a total of 15 chapters
- 2022-02-02 09:24:28下载
- 积分：1
-
嵌入式系统的C语言,是底层软件开发的必备语言
嵌入式系统的C语言,是底层软件开发的必备语言-Embedded System C language, software development is an essential underlying language!!
- 2022-07-19 02:39:03下载
- 积分：1
-
Verilog Coding Style for Efficient Digital Design
Verilog Coding Style for Efficient Digital Design
- 2022-03-04 03:46:20下载
- 积分：1
-
网络工程师历年试题以及答案2009年最新更新版
网络工程师历年试题以及答案2009年最新更新版-Network engineers over the years as well as answers to examination questions in 2009 latest update
- 2023-04-30 01:00:04下载
- 积分：1
-
java入门经典教程,适合初学者
java入门经典教程,适合初学者-classic guide, for beginners
- 2022-07-11 04:44:19下载
- 积分：1
