QoS routing in WiFi P2P networks is the process of selecting a path to be used by peers based on their QoS requirements, such as bandwidth or delay. Existing QoS routing solutions provide an effective way of dealing with path selection; however, even though there exist paths with more available capacity or better reliability, these paths are not taken into consideration. In this paper we propose algorithms to compute paths with maximal path-capacity-to-hop count ratio from a super-peer to all other super-peers in a WiFi P2P network. The complexities of these algorithms are O(MH), where M is the number of edges and H is the diameter of the P2P network. Simulations conducted on different topologies demonstrate that our proposed algorithms perform up to 15% better (in terms of information loss) when compared to existing techniques.