gtravyl documentation

gtravyl provides an easy way to take a grid-like layout and compute the shortest distance from any two desired cells in the grid. Instead of worrying about connections in graphs (as is done with most libraries), you give a grid representation/approximation of the world. This approximation/representation is then traversed for you.

Contents

• Usage
  • A Simple Example
    • A Variant: Diagonals
    • Euclidean Distance
    • wrap: Another Example
  • A Slightly More Complicated Example
    • Avoiding Mountains
    • Elevation: A Closer Look at Distance
• API
  • gtravyl Package
    • Functions
      • euclid_heuristic
        • euclid_heuristic()
      • euclidean_dist
        • euclidean_dist()
      • in_bounds
        • in_bounds()
      • moore_neighbors
        • moore_neighbors()
      • no_heuristic
        • no_heuristic()
      • no_wrap
        • no_wrap()
      • not_one
        • not_one()
      • shortest_path
        • shortest_path()
      • unit_dist
        • unit_dist()
      • vn_neighbors
        • vn_neighbors()
      • wrap
        • wrap()