Shortest path between two nodes in an undirected graph using k edges

Правка en1, от NhatHuy08052015, 2026-02-04 16:45:26

I saw that the version where the graph is directed I can solve it with dynamic programming, any ideas about the undirected one?

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский NhatHuy08052015 2026-02-04 16:45:26 199 Initial revision (published)