用c＋＋写的用于FPGA设计中布图布线的工具源码，有几万行程序，包含文档...

cost存放了一个强连通图的边权矩阵，作为一个实例。 可在workspace中加载 运用此算法要注意多次试验。 bianquan.m文件给出了一个参数实例，可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,，回车后再输入jiaohuan3,得到了最优解。 由于没有经过大量的实验，又是近似算法，对于网络比较复杂的情况，可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。-storage cost of a strongly connected graph edge weight matrix, as an example. Can be loaded in the workspace to use this algorithm to the attention of numerous tests. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.

使用遗传算法求解通信网链路容量和流量联合优化分配问题!-Communications network using genetic algorithm for solving the joint optimization of link capacity and flow allocation problem!

这是一种利用神经网络来进行人脸识别的算法。-This is a neural network to the face recognition algorithm.

最短路算法：基于遗传算法的一种最短路的MATLAB程序。-Shortest Path Algorithm: Genetic Algorithm Based on one of the most short-circuit the MATLAB program.

在各种数据源的分析中，收集数据非常重要，本算法提供了一种理论上可以保证性能的聚类算法并提供的相关证明。-Now kneel bowl beat Gou Tai Xu Pleiades cavity中， receive Moreton basin quasi-grind are linked to reset lynx ，算Yang Gou feed leftover braise instance, you can upset Article Sinopodisma殿cavity Abduction Chu Chun Kui Yang算sweet feed cavity gaze intently Shouson殿Longde 。

基于梯度法编写的RBF神经网络程序，实现对输入数据的逼近-Gradient method based on the preparation process of the RBF neural network to achieve the approximation of the input data

libneural神经网络C库函数源代码，版本1.0.3.-libneural neural network C library functions source code, version 1.0.3.

c语言编写的蚁群算法源程序，应用于TSP-c language source code of ant colony algorithm applied to TSP

TSP双种群蚁群算法。还包括了“30城市TSP问题数据与最优解.mat”，“75城市TSP问题数据.mat”，和“442TSP问题数据与算法对比.mat”-TSP-Stocks ant colony algorithm. Also include "30 cities TSP data and the optimal solution. Mat, " "75 cities TSP data. mat, " and "442TSP problem with the algorithm for data comparison. mat "

基于贝叶斯的数据挖掘算法的实现,使用visual stutio2005编程实现。-Bayesian data mining algorithm, using the visual stutio2005 programming.