搜索资源列表
2007011402
- 最小树生成算法，用prim算法实现最小树生成-Minimum spanning tree generation algorithm, using prim minimum spanning tree algorithm to generate
UNIXbaogao
- 在一个半径为R的监测区域，随机分布有M个节点，每个节点的感应半径为r，请完成： （1）建立节点的位置信息文件 （2）建立网络的拓扑信息文件 （3）输出最佳路由即最小生成树 -Radius of R in a monitoring region, a random distribution of M nodes, each node of the sensor radius r, please complete: (1) to establish the location of t
kruskals
- Kruskal s algorithm implementation for generating minimum spanning tree. Random network is generated. Then MST is generated using kruskals and then density gradient applied.
surge
- surge apllicationA common application of sensor networks is to sample a sensor periodically (e.g., light or temperature) and report readings to a base station, which is typically a node with a wired network connection and power source. ᠋
333
- 利用图论的知识实现了最小生成树的算法，包括创建图，然后遍历图的每个节点输出生成树的节点-Knowledge of graph theory to achieve the minimum spanning tree algorithms, including the creation of maps, and then traverse the graph spanning tree output nodes for each node
kruscal_Primspanningtree
- 最小生成树两种经典算法,kruscal和Prim算法-spanning tree
RSTP_agreement_research_report
- 快速生成树的汉语学习资料，是对IEEE802.1w的翻译和理解-Rapid Spanning Tree Chinese learning materials, is the translation and understanding IEEE802.1w
rstp-1edafa4.tar
- rstp生成树代码，用于实现各平台rstp协议-rstp Spanning Tree code used to implement each platform rstp agreement
rstplib
- 快速生成树的实现代码，包括注释文字。易于理解学习-Rapid Spanning Tree implementation code, including the comment text. Easy to understand learning
802.1w-2001
- 快速生成树IEEE标准，对802.1d-1998的改进，兼容生成树stp算法-Rapid Spanning Tree IEEE standards, the improvement of 802.1d-1998, compatible stp spanning tree algorithm
Agri_Net
- 最小生成树，Agri_Net问题解决，有详细的代码解释帮助理解-Minimum spanning tree, Agri_Net problem solving, detailed code explained to help understand
Traversing-Graph
- 以用户指定的结点为起点，分别输出深度优先遍历和广度优先遍历下的结点访问序列和相应生成树的边集-As a starting point to a user-specified node, respectively, to output the depth-first and breadth-first traversal node access to the sequence and the corresponding set of edges of the spanning tree
br_stp_bpdu
- Spanning tree protocol BPDU handling Linux ethernet bridge -Spanning tree protocol BPDU handling Linux ethernet bridge
br_stp_timer
- Spanning tree protocol timer-related code Linux ethernet bridge.-Spanning tree protocol timer-related code Linux ethernet bridge.
br_stp
- Spanning tree protocol generic parts Linux ethernet bridge- Spanning tree protocol generic parts Linux ethernet bridge
br_stp_if
- Spanning tree protocol interface code Linux ethernet bridge- Spanning tree protocol interface code Linux ethernet bridge
prim
- 假设G＝(V，E)是连通的，TE是G上最小生成树中边的集合。算法从U＝{u0}（u0∈V）、TE＝{}开始。重复执行下列操作： 在所有u∈U，v∈V－U的边(u，v)∈E中找一条权值最小的边(u0,v0)并入集合TE中，同时v0并入U，直到V＝U为止。-Suppose G = (V, E) is connected, TE minimum spanning tree of G on the set of edges. Algorithm from U = {u0} (u0 ∈ V), TE
hefumanshu
- 赫夫曼树，数据结构算法，赫夫曼书，实现最优生成树-Huffman tree data structure algorithms, Huffman books, optimal spanning tree
platform-mx2-emma
- Spanning tree protocol generic parts for Linux v2.13.6. -Spanning tree protocol generic parts for Linux v2.13.6.
tlb_32
- Spanning tree protocol BPDU handling for Linux v2.13.6. -Spanning tree protocol BPDU handling for Linux v2.13.6.