PENENTUAN RUTE JARAK TERPENDEK DI KOTA SURABAYA MENGGUNAKAN ALGORITMA DIJKSTRA BERBASIS JAVA MIDLET.
nodeAcc.value<sortedValue)) {
valNode=nodeAcc;
sortedValue=nodeAcc.value;
panjang=String.valueOf(sortedValue); stringItem3.setText(panjang+" Meter"); }
(6)
stop=true; else
nodeAcc=nodeAcc.nextList; }
return valNode; }
void dijkstra() {
node newNode=new node(); node finishNode=new node(); enterdata();
String start=textField2.getString(); String finish=textField3.getString(); String start1=textField.getString(); String start2=textField.getString(); String start3=textField1.getString(); levelAcc=0;
newNode=new node(); newNode.name=start;
newNode.pathString="\n"+start1+"\n"; newNode.value=0;
newNode.level=levelAcc; nodeStart=newNode; nodeEnd=nodeStart; jalankan(start, finish); finishNode=cari(finish);
stringItem.setText(finishNode.pathString); stringItem1.setText(start2);
stringItem2.setText(start3); }
}
public class map {
public String startRoad; public String endRoad; public long valueRoad; public String name; public map nextList; }
public class node { public String name; public long value; public String pathString; public node nextList; public long level; public void node () {
name=""; value=0; pathString=""; nextList=new node(); }