Module airship_travel

Macros§

AirshipDockPositions: The docking postions at an AirshipDock plot.
AirshipDockingApproach: Information needed for an airship to travel to and dock at an AirshipDock plot.
AirshipDockingPosition: A docking position (id, position). The docking position id is an index of all docking positions in the world.
AirshipRoute: An airship route is a series of legs that form a continuous loop. Each leg goes from one airship docking site to another.
AirshipRouteLeg: One leg of an airship route. The leg starts when the airship leaves the docking area at the end of the ascent phase and ends at the end of the ascent phase at the docking destination. Leg segments are:
AirshipSpawningLocation: Information needed for placing an airship in the world when the world is generated (each time the server starts).
Airships: Data for airship operations. This is generated world data.
DockNode: A node on the triangulation of the world docking sites, with data on the nodes that are connected to it.
RouteLegSegment: One flight phase of an airship route leg. The position is the destination (or only) location for the segment.

AirshipDockPlatform: The AirshipDock Sites are always oriented along a cardinal direction. The docking platforms are likewise on the sides of the dock perpendicular to a cardinal axis.
AirshipDockingSide: An airship can dock with its port or starboard side facing the dock.
AirshipFlightPhase: The flight phases of an airship.

TriangulationExt 🔒: Extension functions for Triangulation (from the triangulate crate).

add_edge 🔒: Adds an edge between two nodes in the tesselation graph.
best_eulerian_circuit_segments 🔒: Get the optimal grouping of Eulerian Circuit nodes and edges such that a maximum number of sub-circuits are created, and the length of each sub-circuit is as similar as possible.
find_best_eulerian_circuit 🔒: Find the best Eulerian circuit for the given graph of dock nodes. Try each node as the starting point for a circuit. The best circuit is the one with the longest routes (sub-segments of the circuit), and where the route lengths are equal as possible.
first_odd_node 🔒: Find the first node in the graph where the DockNode has an odd number of connections to other nodes.
remove_edge 🔒: Removes an edge between two nodes in the tesselation graph.
time_is_in_cruise_phase 🔒

DockNodeGraph 🔒: A map of node index to DockNode, where DockNode contains a list of nodes that the node is connected to.