You can assume that s is accessible to all of the other vertices.
You don't need to rewrite any of them. You can use, for example, BellmanFord(G,w,s) to compute the shortest paths from s to all the vertices in G under the weight function w.