Return the cheapest path in a given non-directed weighed graph

Question

Create a program that outputs the shortest path in terms of cost from point a to point b in a Weighed Undirected Graph. Vertices L are