*Maximally
Maximally is a thorny term. Long story short:
- Optimum network flows can be represented as shortest paths with respect to a set of positive link weights (Wang, Wang & Zhang).
- With current IGP's, determining optimum is NP-Hard, BUT, very close (within 3%) approximations can be made (Fortz & Thorup).