In this paper we will consider the Byzantine Reliable Broadcast problem on partially connected net- works. We introduce an routing algorithm for networks with a known topology. It will show that when this is combined with cryptographic signatures, we can use the routing algorithm to create an optimal amount of messages. We will introduce a few algorithms to estimate the routes required for this algorithm. Our simulations show that the amount of messages required for Byzantine Reliable Broadcast can be massively decreased by using this. We will also show that the method of choosing these paths has a huge impact, but come with their own trade- offs.