Very useful if the graph is a model of something. Latency time in a network graph. Travel time on a road network. Ticket price for airlines. A slight modification of Dijkstra algorithm gives you an efficient solution to find the fastest/cheapest/whatever path through the graph.