Abstract: This paper proposes an algorithm to find a path which has the maximum allowed flow rate for data, between source and destination in a network. Unlike max-flow and min-cut theorem, we are selecting single path for data transmission. To find a path in a network there are many techniques. Prim’s technique is used recursively in our proposed algorithm to find different paths between source and destination. The maximum allowed flowrate for each of those paths is calculated and finally we take the maximum of those calculated flow rates.