In this article, the notion of a k-SPR set from previous work is extended to the context of an edge-weighted graph. Under a reasonable assumption, such a set is still k-dominating, and k-hop connected. When a decreasing sequence of such sets is used, together with a hybrid route discovery strategy (partly proactive, partly reactive), the result is a highly scalable and efficient, minimal path routing protocol.