Week 11 Challenge (DHEV)

From the Given diagram we are used to define a various alphabets and stage variables are given.

Using these variables and path is to be constructed from A to J using shotest path to use less cost to go between the two states.

Starting :

x(0)=A

x(1)=D

x(2)=G

x(3)=I

x(4)=J

From the starting point the value of stage is 0 were we start from the variable A as the point of start.

After We reach D we can take three Ways each cost 1,1 and 4 but we choose to leads a path to G and also We could have taken path to next stage 1. But we did not choose 1 and 2 because the path leds to F and E which has more amount of cost for the next stages.

When We reach G were we have two Ways each cost 2 and 3 but we choose 2 which leads to shortest path Iand also we could have taken to next stage 3. But we did not choose 3 because the path leds to H after Hthe cost goes 4 to reach J.

So We reach J at lost which has cost us 10 points to From A to J for the shortest path to cover.

Calculation :

From A it cost 4 to go to D, then from D to G it cost 1, After that from G to I it cost 2, So for From I to J it cost 3to end.

So if Calculate From A to J :

x(0)=A

↓ = 4

x(1)=D

↓ = 1

x(2)=G

↓ = 2

x(3)=I

↓= 3

x(4)=J

total = 10

Conclution :

There Fore From A to J the cost of travel is 10 points .