Introduction | Task 1. Given an origin, how do I calculate an accumulated cost surface? | Task 2. Can I use a terrain factor for a given terrain type? | Task 3. Can cost be expressed as metabolic energy rather than time? | Task 4. Can the walking speed be worked out internally? | Task 5. Can the 'cognitive slope' be used? | Task 6. Can least-cost paths to one or more destinations be calculated? | Task 7. Can the paths back to the origin be calculated? | Task 8. Can a least-cost corridor be calculated? | Task 9. Can I compare paths from different cost functions? | Task 10. What if I do not have an elevation raster? | Task 11. Can I calculate a walking-cost boundary, e.g. a 45-minute catchment? | Task 12. Can I carry out a cost-allocation analysis? | Task 13. Can I show isolines inside each allocation zone? | Task 14. Can I calculate a network of least-cost paths? | Task 15. Can I calculate the density of a network of paths? | Task 16. My DTM has NoData (sea); how do I stop paths crossing it? | Task 17. Can I include a barrier (an area where movement is inhibited)? | Task 18. Can I calculate sub-optimal (ranked) least-cost paths? | Task 19. Can the ranked paths be drawn over a least-cost corridor? | Task 20. Can barriers be used with ranked paths? | Task 21. Can I visualise the length and cost of each ranked path? | Saving, exporting, and the cost-function catalogue | Reference