Abdelrahman Said
79 lines
1.5 KiB
C
79 lines
1.5 KiB
C
// vim:fileencoding=utf-8:foldmethod=marker
|
|
|
|
// Adjascency List representation in C
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
|
|
struct node {
|
|
int vertex;
|
|
struct node* next;
|
|
};
|
|
struct node* createNode(int);
|
|
|
|
struct Graph {
|
|
int numVertices;
|
|
struct node** adjLists;
|
|
};
|
|
|
|
// Create a node
|
|
struct node* createNode(int v) {
|
|
struct node* newNode = malloc(sizeof(struct node));
|
|
newNode->vertex = v;
|
|
newNode->next = NULL;
|
|
return newNode;
|
|
}
|
|
|
|
// Create a graph
|
|
struct Graph* createAGraph(int vertices) {
|
|
struct Graph* graph = malloc(sizeof(struct Graph));
|
|
graph->numVertices = vertices;
|
|
|
|
graph->adjLists = malloc(vertices * sizeof(struct node*));
|
|
|
|
int i;
|
|
for (i = 0; i < vertices; i++)
|
|
graph->adjLists[i] = NULL;
|
|
|
|
return graph;
|
|
}
|
|
|
|
// Add edge
|
|
void addEdge(struct Graph* graph, int s, int d) {
|
|
// Add edge from s to d
|
|
struct node* newNode = createNode(d);
|
|
newNode->next = graph->adjLists[s];
|
|
graph->adjLists[s] = newNode;
|
|
|
|
// Add edge from d to s
|
|
newNode = createNode(s);
|
|
newNode->next = graph->adjLists[d];
|
|
graph->adjLists[d] = newNode;
|
|
}
|
|
|
|
// Print the graph
|
|
void printGraph(struct Graph* graph) {
|
|
int v;
|
|
for (v = 0; v < graph->numVertices; v++) {
|
|
struct node* temp = graph->adjLists[v];
|
|
printf("\n Vertex %d\n: ", v);
|
|
while (temp) {
|
|
printf("%d -> ", temp->vertex);
|
|
temp = temp->next;
|
|
}
|
|
printf("\n");
|
|
}
|
|
}
|
|
|
|
int main() {
|
|
struct Graph* graph = createAGraph(4);
|
|
addEdge(graph, 0, 1);
|
|
addEdge(graph, 0, 2);
|
|
addEdge(graph, 0, 3);
|
|
addEdge(graph, 1, 2);
|
|
|
|
printGraph(graph);
|
|
|
|
return 0;
|
|
}
|