(min,+) on the running example -- shortest-path weight:
       0    1   -3    2   -4
       3    0   -4    1   -1
       7    4    0    5    3
       2   -1   -5    0   -2
       8    5    1    6    0

(max,min) -- widest path, bottleneck capacity:
      inf    10     4     5     5
        -   inf     -     5     5
        -     -   inf     8     7
        -     -     -   inf     7
        -     -     -     -   inf
   widest route from 1 to 4 carries 5 l/min (via 2, whose 5 beats the lower branch's 4)

(+,x) -- number of distinct shortest paths:
   weights:
       0    1    1    2    3
     inf    0  inf    1    2
     inf  inf    0    1    2
     inf  inf  inf    0    1
     inf  inf  inf  inf    0
   counts:
       1    1    1    2    3
       0    1    0    1    1
       0    0    1    1    1
       0    0    0    1    1
       0    0    0    0    1
   delta(1,5) = 3, achieved by 3 different paths
