Timeline for Implementing While loop in module that will iterate correctly
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 23, 2022 at 0:16 | comment | added | J0ta | no, the only requirement is that it's in a module and calls Q, J, and uses the cost-to-go module which I have already written. What I included in the previous comment is all the requirements stipulated | |
| Mar 22, 2022 at 23:39 | comment | added | lericr | Are you required to use an imperative/While-loop approach? I would have started thinking about NestWhile or FixedPoint. | |
| Mar 22, 2022 at 23:13 | comment | added | lericr | Oh! Sorry! Looking back I should have realized this. | |
| Mar 22, 2022 at 22:41 | comment | added | J0ta | thanks for your answer. Sorry I forgot to mention in my last response to you that this is a school assignment and therefore I have to build a FindShortestPath module myself. I'll paste the instruction below. "Write a module findPathAndTotalCost that takes a distance matrix, Q and a cost-to-go function J and uses them to find the optimal (cheapest) path from start to end and its cost. Test your code on the data in the graph.txt file by showing the optimal path and finding its minimum cost. Hint: Your findPathAndTotalCost should of course make use of the findCostToGo module". | |
| Mar 22, 2022 at 21:10 | history | answered | lericr | CC BY-SA 4.0 |