搜索资源列表
java网络编程实例
- Java各种网络代码，方便了java开发者，加快了程序员的开发进程。 -Java code various networks, and facilitates the java developers, programmers accelerate the development process.
GLVQBP
- 本算法采用LVQ竞争学习网络，本算法先用分类再用bp算法进行预测。-the algorithm used LVQ competitive learning networks, the algorithm using the classification algorithm reuse bp forecast.
zuixiaoshengchengshu
- 最小生成树问题 若要在n个城市之间建设通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。 （1）利用克鲁斯卡尔算法求网的最小生成树。 （2）实现教科书6.5节中定义的抽象树类型 MFSet。以此表示构造生成树过程中的连通分量。 （3）以文本形式输出生成树中各条边以及他们的权值。 -minimum spanning tree problem to the n-city building communications netw
BA-BBV-code
- 小世界 bbv网络生成仿真软件 可以模拟两个网络的演化-Generate small-world bbv network simulation software can simulate the evolution of the two networks
Floyd
- Floyd 算法，创建有向图，无向图，有向网，无向网的算法-Floyd algorithm, create a directed graph, undirected graph, directed networks, undirected networks algorithm
Prime
- Prime 算法，创建有向图，无向图，有向网，无向网的算法-Prime algorithms, to create a directed graph, undirected graph, directed networks, undirected networks algorithm
ERN
- a transmission line fault location model which is based on an Elman recurrent network (ERN) has been presented for balanced and unbalanced short circuit faults. All fault situations with different inception times are implemented on a 380-kV proto
neuralnetworks
- 此为一个关于神经网络的简单程序-This is a simple program neural networks !!!!!!!!
zuiduanluyou
- 计算机网络路由算法中的距离向量算法方法,这是源程序,学计算机网络的应该都知道-Computer networks in distance vector routing algorithm method, which is the source from computer network should know
luyoubiao
- 路由表算法设计实现，计算机通信网课程设计可用的到-Routing table algorithm design and implementation, curriculum design of computer communication networks available to
Manhattan
- 在 VLSI 设计中,多点互连是物理设计阶段的关键问题之一,而互连的点数等于 2 或大于 2 分别对应于 Manhattan 空间上有障碍时的最短路径问题和最小 Steiner 树问题,显然前者是后者的基础.连接图是研究最短路径 问题的有效工具,已有的典型连接图包括基于轨迹的GC 和GT 以及基于自由区的GF 和GG.工作包括3个方面:设计并分析了在各种连接图上实现动态的点对之间的最短路径查询算法 分析了在各个连接图上构造 3-Steiner 树的算 法,对于已有的 GC 上的 3-
programmer-interview
- 介绍了C程序设计，数据结构，操作系统，数据库和网络方面经典的面试题，很有参考价值，适合人手一本-Describes the C programming, data structures, operating systems, databases and networks classic interview questions, a good reference for staffing a
1-103
- 有向图，有向网，无向图，无向网的邻接表存储、增删顶点和边。-Directed graph, directed networks, undirected graph without adjacent to the network table to store, add and delete vertices and edges.
hafman
- 最优算法分析 快排 二叉树 哈弗曼 和计算机网络-Fast optimal algorithm for scheduling and computer networks binary Hafu Man
Kruskal.zuixiaoshengchengshu
- 若要在n个城市之间建立通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题-To establish communication networks between n cities, only need to set up the n-1 lines can be. The lowest economic cost of construction communication network is a network of minimum spanni
(Kruskal
- 若要在6个城市之间建立通信网络，只需要架设5条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题-To establish communication networks between 6cities, only need to set up the 5 lines can be. The lowest economic cost of construction communication network is a network of minimum spanning tr
SIR
- 复杂网络研究中的SIR传染病算法。支持Gephi的.net文件结构。-SIR epidemic algorithm in the study of complex networks. Gephi net file structure.
SIS
- 复杂网络研究中的SIS传染病算法。支持Gephi的.net文件结构。-The SIS algorithm of infectious diseases in the study of complex networks. Gephi net file structure.
BA
- 复杂网络研究中的BA网络随机生成算法。支持Gephi的.net文件结构。-BA network in the study of complex networks random generation algorithm. Gephi net file structure.
WS
- 复杂网络研究中的WS网络随机生成算法。支持Gephi的.net文件结构。-The WS networks in the study of complex networks random generation algorithm. Gephi net file structure.