搜索资源列表
非终端结点
- 求非终端结点的算法-for non-terminal nodes algorithm
eightnumbyahei0802
- 八数码难题求解程序本程序所采用的启发函数,本人不能证明它能解决任何的八数码难题,如果对于较难的问题会产生很多节点,有可能会使空间不足,所以尽量不要出太难的问题难为它.希望广大的人工智能爱好者能写出更好的启发函数.-eight digital problem solving program of the procedures used by the heuristic function, I can not prove that it c
salesman-temp
- 货郎担 最短路径问题 用链表储存最短路径节点-traveling salesman problem using the shortest path Listless storage nodes Shortest Path
3dbeam_stiffness
- 用matlab编写的，有限元三维梁单元的单元刚度矩阵计算程序，各节点6个自由度。-prepared by the three-dimensional finite element beam element of the element stiffness matrix calculation program, the 6-DOF nodes.
six-nodes-barbell-code
- 利用NS-2仿真六节点杠铃结构拓扑机构源代码- the wired network model- six nodes barbell structure simulation and analysis based on NS-2.
NODES
- 提供基于OPNET下几个重要节点模型，包括ALOHA，CSMA和MAC等模型，对于OPNET的理解非常重要-OPNET-based nodes under several important models, including ALOHA, CSMA and MAC and other models, are very important for the understanding of OPNET
TCL-script-to-find-wireless-packet-dropping-nodes
- TCL scr ipt to find wireless packet dropping nodes
nodes-optimization-problem
- 对于节点的优化编号问题,提出了一种改进最小度算法,使其更方便快速-The number of nodes optimization problem, an improved minimum degree algorithm, making it easier and faster
compare-the-different-network-nodes
- 如何比较不同节点的中心性，比如度和k-shell等方面-How central to compare different nodes, such as the degree and the k-shell, etc.
3-nodes-wifi
- NS3下的无线仿真，简单的三个节点之间的通信。-Wireless simulation of a simple communication between three nodes under the NS3.
Uel-plane-unit-3-nodes
- abaqus中3平面单元程序，初学者一点参考-Uel plane unit 3 nodes
the-distribution-of-nodes
- 无线传感器网络是由大量节点组成的，我们在做仿真实验时需要撒布节点，仿真出节点的分布图-Wireless sensor network is composed of a large number of nodes, we needed to do simulation spreading nodes, simulation of the distribution of nodes
the-neighbor-nodes-k-values
- 查找邻居节点k壳值, 查找邻居节点k壳值.-find the neighbour nodes K shell value
33-nodes-trend-technology-program
- 33节点潮流计算 毕业设计论文中可能会用到 总之很牛逼就对了-33 nodes trend technology program
Gauss-quadrature-nodes-and-weights.
- computing the nodes and weights of Gauss-Legendre quadrature.
compute shortest path between nodes
- compute the shortest path between nodes.
Reverse-Nodes-in-k-Group
- 给定一个链表，然后给定一个阈值，每隔这个阈值就反转这几个点-Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.
Swap-Nodes-in-Pairs
- 给定一个链表，对其结点进行两两交换，然后返回结果链表的首结点-Given a linked list, swap every two adjacent nodes and return its head.
seven nodes example
- 北航最优化第一次大作业。多商品流问题的七节点算例，目标函数为极小化FT成本函数和极小化最大弧利用率。(a seven nodes example of multi-product flow)
power flow calculation polar coordinates, with IEEE14 nodes, 30 nodes
- Matlab power flow calculation polar coordinates, with IEEE14 nodes, 30 nodes package