Program Graph Dengan Java PDF
Program Graph Dengan Java PDF
package graph_coba;
class Simpul{
char info;
Simpul next;
Jalur arc;
Simpul(){
class Jalur{
int info;
Jalur next;
Simpul node;
Jalur(){
}
class Graph{
Simpul first;
Graph(){
/*--------------------------*/
void createEmpty(){
first = null;
/*--------------------------*/
node.info = c;
node.next = null;
node.arc = null;
if(first == null){
first = node;
else{
while(last.next != null){
last = last.next;
last.next = node;
}
/*--------------------------*/
Jalur arc;
arc.info = beban;
arc.next = null;
arc.node = tujuan;
if(awal.arc == null){
awal.arc = arc;
}
else{
while(last.next != null){
last = last.next;
last.next = arc;
/*--------------------------*/
if(elmt != null){
if(elmt.info == c){
ketemu = true;
else{
prec = elmt;
elmt = elmt.next;
if(ketemu == true){
if(prec == null){
/*hapus simpul pertama*/
first = elmt.next;
else{
if(elmt.next == null){
prec.next = null;
else{
prec.next = elmt.next;
elmt.next = null;
else{
}
}
else{
/*--------------------------*/
if(node.info == c){
hasil = node;
ketemu = true;
else{
node = node.next;
return hasil;
/*--------------------------*/
if(arc != null){
if(arc.node.info == ctujuan){
ketemu = true;
else{
prec = arc;
arc = arc.next;
if(ketemu == true){
if(prec == null){
awal.arc = arc.next;
else{
if(arc.next == null){
prec.next = null;
else{
prec.next = arc.next;
arc.next = null;
else{
else{
}
}
/*--------------------------*/
void printGraph(){
if(node != null){
while(node != null){
while(arc != null){
node = node.next;
else{
System.out.println("graph kosong");
/*--------------------------*/
/*--------------------------*/
class CobaGraph{
public static void main(String[] args) {
G.createEmpty();
G.addSimpul('A');
G.addSimpul('B');
G.addSimpul('C');
G.addSimpul('D');
G.addSimpul('E');
G.addSimpul('F');
G.addJalur(end, 3, begin);
begin = G.findSimpul('B');
end = G.findSimpul('D');
G.addJalur(end, 3, begin);
end = G.findSimpul('E');
G.addJalur(end, 7, begin);
begin = G.findSimpul('C');
end = G.findSimpul('A');
G.addJalur(end, 3, begin);
begin = G.findSimpul('D');
G.addJalur(end, 8, begin);
}
end = G.findSimpul('C');
G.addJalur(end, 3, begin);
begin = G.findSimpul('E');
end = G.findSimpul('D');
G.addJalur(end, 4, begin);
end = G.findSimpul('B');
G.addJalur(end, 4, begin);
begin = G.findSimpul('F');
end = G.findSimpul('D');
System.out.println("================");
G.printGraph();
System.out.println("\n================");
begin = G.findSimpul('A');
if(begin != null){
G.delJalur('B', begin);
System.out.println("================");
System.out.println("setelah dihapus");
G.printGraph();
System.out.println("\n================");