Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

NhatHuy08052015's blog

Shortest path between two nodes in an undirected graph using k edges
By NhatHuy08052015, history, 9 months ago, In English

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

  • Vote: I like it
  • 0
  • Vote: I do not like it

»
9 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Like this?

→ Reply
»
9 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

no

→ Reply
»
9 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

What do you mean "usnig k edges"? do you mean like "There are $$$k$$$ special edges that must be traversed" or "the path must be at most k edges" or something else?

→ Reply