Single Source Shortest Path Assume that you have a model of a weighted, connected graph made of balls (representing the vertices) connected by strings (that represent the edges) with lengths that represent the weighting of that edge. Describe how you can solve the single-source shortest- path problem with this model. Solution -->Hold the ball representing the source in one hand and let the rest of the model hang down. -->The force of gravity will make the shortest path to each of the other balls be on a straight line down..