Unit movement u_move.c contains the move algorithm. When the map editor saves a map, a move graph is created (should be able to create it as necessary, not after saving the map - it's quite large!) Move graphs consist of convex vertices of shapes of inaccessible terrain and information on straight routes between vertices. If the game needs to search the path data for a route, Dijkstra's "shortest path" algorithm is applied.