Timeline for Why can't DFS be used to find shortest paths in unweighted graphs?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 13, 2019 at 4:43 | comment | added | Anmol Middha | Yes, it is the implementation of user2407394's answer. Sorry for inconvenience. I have added comments in code. You can check it now. | |
| Jun 12, 2019 at 9:08 | comment | added | David Richerby | Isn't this just repeating user2407394's answer, only with hard-to-understand code (you've not defined what any of those variables mean, and it's not obvious, to me) instead of an explanation? | |
| Jun 12, 2019 at 8:36 | comment | added | Discrete lizard♦ | The accepted answer claims this is not possible, which contradicts your claim. Can you explain why you think that nevertheless this approach works? (or explain why this approach works in general) | |
| Jun 12, 2019 at 8:35 | review | First posts | |||
| Jun 12, 2019 at 11:31 | |||||
| S Jun 12, 2019 at 8:15 | review | Low quality posts | |||
| Jun 12, 2019 at 8:40 | |||||
| S Jun 12, 2019 at 8:15 | review | Late answers | |||
| Jun 12, 2019 at 9:08 | |||||
| Jun 12, 2019 at 7:56 | history | answered | Anmol Middha | CC BY-SA 4.0 |