Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

1
  • $\begingroup$ Besides being careful about what happens for $q = 1$, you also need to take care to fill out the table with meaningful values when the inner loop runs out of elements. Moreover, if I'm reading it correctly,, the algorithm appears to completely ignore the case $c(v) > c(u)$ (cf. this CS SE question), so something needs to be done there as well. $\endgroup$ Commented Oct 17, 2019 at 8:56