调整相邻列表c++的边和顶点的大小

#include <iostream>
#include <vector>
using namespace std;

// 定义节点
struct Node {
    int target;
    int weight;
    // 其他与顶点相关的信息
};

// 定义相邻列表
typedef vector<vector<Node>> AdjList;

// 添加边
void addEdge(AdjList& graph, int source, int target, int weight) {
    Node newNode;
    newNode.target = target;
    newNode.weight = weight;
    // 其他与顶点相关的信息
    graph[source].push_back(newNode);
}

int main() {
    int numVertices = 5;
    AdjList graph(numVertices);

    // 添加边
    addEdge(graph, 0, 1, 10);
    addEdge(graph, 0, 2, 5);
    addEdge(graph, 1, 3, 7);
    addEdge(graph, 2, 3, 2);
    addEdge(graph, 2, 4, 8);
    
    // 调整边和顶点的大小
    graph[0][0].weight = 15; // 调整第一条边的权重
    // 调整其他边和顶点的大小

    // 输出调整后的图
    for (int i = 0; i < numVertices; i++) {
        cout << "顶点 " << i << " 的相邻列表: ";
        for (const Node& node : graph[i]) {
            cout << "(" << node.target << ", " << node.weight << ") ";
        }
        cout << endl;
    }
    
    return 0;
}