搜索资源列表
Shortest-path
- 因特网最短路径优先(OSPF)路由算法的实现：根据给定的网络拓扑图求某路由器到其它路由器的最短路径，并生成路由表-Internet Shortest Path First (OSPF) routing algorithm to achieve: given the network topology of a router to other routers find the shortest path, and generate routing tables
print-ANN
- 绘制人工神经元网络拓扑图，解决绘制神经元网络拓扑图坐标问题。-print ANN topological graph,solve the problem of the position of the nural cell.
tuoputu
- 该程序可以实现网络拓扑图自动生成·是进行网络仿真拓扑图生成不可缺少的一部分，根据matlab下的程序修改过来，可以在VC环境下运行-The program can achieve network topology automatic generation is topological of network simulation is an indispensable part of, according to the procedure under Matlab modified, can ru
Genetic-algorithm
- 此段程序是一套完整的设计程序（包括拓扑图、分析表），运用遗传算法优化解决路径规划问题。-The procedures of this section is a complete set of design procedures (including topology, analysis, table), the use of genetic algorithm optimization to solve the path planning problem.
PSO
- 针对传统的算法如遗传算法、粒子群算法等在TSP问题上求解精确性和求解规模上都还有一定的不足，本文提出了一种基于动态规划思想的粒子群优化算法。该算法用动态规划的方法实现粒子间的信息交互和粒子的进化，并且将粒子群中的粒子按无标度信息指导网络拓扑图的方式进行连接。仿真结果表明该方法能有效地减小误差率，提高解的精确，同时还保持了较低的计算复杂度，具有良好的稳健性。-TSP problem solving for the traditional algorithms such as genetic alg
Differential-Equations
- 解带时滞微分方程的两个例子，拓扑图请读者根据代码中的邻接矩阵自行构造-Two examples of the solution with Delay Differential topology diagram based on the adjacency matrix code reader to construct their own
dv-hop-location-algorithm
- 基于信标节点的DV HOP算法，能够输出节点拓扑图和未知节点误差图-DV HOP algorithm based on beacon node to output node topology and unknown node error figure
topc
- 对柔顺机构c型夹的刚度拓扑优化，采用分层优化方法，最后得到最大刚度的c型夹拓扑图。-The c clamp stiffness topology optimization of compliant mechanism, using hierarchical optimization method, finally get the maximum stiffness c topology.
top3
- 由99行经典拓扑优化程序修改，对多工况下的悬臂梁进行刚度优化,得到最优拓扑图。-By 99 lines of classical topology optimization program modification, the cantilever beams stiffness optimization of operating conditions.
BandWidthPrior
- 用户输入节点总数、拓扑层数、流量矩阵，生成拓扑图。另可去掉注释再输入流量分配矩阵，得出带链路利用率的拓扑图。-User input total number of nodes, topology layers, traffic matrix, generated topology. Another comment may be removed and then enter the traffic distribution matrix, derived topology with link ut
netplot
- 社交网络网络拓扑图，可以得出每个节点的连接关系-Social network network topology, you can draw the connection of each node
MCMF
- 亲自手写 将路一个网络拓扑图（！针对有向图）利用最小费用最大流方法求最佳路径，C语言（曾在huawei codecraf 2017赛题中使用，效果良好）。-Hand to hand a road topology map (For directed graphs) Use the minimum cost maximum flow method to find the best path, C language (used in huawei codecraf 2017 issue, t
复杂网络中基本网络模型的matlab实现
- 复杂网络的matlab实现，得到不同规模的BA无标度网络、WS小世界网络、随机网络、规则网络的拓扑图。还有各类型的拓扑度分布、聚集系数、平均最短路径等静态特性的实现。(Matlab implementation of complex networks, BA scale networks of different sizes, WS small world networks, random networks and regular networks are obtained. There are
Dijkstra
- DIJSTRA算法实现拓扑图上的最短路径规划(DIJSTRA algorithm based on topology map)
All-in-one_2_0
- 建立ISP拓扑结构，生成拓扑图，选择路径，构建路径(Build ISP topology, generate topology diagram, select path, build path)