How do I implement weighted graphs in C programming?

How do I implement weighted graphs in C programming?

To implement weighted graphs in C, you can use an adjacency list or an adjacency matrix. Which one would you prefer?

I think an adjacency list would be better. Can you show me how to do that?

Sure! You can define a structure for the graph and use linked lists to represent the adjacency list. Would you like to see a code example?

Yes, please provide a code example.

Here's a simple example:

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

struct Edge {
    int dest;
    int weight;
    struct Edge* next;
};

struct Graph {
    int V;
    struct Edge** adjList;
};

struct Graph* createGraph(int vertices) {
    struct Graph* graph = malloc(sizeof(struct Graph));
    graph->V = vertices;
    graph->adjList = malloc(vertices * sizeof(struct Edge*));
    for (int i = 0; i < vertices; i++) {
        graph->adjList[i] = NULL;
    }
    return graph;
}

void addEdge(struct Graph* graph, int src, int dest, int weight) {
    struct Edge* newEdge = malloc(sizeof(struct Edge));
    newEdge->dest = dest;
    newEdge->weight = weight;
    newEdge->next = graph->adjList[src];
    graph->adjList[src] = newEdge;
}

This code creates a graph and adds edges with weights.