shortest path algorithm prob
i nid to find out wat is the shortest path....
user will input values.. then input where wil be his entrnce and exit..
ent_y is the column and ent_x is the row of the entrance entered by the user
ex_y is the column and ex_x is the row of the exit entered also by the user
all values that are added to charing
here's the code... there is something wrong w/ this...i stil cnt find the shortest path
else goto dang;
got(30,15); cprintf("value: %d",charing);