Timeline for Problem to understand a Bellman Ford algorithm exercise
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 24, 2021 at 17:33 | comment | added | John Kemeny | Thanks for the comment, I have improved it now! | |
| Mar 24, 2021 at 17:32 | history | edited | John Kemeny | CC BY-SA 4.0 |
fixed def of m_v
|
| Mar 24, 2021 at 17:08 | vote | accept | curiouscupcake | ||
| Mar 24, 2021 at 17:08 | comment | added | curiouscupcake | But I understood your explaination. Thank you very much. | |
| Mar 24, 2021 at 17:06 | comment | added | curiouscupcake | Can you edit "Let us call this number $m_v$" to something more specific? I suppose you meant $m_v$ is the number of edges of the path? | |
| Mar 24, 2021 at 17:04 | history | answered | John Kemeny | CC BY-SA 4.0 |