Project for Graph and Networks - finding paths with minimal and maximal throughput from A to B in a graph.Throughput in a path is measured as a minimal throughput from edges on the path.