图计算服务如何创建

class Vertex:
    def __init__(self, id, data):
        self.id = id
        self.data = data

class Edge:
    def __init__(self, src_id, dst_id, weight):
        self.src_id = src_id
        self.dst_id = dst_id
        self.weight = weight

graph = {
    'vertices': {
        1: Vertex(1, {'name': 'Alice'}),
        2: Vertex(2, {'name': 'Bob'}),
        3: Vertex(3, {'name': 'Charlie'})
    },
    'edges': [
        Edge(1, 2, 0.5),
        Edge(2, 3, 0.3),
        Edge(3, 1, 0.2)
    ]
}

def shortest_path(graph, start_id):
    distances = {vertex_id: float('inf') for vertex_id in graph['vertices']}
    distances[start_id] = 0
    visited = set()

    while len(visited) < len(graph['vertices']):
        current_id = min((set(distances.keys()) - visited), key=distances.get)
        visited.add(current_id)

        for edge in graph['edges']:
            if edge.src_id == current_id:
                new_distance = distances[current_id] + edge.weight
                if new_distance < distances[edge.dst_id]:
                    distances[edge.dst_id] = new_distance

    return distances

result = shortest_path(graph, 1)
print(result)