AbstractIn this paper an algorithm is presented for solving a certain class of multi‐commodity flow problems. The class of problems considered consist of integer capacity multi‐source and multi‐sink problems for which each node is a source of sink for all but at most one commodity. The algorithm is described in the case that any edge connecting a source and sink of a commodity can be used for flow of that comm