用c将加权边添加到链表图中

#include <stdio.h>
#include <stdlib.h>

// 表示图中顶点的结构体
typedef struct Node {
    int value;
    struct Node* next;
} Node;

// 表示加权边的结构体
typedef struct Edge {
    int start;
    int end;
    int weight;
} Edge;

// 添加加权边到链表图中的函数
void addWeightedEdge(Node* graph[], int start, int end, int weight) {
    // 创建新节点表示结束顶点
    Node* newNode = (Node*)malloc(sizeof(Node));
    newNode->value = end;
    newNode->next = NULL;

    // 找到起始顶点对应的链表节点
    Node* currentNode = graph[start];
    while (currentNode->next != NULL) {
        currentNode = currentNode->next;
    }

    // 将新节点插入到链表中
    currentNode->next = newNode;
}

int main() {
    // 创建图的顶点
    Node* graph[5];
    for (int i = 0; i < 5; i++) {
        graph[i] = (Node*)malloc(sizeof(Node));
        graph[i]->value = i;
        graph[i]->next = NULL;
    }

    // 创建加权边
    Edge weightedEdges[3];
    weightedEdges[0].start = 0;
    weightedEdges[0].end = 1;
    weightedEdges[0].weight = 2;

    weightedEdges[1].start = 1;
    weightedEdges[1].end = 2;
    weightedEdges[1].weight = 3;

    weightedEdges[2].start = 2;
    weightedEdges[2].end = 3;
    weightedEdges[2].weight = 4;

    // 添加加权边到链表图中
    for (int i = 0; i < 3; i++) {
        addWeightedEdge(graph, weightedEdges[i].start, weightedEdges[i].end, weightedEdges[i].weight);
    }

    // 打印链表图
    for (int i = 0; i < 5; i++) {
        Node* currentNode = graph[i];
        printf("顶点 %d 的相邻顶点：", i);
        while (currentNode->next != NULL) {
            currentNode = currentNode->next;
            printf("%d ", currentNode->value);
        }
        printf("\n");
    }

    return 0;
}