Skip to main content

PROGRAM CIRCULAR LINKED LIST MENGGUNAKAN BAHASA PEMROGRAMAN JAVA

 

Program Circular Linked List Mahasiswa


Berikut ini merupakan contoh program circular linked list dengan bahasa pemrograman java untuk penyimpanan data mahasiswa:

Source Code

1. Class cNode

public class cNode {
private String name;
cNode next;
cNode(String n){
name = n; next = null;
System.out.println("Object "+n+" has made ...");
}
public String getName() {
return name;
}
}

2. Class cCircularLinkedList

public class cCircularLinkedList {
cNode head, tail;
int jNode;
cCircularLinkedList(){
head = tail = null;
jNode = 0;
System.out.println("Object Circular Linked List has made...");
}
public void addNode(cNode newNode) {
if(head == null) {
head = tail = newNode;
tail.next = head;
}
else {
newNode.next = head;
tail.next = newNode;
head = newNode;
}
System.out.println("Node successfully added...");
}
public void deleteNode() {
if(head == null) {
System.out.println("Circular Linked List empty!");
}
else if(head.next == head) {
head = tail = null;
System.out.println("Node successfully removed...");
}
else {
cNode temp = head.next;
head.next = null;
tail.next = temp;
head = temp;
System.out.println("Node successfully removed...");
}
}
public void printData() {
if(head == null) {
System.out.println("Circular Linked List empty!");
}
else {
cNode temp = head;
do {
System.out.print(temp.getName()+" ");
temp = temp.next;
} while(temp != head);
System.out.println("");
}
}
public void printWithChar(String c, String s) {
String nm = c;
String search = s;
int jName = nm.length();
int jChar = 0;
cNode start = null;
if(head == null) {
System.out.println("Circular Linked List empty!");
}
else {
boolean yes = false;
cNode temp = head;
do {
if(temp.getName().equalsIgnoreCase(s)) {
yes = true;
start = temp;
break;
}
temp = temp.next;
} while(temp != head);
if(yes == false) {
System.out.println("Data not found!");
}
else {
System.out.println("Data found!");
temp = start;
do {
System.out.println(nm.charAt(jChar)+" -> "+temp.getName());
temp = temp.next;
jChar++;
} while(jName > jChar);
System.out.println("");
}
}
}
}

3. Class appCircularLinkedList

import java.util.Scanner;
public class appCircularLinkedList {

public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
cNode node = null;
cCircularLinkedList cll = new cCircularLinkedList();
int select = 0;
do {
System.out.println("\nCircular Linked List Menu");
System.out.println("1. Add Node");
System.out.println("2. Delete Node");
System.out.println("3. Print Circular Linked List with Character");
System.out.println("4. Exit");
System.out.print("Select = ");
select = sc.nextInt();
switch(select) {
case 1:
System.out.print("Add student name: ");
String nm = sc.next();
node = new cNode(nm);
cll.addNode(node);
break;
case 2:
cll.deleteNode();
break;
case 3:
System.out.print("Data available: ");
cll.printData();
System.out.print("Start from: ");
nm = sc.next();
System.out.print("Add word: ");
String c = sc.next();
cll.printWithChar(c, nm);
break;
case 4:
System.out.println("Thank you...");
break;
}
} while(select != 4);

}

}

Tampilan Program

1. Add Node




2. Print Circular Linked List with Character



3. Delete Node



4. Exit





Comments

Popular posts from this blog

PROGRAM PUSTAKA ADT MENGGUNAKAN BAHASA PEMROGRAMAN JAVA

  Program Antrian Pembelian Tiket Pesawat Berikut ini merupakan contoh program Pustaka ADT pada bahasa pemrograman java menggunakan Queue dan juga Linked List: Source Code 1. Class appAntrianTiket import java.util.Queue; import java.util.LinkedList; import java.util.Scanner; public class appAntrianTiketPesawat { public static void main(String[] args) { int bagasi;     int hargaTiket=700000;     int hargaBagasi=4400;     String noAntrian,nama,bandaraAsal,bandaraTujuan; Queue q = new LinkedList(); Scanner s = new Scanner(System.in); int pilih=0; do { System.out.println("\nMENU PEMBELIAN TIKET PESAWAT");         System.out.println("1. Ambil nomor antrian");         System.out.println("2. Panggil antrian");         System.out.println("3. Daftar antrian");         System.out.println("4. Keluar");         System.out.print("...

PROGRAM DOUBLE LINKED LIST MENGGUNAKAN BAHASA PEMROGRAMAN JAVA

    Program Double Linked List Barang Berikut ini merupakan contoh program double linked list dengan bahasa pemrograman java untuk penyimpanan data barang: Source Code 1. Class cNode public class cNode { private String kode; private String nama; private int harga; cNode next, prev; cNode(String kd, String nm, int hrg){ kode=kd; nama=nm; harga=hrg; next=prev=null; System.out.println("Object "+kd+" "+nm+" "+hrg+" dibuat..."); } public String getKode() { return kode; } public String getNama() { return nama; } public int getHarga() { return harga; } public String ToString() { return "["+kode+"]"+"\t"+nama+"\t"+harga; } } 2. Class cDoubleLinkedList public class cDoubleLinkedList { cNode head, tail; int jNode; cDoubleLinkedList(){ head=tail=null; jNode=0; System.out.println("Object Double Linked List dibuat..."); } public void tambahN...

PROGRAM STACK SINGLE LINKED LIST MENGGUNAKAN BAHASA PEMROGRAMAN JAVA

  Program Stack Single Linked List Barang Berikut ini merupakan contoh program stack dengan single linked list menggunakan bahasa pemrograman java untuk penyimpanan data barang: Source Code 1. Class cElemen public class cElemen { private String nama; cElemen next; cElemen(String n){ nama=n; System.out.println("Object "+n+" created..."); } public String getNama() { return nama; } } 2. Class cStack public class cStack { //head dan tail cElemen top, bottom; int jumlah; cStack(){ top=bottom=null; jumlah=0; System.out.println("Object stack created..."); } public void push(cElemen baru) { if(top==null) { top=bottom=baru; } else { //tumpukan sudah ada isinya baru.next = top; top = baru; } System.out.println("Push OK..."); } public cElemen pop() { if(top==null) { System.out.println("Stack empty!"); return null; } else if(top.next==null) { cElemen t...