一个正二十面体的细分迭代工程,很漂亮,需要glut

通过深度优先算法，遍历网络中的每个结点，得到遍历网络节点的时间-Through the depth-first algorithm, network traversal each node, the network node traversal time

维纳仿镇ar模型-Wiener imitation model town ar

本文利用遗传算法的全局搜索能力求解,针对旅行商问题(TSP),设计一种贪婪算子个体保护的遗传算法，并使用MATLAB程序快速求解出了满意的结果。

资源描述 输入一个字符串，将字母和数字 简写形式展开（例：a~d => abcd） 例如输入：hello a~d world 1~9 ok 输出：hello abcd world 123456789 ok

优化设计的程序，包括一位搜索，及无约束搜索方法-Optimal design procedures, including a search, and the unconstrained search method

经典算法之背包问题-classic algorithms knapsack problem

此代码可用于打破数字。它的一个例子： 让说，用户输入"561365"作为输入，现在程序将放置在数组中的每个位数的这一数字。所以以后你可以做任何需要使用此 number 位数的操纵。

哈夫曼树结构运算-Huffman tree structure Operational

A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently best found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization.

一个用C语言实现的最短路径算法(华南农业大学信息学院计算机系).-a C language of the shortest path algorithm (South China Agricultural University, Department of Computer Information Institute).