-
Notifications
You must be signed in to change notification settings - Fork 1
/
Algoritma A Star.cpp
66 lines (60 loc) · 1.27 KB
/
Algoritma A Star.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include <stdio.h>
#include <math.h>
#include <conio.h>
#include <stdlib.h>
int main(){
int n,i,j;
printf("====Algoritma A*====\n\n");
printf("\nMasukan Jumlah vertek : ");scanf("%d",&n);
int cost[n],h[n],m[n][n],x[n],y[n],visited[n],prev[n];
printf("===Hubungan vertek===\n");
for(i=0;i<n;i++){
for(j=0;j<n;j++){
scanf("%d",&m[i][j]);
if(m[i][j]==0){
m[i][j]=9999;
}
}
}
printf("==Nilai Heuristik setiap vertek ke vertek lain ==\n");
for(i=0;i<n;i++){
printf("Vertek %d = ",i);scanf("%d",&h[i]);
}
//algoritma a*
int start,end,temp,min,temp2;
printf("Masukan vertek asal = ");scanf("%d",&start);
printf("Masukan vertek tujuan = ");scanf("%d",&end);
for(i=0;i<n;i++){
cost[i]=999;
visited[i]=0;
}
cost[start]=0;
temp=start;
while(temp!=end){
min=999;
for(i=0;i<n;i++){
if(min > cost[i] && visited[i]==0){
min=cost[i];
temp2=i;
}
}
temp=temp2;
visited[temp]=1;
for(i=0;i<n;i++){
if(m[temp][i]!=9999 && visited[i]==0 &&temp!=end){
if(min+h[i]+m[temp][i] < cost[i]){
cost[i]=min+m[temp][i];
prev[i]=temp;
}
}
}
}
printf("\n\n Cost terpendek dari %d ke %d adalah = %d dengan rute : \n",start,end,cost[end]);
i=end;
while(i!=start){
printf("%d<--",i);
i=prev[i];
}
printf("%d",start);
return 0;
}