Hi Everyone

I want to write a set notation for the following problem.

Suppose we have a computer network like the one in the Figure(attached here). Suppose we have 3 paths(indicated by Red,Green and Blue Lines) between the

source node B and the destination node C. Through some method, we get the minimum value of links of all the 3 paths, which in this case are:

1. 5 for the Green Path (5 is a minimum between 5 & 15)

2. 5 for the Blue Path (5 is a minimum between 5 & 10)

3. 25 for the Red Path (25 is the only number here)

SO in the end we have a set which contains 3 values {5,5,25}

Now i want to write a notation/function in Mathematical form that describes how the above is achieved.I was thinking of something like this:

Y(P) = {Y|Y ϵ Z+ and Y contains minimum values of all the I number of paths}

What i mean is that P is a path between source and destination nodes(B & C in this example), I is the number of paths that exist between

two nodes(I=3 in the above case), Y contains set of minimum link values of all the I number of paths({5,5,25}) in this case, which belong to set of

positive integers Z+.

If anybody can suggest any improvement/alternate or identify/correct mistakes, in this regard, it is highly appreciated.

Thanking You

Best Regards