Package db implements the database for the backend of the optishop server.

Midpoint computes the point directly between p1 and p2.

NewCacheConnector creates a new CacheConnector that relies on an underlying BatchConnector.

NewFloorConnector creates a new FloorConnector using Rasters for the Connector implementation.

NewFloorConnectorCached is like NewFloorConnector, but the internal connectors cache results and use batch computations so that computing all pairwise distances between N points is still O(N).

NewMinHeap creates an empty heap.

NewPolyContainer creates a PolyContainer for the given polygon.

NewRaster creates a Raster for the floor plan with an automatically determined size.

NewRasterSize creates a new Raster with a given size.

SolveTSP solves a Traveling salesman problem quickly, potentially using an approximation if an exact solution is infeasible.

BeamTSPSolver is a TSPSolver that uses beam search to find good solutions which are optimal if the search problem is small, but always fast regardless of the size of the search problem.

A CacheConnector is a Connector that caches short paths from another connector.

FactorialTSPSolver is a TSPSolver that runs in O(n!) time but finds exact solutions.

A Floor specifies the physical layout of a single floor of a store.

A FloorConnector combines Connectors from each floor of a building to connect arbitrary locations in the building.

A FloorPathStep is a single step in a path between two arbitrary places in a building.

A FloorPoint is a Point within a specific floor.

GreedyTSPSolver is a TSPSolver that uses the nearest neighbor algorithm.

A Layout specifies the physical layout of a store.

A MinHeap implements a priority queue which selects the lowest priorities first.

A Point is a 2-dimensional location in space.

A PolyContainer can check if a polygon contains any arbitrary point.

A Portal is a means by which a customer can get from one Floor of a Layout to another.

A Raster uses a grid of discrete pixels to find paths in a Floor without hitting obstacles.

A Zone is an arbitrary location in a store.

A BatchConnector finds short paths from one point to a list of other points on a Floor.

A Connector finds short paths from one point to another on a Floor.

A TSPSolver is an algorithm that (approximately) solves Traveling salesman problems.

A ConvexPolygon is a polygon defined by all convex combinations of its contained points.

A FloorPath is a set of steps that takes the user from one point in a store to another.

A Path is a sequence of points leading from some start destination to some end destination.

A Polygon is an arbitrary closed path.

A PortalType is a way of getting from one floor to another in a store.