guys, i need some help on this, pls reply me if u know .. tq
case :
i have one board, in that bord there are several compenent ( A,B,C,D,E,N,Q)
i need to find the faster path from any point and end at any point2
e.g. A->A->D->C->........ -> N as long as i travell all of the point
i know that i can use best path algorithm , but problem is sequence of compent is a sensitive case where from A -> A delay 0 sec , A->B delay 1 sec , A-> C delay 2 sec, C->A also delay 2 sec, D->D is delay 0 sec ,
( base on the seq i listed at below, depend on you jump how many gap if one gap 1 sec)
A->A->D->C
0 3 1
so i need a solution which i can get the best path that use the fewest time ?
anyone can help me??
plssssssssssssssssssss
-------------------------------
| A B N C |
| C Q E |
| A D C Q N |
| |
--------------------------------
sequence:
A
B
C
D
E
N
Q