Hello!

There is graph with time-dependent edges(their weight changes in time).

For example, at moment 0 its the adjacency matrix looks like:

inf 5 3 inf
5 inf 3 10
3 3 inf inf
inf 10 inf inf

but at moment 6 it changes to

inf 5 3 inf
5 inf 3 1
3 3 inf inf
inf 1 inf inf

So, path 1->2->4 will take 5+10; path 1->3->2->4 will take 3+3+10 in time-independent but 3+3+1 in time-dependent graph. I wonder, if anyone know such problem in problem-set archive?