[数据结构] fishGrowth
数据和代码来自：鱼类生长的能量学及其如何约束食物网营养结构
Data and code from: The energetics of fish growth and how it constrains food- web trophic structure (2018-04-05, HTML, 0KB, 下载0次)
[数据结构] PAT 1066 Root of AVL Tree
自己写的AVLtree，大家看着用吧，是浙大网课上的同步作业
this is so annoying said i don't wont to write anything (2021-01-01, C/C++, 1KB, 下载0次)
[数据结构] jibraryiostqeim
本文通过给定的训练模式为例来推导bp网络学习的算法,并用(语言编程实现,运行程序给出学习误差曲线,最后指出实际应用中BP网 (2018-03-14, MultiPlatform, 211KB, 下载1次)
http://www.pudn.com/Download/item/id/1521013590900370.html[数据结构] zatb
本文通过给定的训练模式为例来推导bp网络学习的算法,并用(语言编程实现,运行程序给出学习误差曲线,最后指出实际应用中BP网 (2017-12-06, C/C++, 211KB, 下载1次)
http://www.pudn.com/Download/item/id/1512535284988394.html[数据结构] pazf
通信网链路容量和流量联合优化分配问题的遗传算法matlab程序
Communication network link capacity and traffic joint optimization allocation problem of matlab genetic algorithm (2017-05-15, matlab, 2KB, 下载1次)
[数据结构] cgltisionrunning
通信网链路容量和流量联合优化分配问题的遗传算法matlab程序
Communication network link capacity and traffic joint optimization allocation problem of matlab genetic algorithm (2017-05-14, matlab, 2KB, 下载4次)
[数据结构] ZGraph
数据结构 无向图
以邻接矩阵的方式存储一个无向网
1.建立并显示出无向网的邻接矩阵；
2.对该无向网进行广度优先遍历，显示遍历的结果（并随时显示队列的入、出情况）；
3.用普里姆算法构造其最小生成树，显示其构造的过程。
Data structure- the undirected graph
Stored in the form of adjacency matrix an undirected network
1. Establish and shows the adjacency matrix of undirected network
2. Breadth-first traversal of the undirected network, shows the result of traversal (and at any time according to queue into or out of)
3. Use she algorithm to construct its minimum spanning tree, according to the construction process. (2014-12-12, Visual C++, 738KB, 下载3次)
[数据结构] tt
采用连接矩阵表示法，构造无向网G,并且对图G进行广度优先遍历。
Connection matrix notation used to construct an undirected network G, and the graph G breadth-first traversal. (2013-11-01, C/C++, 5KB, 下载1次)
[数据结构] prim
Prim算法
用Prim算法从u0出发构造网g的最小代价生成树
Prim Algorithm Prim algorithm constructed starting from u0 minimum cost spanning tree network g (2013-07-10, Visual C++, 1KB, 下载1次)
[数据结构] tcpip
以太网首部的一个c语言程序，代码功能是对设备要传送的帧进行排队
Ethernet header c language program code function is queued frames to be transferred to the device (2013-03-26, Visual C++, 5KB, 下载2次)
[数据结构] 1
建无向图，求每个顶点的度，有向网的创建。拓扑排序。
not to create maps for each of the vertex, is to create the network. Topological sorting. (2012-05-21, C/C++, 1KB, 下载2次)
[数据结构] USACO-chapter1-section1
美国信息学竞赛网的training的题目，第一章的第一板块的源码
usaco computing system，which is to get good player among american to enter IOI! (2012-05-03, C/C++, 2KB, 下载4次)
[数据结构] shujujiegou
数据结构，顺序表，链表，二叉树的基本操作，排序，插入，删除。
Data structure, sequence tables, linked lists, binary tree basic operations, sort, insert, delete. (2011-05-16, C/C++, 2366KB, 下载3次)
[数据结构] changename
控制台程序，用于拷贝一个二进制文件，并从别外一个Ｃ文件中读取某一字符串作为拷贝文件的名称。
copy a binary file and rename it that the name read from the other c file.
you can use the console execute it .
EG.changename cn (2011-04-02, Visual C++, 4142KB, 下载2次)
[数据结构] prim
输入任意的一个网，用普里姆(Prim)算法构造最小生成树。
Enter any one network, with the prim (Prim) algorithm to construct minimum spanning tree. (2010-06-08, Visual C++, 1KB, 下载75次)
[数据结构] Prim
普利姆算法的C++实例演示。用于求无向网的最小代价生成树…………
Pliem algorithm C++ instance of the presentation. Undirected network for minimum cost Spanning Tree ... ... ... ... (2010-06-01, Visual C++, 1KB, 下载21次)
[数据结构] The_shortest_path_based_on_urban_roads_network_pla
基于最短路径的城市干道网规划的算法研究The_shortest_path_based_on_urban_roads_network_planning_algorithm
The_shortest_path_based_on_urban_roads_network_planning_algorithm (2010-03-27, Visual C++, 217KB, 下载5次)
[数据结构] Graph
1．建立无向网的邻接矩阵。
要求：从键盘输入无向网的顶点数和边数；然后以“顶点1，顶点2，权值”的方式输入图的各边，建立邻接矩阵存储，并输出各顶点和邻接矩阵。
2．对无向网进行深度优先遍历，输出遍历序列。
3.判断给定的无向网是否是连通的？
要求：从键盘上输入出发点进行搜索遍历，输出遍历序列。
1. The establishment of the network adjacency matrix.
Requirements: No input from the keyboard to the network, the number of vertices and edges and then, "vertex 1, vertex 2, the right value" means input graph on all sides, the establishment of the adjacency matrix storage, and output of all vertices and adjacency matrix.
2. To the nets for non-depth-first traversal, the output traversal sequence.
3. To determine a given undirected network whether it is connected?
Requirements: from the keyboard to enter a starting point to search traversal, the output traversal sequence. (2010-01-07, Visual C++, 2KB, 下载154次)
[数据结构] zui_xiao_sheng_cheng_shu
最小生成树 一．问题描述 构造一无向连通网，用Prim算法或Kruskal算法实现最小生成树的算法 二．实验目的 1．掌握网的基本概念和连通网的存储结构 2．掌握最小生成树的算法实现 三．实验要求 1．确定边的相邻顶点和权植，建立无向连通网，实现最小生成树。 2．Prim算法思想： 设G=（V，E）是一个无向连通图，令T=（U，TE）是G的最小生成树。T的初始状态为U={v0}，TE={}，然后重复执行下述操作：在所有u，v的边中找一条代价最小的边（u，v）并入集合TE，同时v并入U，直至U=V为止。此时TE中必有n-1条边，T就是最小生成树。 (2008-05-19, Visual C++, 1KB, 下载126次)
http://www.pudn.com/Download/item/id/466766.html[数据结构] 2dDelaunay2
该源码是用构件VC来构件的Delaunay三角网，采用的算法是增长算法。
is the source component to component VC Delaunay triangulation, the algorithm is growing algorithm. (2007-05-13, Visual C++, 1962KB, 下载61次)