这是一个关于一个节点网络中的最大流量的算法，给出各节点权值，输出最大流量-This is a node on a network of maximum flow algorithm, the node is the right value, the largest export volume

局域网分布实时仿真中时统系统的一种实现方法的时间节点程序-LAN distributed real-time simulation system at the EC as a method of time node procedure

Distance Vector Routing，也称为Bellman-Ford shortest path algorithm。基本思想是： 每个路由器（路由结点）都维持一张路由表，包括路由的目的地(V)和路由的距离(D)。每个路由器都定期与相邻结点交换路由表信息，据此更新它们自己的路由表。所有结点都监听从其它结点传来的路由表，并按照下列规则更新其路由表： -发现了一条到达某目的结点的新路由，而该路由在原来的路由表中不存在（即发现了一条新路由），则在路由表中增加该路由。 -发现了一条

In AODV, routes are discovered in an on-demand basis and are maintained as long as they are required. Like DSDV it maintains a sequence number, which it increases each time it finds a change in the topology of its neighborhood. This sequence number e