Timeline for Shortest path with a given condition
Current License: CC BY-SA 4.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 27, 2019 at 16:54 | vote | accept | John | ||
| May 25, 2019 at 10:57 | answer | added | Jakube | timeline score: 0 | |
| May 25, 2019 at 7:41 | comment | added | John | @Jakube yes, between any two consecutive intermediary points. And yes, it is not specified how long the intermediary route should be, so i guess it can be of any size. | |
| May 24, 2019 at 21:13 | comment | added | Jakube | I'm not understanding the condition completely. Is it "such that between ANY two consecutive intermediary points there are two alternative routes" or "between AT MOST ONE PAIR OF consecutive intermediary points"? In any case I would advice thinking about Strongly connected components. And I'm guessing that "two alternative routes" means, that the second route can be a lot longer than the first (of size 1). Otherwise this means that it is just a multi-edge. Am I right? | |
| May 24, 2019 at 19:16 | answer | added | JustinC | timeline score: -1 | |
| May 23, 2019 at 15:59 | history | edited | John | CC BY-SA 4.0 |
deleted 3 characters in body
|
| May 23, 2019 at 15:51 | comment | added | John | I've edited it. | |
| May 23, 2019 at 15:32 | history | edited | John | CC BY-SA 4.0 |
added 359 characters in body; edited tags
|
| May 23, 2019 at 15:11 | comment | added | dkaeae | Is this homework? If so, see here for tips on asking questions about exercise problems. | |
| May 23, 2019 at 15:10 | comment | added | John | Hello! It means that the problem should be implemented with two diffrent types of algorithms like dinamic programing, Greedy, Backtracking.... | |
| May 23, 2019 at 15:06 | history | edited | John |
edited tags
|
|
| May 23, 2019 at 15:06 | comment | added | dkaeae | Also, you say "the problem requires two different algorithms". What does this mean? | |
| May 23, 2019 at 15:05 | history | edited | dkaeae | CC BY-SA 4.0 |
Improve language
|
| May 23, 2019 at 15:00 | review | First posts | |||
| May 23, 2019 at 15:06 | |||||
| May 23, 2019 at 14:59 | history | asked | John | CC BY-SA 4.0 |