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 | ||
| Oct 19, 2020 at 20:53 | comment | added | sarthak tripathi | I simply meant that when we put something in the stack or making a recursive call we do it as per some criteria or heuristic. | |
| Oct 8, 2020 at 19:05 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Sep 6, 2020 at 21:55 | comment | added | JimN | What would a "Dfs + priority queue" be? DFS is characterized by the use of a stack (I.e. making a choice from the last vertex chosen) otherwise, it's not a dfs | |
| Sep 6, 2020 at 21:17 | answer | added | 0x0584 | timeline score: 0 | |
| Sep 6, 2020 at 19:26 | comment | added | Tom van der Zanden | Every unweighted graph is also a weighted graph (just set all the weights equal to 1). Clearly, if DFS cannot find shortest paths in unweighted graphs it also cannot find shortest paths in weighted graphs. | |
| Sep 6, 2020 at 18:12 | review | First posts | |||
| Sep 7, 2020 at 14:23 | |||||
| Sep 6, 2020 at 18:10 | history | asked | sarthak tripathi | CC BY-SA 4.0 |