Search - distance between the nodes

[WinSock-NDIS] DistanceVector_Routing

Description: Distance Vector Routing，也称为Bellman-Ford shortest path algorithm。基本思想是：每个路由器（路由结点）都维持一张路由表，包括路由的目的地(V)和路由的距离(D)。每个路由器都定期与相邻结点交换路由表信息，据此更新它们自己的路由表。所有结点都监听从其它结点传来的路由表，并按照下列规则更新其路由表： -发现了一条到达某目的结点的新路由，而该路由在原来的路由表中不存在（即发现了一条新路由），则在路由表中增加该路由。 -发现了一条到达某目的结点的、距离更短的新路由，则用该路由替换原有的路由。 -到达某目的结点的一条路由，其后继结点到达该目的地的距离发生了变化，则需要更新该路由的距离。本文件中包含详细的源代码和注释，以实现利用距离向量算法更新路由表的功能。-Distance Vector Routing, also known as the Bellman-Ford shortest path algorithm. The basic idea is : Each router (routing nodes) has maintained a routing table, the destinations include routing (V) and the routing of distance (D). Each router regularly with neighboring nodes to exchange routing table information, updated accordingly their own routing table. All nodes are monitored from other nodes sent a routing table, and in accordance with the following rules to update its routing table : - found a purpose to reach a node of the new routing, The routing of the original routing table does not exist (that is, found a new routing), the routing table to increase the routing. - Found a purpose to reach an end point, the short distance between the new routing, the router can be used to replace
Platform: | Size: 3027 | Author: agang | Hits:

[Other] short-road

Description: 对一个运输商来说要把货运到收货地点选择最短的路线运输是其实现最大利润的要求，那么怎样选择最短的运输路线呢？在运输交通图中，我们设每一个城市为一个结点（vertextype类型）点并把他们分别用关键字代表（关键字int key ），也就是说把每个城市给出一个整数编码；一个城市直接到另一个城市的交通路线为边且这两个城市为相邻结点，不妨设这条路线的距离为边的权值（权值int weight ），易知距离越短运费就越低。这样就可以建立一个无向有权图，那么求最短的运输路线问题就转化为求图中一顶点到其余各个顶点的最短路径问题了。-right to run a transport freight to the place of receipt to choose the shortest route transportation is the biggest achievement of their profits to the request, then how to choose the shortest route? In the transportation plan, We set up a city for every one node (vertextype type) and point them were used on behalf of the keyword (keyword int key), each city is given an integer coding; one city to another city direct traffic routes to the edge and the two neighboring cities nodes, may wish to set up this line of the distance between the edge weights (weights int weight), Yi known as short distance from the lower the freight. This can be established without a map to the right, then seeking the shortest route into the problem for a map of the rest of Vertex Vertex all the shortest path probl
Platform: | Size: 2781 | Author: kmisong | Hits:

[Other] dijkstra

Description: calculates the shortest path and distance between two nodes on a map
Platform: | Size: 2876 | Author: 张莹 | Hits:

[Internet-Network] DistanceVector_Routing

Description: Distance Vector Routing，也称为Bellman-Ford shortest path algorithm。基本思想是：每个路由器（路由结点）都维持一张路由表，包括路由的目的地(V)和路由的距离(D)。每个路由器都定期与相邻结点交换路由表信息，据此更新它们自己的路由表。所有结点都监听从其它结点传来的路由表，并按照下列规则更新其路由表： -发现了一条到达某目的结点的新路由，而该路由在原来的路由表中不存在（即发现了一条新路由），则在路由表中增加该路由。 -发现了一条到达某目的结点的、距离更短的新路由，则用该路由替换原有的路由。 -到达某目的结点的一条路由，其后继结点到达该目的地的距离发生了变化，则需要更新该路由的距离。本文件中包含详细的源代码和注释，以实现利用距离向量算法更新路由表的功能。-Distance Vector Routing, also known as the Bellman-Ford shortest path algorithm. The basic idea is : Each router (routing nodes) has maintained a routing table, the destinations include routing (V) and the routing of distance (D). Each router regularly with neighboring nodes to exchange routing table information, updated accordingly their own routing table. All nodes are monitored from other nodes sent a routing table, and in accordance with the following rules to update its routing table :- found a purpose to reach a node of the new routing, The routing of the original routing table does not exist (that is, found a new routing), the routing table to increase the routing.- Found a purpose to reach an end point, the short distance between the new routing, the router can be used to replace
Platform: | Size: 3072 | Author: agang | Hits:

[Data structs] bestroute

Description: 运行应用本程序，输入节点个数n以及m各个节点的三元组信息。ｍ个三元组（ｉt，ｊt，ｆt）,t＝1、2、……、m，两个节点ｉt和ｊt之间有双向连接的直接连接，其距离为ｆt。输入节点ｇ（１≤ｇ≤ｎ），程序将计算出可以由ｇ达到的每个节点的最佳路由。并在显示器上输出运行结果。-Run the application of this procedure, enter the node number n and m nodes in all three groups of information. m a triple (it, jt, ft), t = 1,2, ... ..., m, two nodes between it and jt direct connection bi-directional connections, the distance of ft. Enter the node g (1 ≤ g ≤ n), the procedure will be calculated by each node g to achieve the best routing. And display the output results.
Platform: | Size: 169984 | Author: 周钰川 | Hits:

[Internet-Network] luyousuanfa

Description: 1、发现它的邻居节点，并知道其网络地址。 2、测量到各邻居节点的延时或开销。 3、构造一个分组，分组中包含所有它刚刚知道的信息。 4、将这个分组发送给所有其他的路由器。 5、计算出到每个其他路由器的最短距离。 -1, found in its neighbor nodes, and to know its network address. 2, measured to the neighbor node latency or overhead. 3, constructs a packet, packet contains all the information it had just know. 4, this packet sent to all other routers. 5, calculated to each other the minimum distance between routers.
Platform: | Size: 1024 | Author: dingdangmao | Hits:

[Mathimatics-Numerical algorithms] 5

Description: 5. 定义二叉树两个结点的最小距离为这两个结点的最近公共祖先分别到这两个结点的路径长度之和。请设计一种方法，找出给定二叉树中任意两个结点的最小距离，可以考虑以图形显示之-5. The definition of binary tree of two nodes for a minimum distance between two nodes, respectively, the most recent public ancestors to these two nodes and the path length. Please design a method to identify a given binary tree any two nodes in a minimum distance between a graphical display could be considered the
Platform: | Size: 705536 | Author: caiqiang | Hits:

[matlab] dijkstra

Description: dijkstra算法解决路径规划问题，求解任意两点之间的最小距离-Dijkstra s Shortest Path Algorithm calculates the shortest path and distance between two nodes on a map
Platform: | Size: 14336 | Author: spf | Hits:

[Data structs] shuanfa2

Description: 求图的任两结点间的距离，(2) 用二维数组存放C和A ，C是原成本矩阵，A 是求出的距离矩阵 (3) 算法采用三重循环，其中最外层的循环变量必须代表中间结点，中层的循环变量代表头结点而内层循环变量代表尾结点。 (4) 试着把三层循环变量的顺序作些改变，最外层的循环变量仍代表中间结点，而中层循环变量代表尾结点，内层循环变量代表头结点。把两种做法所得结果作比较,看结果是否相同 (5) 显示结果要清晰易懂 (6) 本题运行结果 -Order to map any of the distance between two nodes, (2) with two-dimensional array of storage C, A, C is the original cost matrix, A is to find the distance matrix (3) The algorithm uses the triple loop, one of the most outer loop variable must be representative of intermediate nodes, the middle loop variable represents the first node and the inner loop variable represents the end nodes. (4) tried to three-loop order of the variables to make some changes, the most outer loop variables still represent intermediate nodes, while the middle loop variable represents the end nodes, the inner loop variable represents the first node. The two approaches to compare the results to see whether the results the same (5) shows the results must be clear and understandable (6) The question running results
Platform: | Size: 955392 | Author: lixiang | Hits:

[File Operate] MinDistTest

Description: 一个查找带权拓扑图中，任意两点最短距离的算法函数，函数名为MinDis，开发环境是vc6.0，界面和工程只是举了个例子，测试下10个节点中任意两个节点查找最短路径。 -Find the right one with a topology, the shortest distance between any two points in the algorithm function, the function is named MinDis, the development environment is vc6.0, interface, and works to cite only an example to test the next 10 nodes to find any two nodes in the shortest路径.
Platform: | Size: 29696 | Author: 黄志 | Hits:

[source in ebook] RoutinginZigBee

Description: An IEEE 802.15.4-based Wireless Sensor Network is considered, and the relationship between the IEEE 802.15.4 topology formation mechanism and possible routing strategies at the network layer is studied. Two alternative routing schemes proposed in the framework of the ZigBee Alliance are analyzed.The first is the well-known Ad-hoc On demand Distance Vector (AODV) routing protocol, which was designed for highly dynamic application scenarios in wireless ad-hoc networks. The second is a tree-based routing scheme based on a hierarchical structure established among nodes during the network formation phase. This latter approach, referred to as HERA (HiErarchical Routing Algorithm) in the paper, routes packets from sensors to sink based on the parent-child relationships
Platform: | Size: 173056 | Author: HArry | Hits:

[Other] bitree_node_longest_distance

Description: 计算二叉树中距离最远的两个结点之间的距离，程序非常清楚易读。-Calculated from the binary tree in the farthest distance between two nodes, the program is very clear and legible.
Platform: | Size: 1024 | Author: Crane | Hits:

[Industry research] Novel_Method_for_Optimal_Number_of_Cluster_Heads_

Description: Abstract: The optimal number of cluster heads is an important parameter of wireless sensor network performance. Network nodes will consume more energy if the number of cluster heads is too much or too little. This paper focuses on novel calculation method for ptimal number of cluster heads. Base on the analysis of LEACH energy dissipation model,novel lation method is derived from the total energy dissipation of a round. Simulation shows the relationship of the optimal number of cluster heads, the number of frames in steady state phase and the distance between cluster heads and base station (BS).And it provides a theoretical basis for calculation of optimal number of cluster heads which can reduce the energy consumption among nodes and achieves an improvement on the network lifetime.
Platform: | Size: 260096 | Author: Amir | Hits:

[Special Effects] searchnearestnode

Description: 程序实现给定平面上N个点的坐标，找出距离最近的两个点.程序中是两种方法寻找最近点对。解法一的时间复杂度是O(N^2)解法二的时间复杂度是（N*lg2/lgN)第二种方法较第一种方法在一维情况下，时间复杂度改进了不少。但是这个方法不能推广到二维的情况，因为距离最近的点对不能保证是影射到某条直线之后紧靠着的两个点。-the procedure can realize the Coordinate which have N nodes ,find the nearest distance between two nodes.
Platform: | Size: 1024 | Author: 徐天扬 | Hits:

[Windows Develop] newsearchthenearestnode

[Ftp Client] 1

Description: 实验一熟习几个基本网管命令实验三协议分析软件的应用实验四数据冗余实验五使用C++实现计算结点间最短距离实验六熟悉ftp指令 -A few basic network test commands to familiarize themselves with the three experimental protocol analysis software application test four data redundancy using C++ test five computing nodes to achieve the shortest distance between the six familiar with the ftp command Experiment
Platform: | Size: 1388544 | Author: 王心 | Hits:

[Data structs] prim

Description: 输入结点和各结点之间的距离，构造最小生成树并输出。-Input nodes and the distance between the nodes to construct the minimum spanning tree and output.
Platform: | Size: 1024 | Author: 赵明敏 | Hits:

Category

Source Code

Web/Internet

Develop Tools

Document

Other

Search in results

OS

Platform

Language

File Type

Search list