The deterministic case and forward DP

Untitled

Untitled

If more than one edge more than one index

Untitled

Untitled

Problem is symmetric

How can I find a path from S to T at the lowest cost.

That is equivelent of going from T to S

Untitled

Untitled