I have a problem creating a solution for nearest path using a matrix graph of (5 x 5 whether the distance between nodes = 1 and the nodes label are A to Y). the nearest path must be solve using A Star search algorithm. first, input the node connecting node ... to node ..., soon after the result, length of the line connector is displayed. the input is repeated until all path is displayed and stored. after the path is stored and the Start node and goal node is inserted, using the A Star Search Algoritm, the nearest path and total length of the path is displayed.
> You help me? If you can, Would you mind sending me a sample
> code to my E-mail Address.
> > Thank you for your attention.
> > Best Regards,
> > VB Software, Bandung - Indonesia