资源列表
shortest
- 本程序编写了一个dijkstra算法求解最短路问题，在turboc2.0环境下编译成功。
e1
- 16点基4—FFT算法编程。输入16点的序列，采用基4-fft方法计算其快速傅里叶变换。-16 points-based 4-FFT algorithm for programming. Enter the 16-point sequence, with the base 4-fft method for calculating the fast Fourier transform.
dlb_lqr11
- 一级倒立摆系统采用最优控制的方法，改变状态增益系数K，最后使系统达到平衡。-Inverted pendulum system using optimal control methods to alter the state of the gain coefficient K, the last to make the system balanced.
ex
- 迭代法解二维泊松方程，为《计算电磁学》中第一篇第二章有限差分法中的一个例题的程序-Iteration two-dimensional Poisson equation for the " computational electromagnetics," in the first chapter of a finite difference method program example
establish-and-travel
- 二叉树的建立（固定数字）及用前序遍历法周游并输出。-The establishment and use of binary tree traversal method before travel and output.
BP
- BP遗传算法神经网络仿真程序，对遗传算法进行研究-BP genetic algorithm neural network simulation program, the genetic algorithms research
quzao
- 用程序实现神经网络的应用，图像的几种处理方法。-With the application of neural network program realization, image processing method of several.
jvzhenliancheng
- 矩阵连乘 动态规划问题 输出n个矩阵相乘最小的结果-printf number which is the smallest of the N-matrix
The-median
- 求一个数组中的中位数。当数组中数据位奇数时比较好求，而当其位偶数数该如何处理呢。本程序实现了这两种不通情况下的中位数。-Seeking an array median. When the array data bit odd good demand, and when its bit even number of number of how to deal with it. This program implements the median of these two barrier case.
1
- 已知学生三门课程基本信息如下。请使用结构体编程，计算学生三门课程成绩后，列表输出 学生的姓名、数学、英语、计算机、平均分信息，并按平均分排序。-The following basic information known to students three courses. List output structure programming, computing students three course grade the student' s name, mathematics, E
Degree_Distribution
- 一种计算度分布的子程序，可以添加到其它主程序中计算其它网络的度分布-Subroutine for calculating the distribution, the main program can be added to other computing other networks distribution
Console6
- 利用相场法模拟金属凝固过程中的中心枝晶的生长和演变过程，后期数据需要用到matlab处理，比较简单，若有需要，可以上传-The growth and evolution of the use of phase- field simulation of metal during solidification dendrite center, the latter need to use matlab data processing is relatively simple, if necessar