Tell me about how you would implement a shortest path solution in an undirected, weighted graph with additional constraints.
