//Adjacency List using Linked List
// -
// November 15, 2016
// Create Adjacency List using Linked List
#include<stdio.h>
#include<stdlib.h>
// #include<conio.h>
typedef struct Link {
int val;
struct Link * next;
}
lnk;
typedef struct Graph {
lnk * node;
struct Graph * link;
}
gr;
gr * create(int);
void displist(gr * );
void dispnode(lnk * );
lnk * createnode(int, int);
void main() {
int i, j, m, n;
lnk * temp;
gr * list = NULL, * ptr, * tempo;
printf("Enter the total number node : ");
scanf("%d", & m);
list = create(m);
printf("Adjacency List is : \n");
displist(list);
}
gr * create(int g) {
gr * head = NULL, * temp, * ptr;
int i;
for (i = 0; i < g; i++) {
printf("\n===========================================\n");
temp = (gr * ) malloc(sizeof(gr));
temp -> node = createnode(i, g);
temp -> link = NULL;
if (temp -> node != NULL) {
if (head == NULL)
head = temp;
else
ptr -> link = temp;
ptr = temp;
}
}
return head;
}
lnk * createnode(int p, int m) {
lnk * head = NULL, * temp, * ptr;
int i;
char ch;
for (i = 0; i < m; i++) {
printf("%d is connected with %d ?:", p + 1, i + 1);
fflush(stdin);
scanf(" %c", &ch);
if (ch == 'y' || ch == 'Y') {
temp = (lnk * ) malloc(sizeof(lnk));
temp -> val = i + 1;
temp -> next = NULL;
if (head == NULL)
head = temp;
else
ptr -> next = temp;
ptr = temp;
}
}
return head;
}
void displist(gr * head) {
lnk * adjnode;
int i = 1;
while (head != NULL) {
printf(" %d is connected with : ", i++);
adjnode = head -> node;
dispnode(adjnode);
printf("\n=================================\n");
head = head -> link;
}
}
void dispnode(lnk * head) {
while (head != NULL) {
printf("%d => ", head -> val);
head = head -> next;
}
printf("END");
}
