I saw that the version where the graph is directed I can solve it with dynamic programming, any ideas about the undirected one?
Shortest path between two nodes in an undirected graph using k edges
I saw that the version where the graph is directed I can solve it with dynamic programming, any ideas about the undirected one?