#include
#include
//----------------------
struct mahasiswa{
char nim[10];
char nama[50];
};
struct matKul{
char kode[10];
char nilai[2];
};
struct eBaris{
mahasiswa elmt;
struct eKolom *col;
struct eBaris *next;
};
struct eKolom{
matKul elmt;
struct eKolom *next;
};
struct list{
eBaris *first;
};
//----------------------
void createList(list *L){
(*L).first = NULL;
}
//----------------------
int countElementB(list L){
int hasil = 0;
if(L.first !=NULL){
/*list tidak kosong*/
eBaris *elmt;
/*inisialisasi*/
elmt = L.first;
while(elmt != NULL){
/*proses*/
hasil = hasil + 1;
/*iterasi*/
elmt = elmt->next;
}
}
return hasil;
}
//----------------------
int countElementK(eBaris L){
int hasil = 0;
if(L.col !=NULL){
/*list tidak kosong*/
eKolom *elmt;
/*inisialisasi*/
elmt = L.col;
while(elmt != NULL){
/*proses*/
hasil = hasil + 1;
/*iterasi*/
elmt = elmt->next;
}
}
return hasil;
}
//----------------------
void addFirstB(char nim[], char nama[], list *L){
eBaris *elmt;
elmt = (eBaris *) malloc (sizeof (eBaris));
strcpy(elmt->elmt.nim, nim);
strcpy(elmt->elmt.nama, nama);
elmt->next = (*L).first;
elmt->col = NULL;
(*L).first = elmt;
elmt = NULL;
}
//----------------------
void addFirstK(char kode[], char nilai[], eBaris *L){
eKolom *elmt;
elmt = (eKolom *) malloc (sizeof (eKolom));
strcpy(elmt->elmt.kode, kode);
strcpy(elmt->elmt.nilai, nilai);
elmt->next = (*L).col;
(*L).col = elmt;
elmt = NULL;
}
//----------------------
void addAfterB(eBaris *prec, char nim[], char nama[]){
eBaris *elmt;
elmt = (eBaris *) malloc (sizeof (eBaris));
strcpy(elmt->elmt.nim, nim);
strcpy(elmt->elmt.nama, nama);
elmt->next = prec->next;
elmt->col = NULL;
prec->next = elmt;
elmt = NULL;
}
//----------------------
void addAfterK(eKolom *prec, char kode[], char nilai[]){
eKolom *elmt;
elmt = (eKolom *) malloc (sizeof (eKolom));
strcpy(elmt->elmt.kode, kode);
strcpy(elmt->elmt.nilai, nilai);
elmt->next = prec->next;
prec->next = elmt;
elmt = NULL;
}
//----------------------
void addLastB(char nim[], char nama[], list *L){
if((*L).first == NULL){
/*jika list adalah list kosong*/
addFirstB(nim, nama, L);
}
else{
/*jika list tidak kosong*/
eBaris *elmt;
elmt = (eBaris *) malloc (sizeof (eBaris));
strcpy(elmt->elmt.nim, nim);
strcpy(elmt->elmt.nama, nama);
elmt->next = NULL;
elmt->col = NULL;
/*mencari elemen terakhir list*/
eBaris *last = (*L).first;
while(last->next != NULL){
/*iterasi*/
last = last->next;
}
last->next = elmt;
elmt = NULL;
}
}
//----------------------
void addLastK(char kode[], char nilai[], eBaris *L){
if((*L).col == NULL){
/*jika list adalah list kosong*/
addFirstK(kode, nilai, L);
}
else{
/*jika list tidak kosong*/
eKolom *elmt;
elmt = (eKolom *) malloc (sizeof (eKolom));
strcpy(elmt->elmt.kode, kode);
strcpy(elmt->elmt.nilai, nilai);
elmt->next = NULL;
/*mencari elemen terakhir list*/
eKolom *last = (*L).col;
while(last->next != NULL){
/*iterasi*/
last = last->next;
}
last->next = elmt;
elmt = NULL;
}
}
//----------------------
void delFirstB(list *L){
if((*L).first != NULL){
/*jika list bukan list kosong*/
eBaris *elmt = (*L).first;
(*L).first = (*L).first->next;
elmt->next = NULL;
free(elmt);
}
}
//----------------------
void delFirstK(eBaris *L){
if((*L).col != NULL){
/*jika list bukan list kosong*/
eKolom *elmt = (*L).col;
(*L).col = (*L).col->next;
elmt->next = NULL;
free(elmt);
}
}
//----------------------
void delAfterB(eBaris *prec){
eBaris *elmt = prec->next;
prec->next = elmt->next;
elmt->next = NULL;
free(elmt);
}
//----------------------
void delAfterK(eKolom *prec){
eKolom *elmt = prec->next;
prec->next = elmt->next;
elmt->next = NULL;
free(elmt);
}
//----------------------
void delLastB(list *L){
if((*L).first != NULL){
/*jika list tidak kosong*/
if(countElementB(*L) == 1){
/*list terdiri dari satu elemen*/
delFirstB(L);
}
else{
/*mencari elemen terakhir list*/
eBaris *last = (*L).first;
eBaris *before_last;
while(last->next != NULL){
/*iterasi*/
before_last = last;
last = last->next;
}
before_last->next = NULL;
free(last);
}
}
}
//----------------------
void delLastK(eBaris *L){
if((*L).col != NULL){
/*jika list tidak kosong*/
if(countElementK(*L) == 1){
/*list terdiri dari satu elemen*/
delFirstK(L);
}
else{
/*mencari elemen terakhir list*/
eKolom *last = (*L).col;
eKolom *before_last;
while(last->next != NULL){
/*iterasi*/
before_last = last;
last = last->next;
}
before_last->next = NULL;
free(last);
}
}
}
//----------------------
void printElement(list L){
if(L.first != NULL){
/*jika list tidak kosong*/
/*inisialisasi*/
eBaris *elmt = L.first;
int i = 1;
while(elmt != NULL){
/*proses*/
printf("elemen ke : %d\n", i);
printf("nim : %s\n", elmt->elmt.nim);
printf("nama : %s\n", elmt->elmt.nama);
eKolom *eCol = elmt->col;
while(eCol != NULL){
printf("kode kuliah : %s\n", eCol->elmt.kode);
printf("nilai : %s\n", eCol->elmt.nilai);
eCol = eCol->next;
}
printf("------------\n");
/*iterasi*/
elmt = elmt->next;
i = i + 1;
}
}
else{
/*proses jika list kosong*/
printf("list kosong\n");
}
}
//----------------------
void delAllB(list *L){
if(countElementB(*L) != 0){
int i;
for(i=countElementB(*L);i>=1;i--){
/*proses menghapus elemen list*/
delLastB(L);
}
}
}
//----------------------
void delAllK(eBaris *L){
if(countElementK(*L) != 0){
int i;
for(i=countElementK(*L);i>=1;i--){
/*proses menghapus elemen list*/
delLastK(L);
}
}
}
//----------------------
int main(){
struct list L;
createList(&L);
printElement(L);
printf("=================\n");
addFirstB("13501019", "Andik", &L);
addFirstK("IF40K1", "A", L.first);
addAfterK(L.first->col, "IF40Z1", "A");
addLastK("IF40Z2", "A", L.first);
addAfterB(L.first, "13501037", "Shalahuddin");
addFirstK("TI5141", "A", L.first->next);
addLastK("IF5021", "A", L.first->next);
addLastB("13501058", "Rosa", &L);
addFirstK("IF5321", "A", L.first->next->next);
printElement(L);
printf("=================\n");
delAllB(&L);
printElement(L);
printf("=================\n");
return 0;
}
Cpp listdinamik
#include
#include
#include
//----------------------
struct nilaiMatKul{
char nim[10];
char nama[50];
char nilai[2];
};
struct elemen{
nilaiMatKul elmt;
struct elemen *next;
};
struct list{
struct elemen *first;
};
//----------------------
void createList(list *L){
(*L).first = NULL;
}
//----------------------
int countElement(list L){
int hasil = 0;
if(L.first !=NULL){
/*list tidak kosong*/
elemen *elmt;
/*inisialisasi*/
elmt = L.first;
while(elmt != NULL){
/*proses*/
hasil = hasil + 1;
/*iterasi*/
elmt = elmt->next;
}
}
return hasil;
}
//----------------------
void addFirst(char nim[], char nama[], char nilai[], list *L){
elemen *elmt;
elmt = (elemen *) malloc (sizeof (elemen));
strcpy(elmt->elmt.nim, nim);
strcpy(elmt->elmt.nama, nama);
strcpy(elmt->elmt.nilai, nilai);
elmt->next = (*L).first;
(*L).first = elmt;
elmt = NULL;
}
//----------------------
void addAfter(elemen *prec, char nim[], char nama[], char nilai[], list *L){
elemen *elmt;
elmt = (elemen *) malloc (sizeof (elemen));
strcpy(elmt->elmt.nim, nim);
strcpy(elmt->elmt.nama, nama);
strcpy(elmt->elmt.nilai, nilai);
elmt->next = prec->next;
prec->next = elmt;
elmt = NULL;
}
//----------------------
void addLast(char nim[], char nama[], char nilai[], list *L){
if((*L).first == NULL){
/*jika list adalah list kosong*/
addFirst(nim, nama, nilai, L);
}
else{
/*jika list tidak kosong*/
elemen *elmt;
elmt = (elemen *) malloc (sizeof (elemen));
strcpy(elmt->elmt.nim, nim);
strcpy(elmt->elmt.nama, nama);
strcpy(elmt->elmt.nilai, nilai);
elmt->next = NULL;
/*mencari elemen terakhir list*/
elemen *last = (*L).first;
while(last->next != NULL){
/*iterasi*/
last = last->next;
}
last->next = elmt;
elmt = NULL;
}
}
//----------------------
void delFirst(list *L){
if((*L).first != NULL){
/*jika list bukan list kosong*/
elemen *elmt = (*L).first;
(*L).first = (*L).first->next;
elmt->next = NULL;
free(elmt);
}
}
//----------------------
void delAfter(elemen *prec, list *L){
elemen *elmt = prec->next;
prec->next = elmt->next;
elmt->next = NULL;
free(elmt);
}
//----------------------
void delLast(list *L){
if((*L).first != NULL){
/*jika list tidak kosong*/
if(countElement(*L) == 1){
/*list terdiri dari satu elemen*/
delFirst(L);
}
else{
/*mencari elemen terakhir list*/
elemen *last = (*L).first;
elemen *before_last;
while(last->next != NULL){
/*iterasi*/
before_last = last;
last = last->next;
}
before_last->next = NULL;
free(last);
}
}
}
//----------------------
void printElement(list L){
if(L.first != NULL){
/*jika list tidak kosong*/
/*inisialisasi*/
elemen *elmt = L.first;
int i = 1;
while(elmt != NULL){
/*proses*/
printf("elemen ke : %d\n", i);
printf("nim : %s\n", elmt->elmt.nim);
printf("nama : %s\n", elmt->elmt.nama);
printf("nilai : %s\n", elmt->elmt.nilai);
printf("------------\n");
/*iterasi*/
elmt = elmt->next;
i = i + 1;
}
}
else{
/*proses jika list kosong*/
printf("list kosong\n");
}
}
//----------------------
void delAll(list *L){
if(countElement(*L) != 0){
int i;
for(i=countElement(*L);i>=1;i--){
/*proses menghapus elemen list*/
delLast(L);
}
}
}
//----------------------
int main(){
struct list L;
createList(&L);
printElement(L);
printf("=================\n");
addFirst("13501019", "Andik", "A", &L);
addAfter(L.first, "13501037", "Shalahuddin", "A", &L);
addLast("13501058", "Rosa", "A", &L);
printElement(L);
printf("=================\n");
delLast(&L);
delAfter(L.first, &L);
delFirst(&L);
printElement(L);
printf("=================\n");
return 0;
}
