无线传感器网络跳数phython代码

在Python中，实现无线传感器网络（Wireless Sensor Network, WSN）的跳数计算通常涉及到图论算法，比如常见的最短路径算法如Dijkstra算法或者A*算法，因为WSN中的节点可以看作图中的顶点，通信范围可以表示为边的权重。这里给出一个简化版的Dijkstra算法用于计算两个节点之间的最小跳数：

import heapq

def dijkstra(graph, start_node):
    distances = {node: float('infinity') for node in graph}
    distances[start_node] = 0
    queue = [(0, start_node)]
    
    while queue:
        current_distance, current_node = heapq.heappop(queue)
        
        if current_distance > distances[current_node]:
            continue
        
        for neighbor, weight in graph[current_node].items():
            distance = current_distance + weight
            
            if distance < distances[neighbor]:
                distances[neighbor] = distance
                heapq.heappush(queue, (distance, neighbor))
                
    return distances

# 示例：一个简单的邻接矩阵代表无线传感器网络的连接
graph = {
    'A': {'B': 1, 'C': 2},
    'B': {'A': 1, 'C': 1, 'D': 3},
    'C': {'A': 2, 'B': 1, 'D': 4},
    'D': {'B': 3, 'C': 4}
}

# 计算从'A'到'D'的最小跳数
min_jumps = dijkstra(graph, 'A')
print(f"从'A'到'D'的最小跳数是: {min_jumps['D']}")