C语言数据结构：数据结构在人工智能中的关键作用

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

// 定义图的结构
struct Graph {
    int V; // 图中的节点数
    int E; // 图中的边数
    int **adj; // 邻接表
};

// 创建一个新的图
struct Graph* createGraph(int V) {
    struct Graph* graph = (struct Graph*)malloc(sizeof(struct Graph));
    graph->V = V;
    graph->E = 0;
    graph->adj = (int**)malloc(V * sizeof(int*));
    for (int i = 0; i < V; i++) {
        graph->adj[i] = (int*)malloc(V * sizeof(int));
    }
    return graph;
}

// 添加一条边到图中
void addEdge(struct Graph* graph, int u, int v) {
    graph->adj[u][v] = 1;
    graph->adj[v][u] = 1;
    graph->E++;
}

// 打印图的邻接表
void printGraph(struct Graph* graph) {
    for (int i = 0; i < graph->V; i++) {
        for (int j = 0; j < graph->V; j++) {
            printf("%d ", graph->adj[i][j]);
        }
        printf("\n");
    }
}

// 主函数
int main() {
    // 创建一个具有 4 个节点的图
    struct Graph* graph = createGraph(4);

    // 添加边
    addEdge(graph, 0, 1);
    addEdge(graph, 0, 2);
    addEdge(graph, 1, 2);
    addEdge(graph, 2, 3);

    // 打印图的邻接表
    printGraph(graph);

    return 0;
}