weighted graphs as we saw in section the breadth-first search strategy can be used to find shortest path from some starting vertex to every other vertex in connected graph this approach makes sense in cases where each edge is as good as any otherbut there are many situations where this approach is not appropriate for examplewe might be using graph to represent computer network (such as the internet)and we might be interested in finding the fastest way to route data packet between two