Timeline for Why is DFS not suited for shortest path problem?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 21, 2020 at 19:50 | vote | accept | sarthak tripathi | ||
| Nov 21, 2020 at 19:50 | comment | added | sarthak tripathi | Got it thanks! @0x0584 | |
| Sep 8, 2020 at 17:35 | comment | added | 0x0584 | Thanks, @greybeard! I've updated the answer accordingly. | |
| Sep 8, 2020 at 17:34 | history | edited | 0x0584 | CC BY-SA 4.0 |
Expand the answer by adding further details
|
| Sep 7, 2020 at 14:15 | comment | added | greybeard | Welcome to COMPUTERSCIENCE @SE. | |
| Sep 7, 2020 at 14:15 | comment | added | greybeard |
(visiting the unseen vertices would seem the way of traversals. I'm confident I could code breadth first using recursive calls.)(I consider it pointless to specify a logarithm base in "Big-O notation".)
|
|
| Sep 6, 2020 at 21:20 | review | First posts | |||
| Sep 7, 2020 at 14:16 | |||||
| Sep 6, 2020 at 21:17 | history | answered | 0x0584 | CC BY-SA 4.0 |