V-D矢量距离路由 代码

以下是一个简单的V-D矢量距离路由的示例代码：

import math

class Router:
    def __init__(self, id):
        self.id = id
        self.vector = {}

    def add_link(self, neighbor, distance):
        # 添加邻居节点与距离
        self.vector[neighbor.id] = distance

    def send_vector(self):
        # 返回本节点的矢量距离表
        return self.vector

    def receive_vector(self, neighbor_vectors):
        # 更新本节点的矢量距离表
        for neighbor_id, neighbor_vector in neighbor_vectors.items():
            if neighbor_id not in self.vector:
                # 如果邻居节点是新的，则添加到本节点的矢量距离表中
                self.vector[neighbor_id] = neighbor_vector[self.id] + self.vector.get(self.id, 0)
            else:
                # 否则，更新到本节点的矢量距离表中
                self.vector[neighbor_id] = min(neighbor_vector[self.id] + self.vector.get(self.id, 0), self.vector[neighbor_id])

    def get_shortest_path(self, destination):
        # 获取从本节点到目标节点的最短路径
        path = [destination.id]
        current_node = destination
        while current_node.id != self.id:
            for neighbor_id, neighbor_distance in current_node.vector.items():
                if neighbor_id == self.id:
                    continue
                if neighbor_distance + self.vector[current_node.id] == self.vector[self.id]:
                    path.append(current_node.id)
                    current_node = Router(neighbor_id)
                    break
        path.append(self.id)
        path.reverse()
        return path

# 创建一些节点
A = Router('A')
B = Router('B')
C = Router('C')
D = Router('D')

# 添加相邻节点与距离
A.add_link(B, 2)
A.add_link(C, 3)
B.add_link(A, 2)
B.add_link(C, 1)
B.add_link(D, 4)
C.add_link(A, 3)
C.add_link(B, 1)
C.add_link(D, 5)
D.add_link(B, 4)
D.add_link(C, 5)

# 各节点开始交换矢量距离表
for router in [A, B, C, D]:
    neighbor_vectors = {}
    for neighbor in router.vector:
        neighbor_vectors[neighbor] = Router(neighbor).send_vector()
    for neighbor_vector in neighbor_vectors.values():
        router.receive_vector(neighbor_vector)

# 输出各节点的矢量距离表
for router in [A, B, C, D]:
    print(f"{router.id}: {router.vector}")

# 获取从A到D的最短路径
print(A.get_shortest_path(D))

运行此代码将输出每个节点的矢量距离表和从A到D的最短路径。您可以根据需要进行修改和扩展。