Function bfsDistanceMap

  • bfsDistanceMap(
        start: RoomPosition[],
        costMatrix: ClockworkCostMatrix,
    ): ClockworkDistanceMap

  • Generate a distance map for a set of positions using a breadth-first search algorithm.

    The BFS algorithm doesn't include variable costs, and only considers values of 255 (impassible) in the provided cost matrix. Any other values are ignored.

    This might be useful for creeps with only MOVE parts and/or empty CARRY parts, which don't generate fatigue.

    Note that the roomName on start positions is ignored - all positions are assumed to be in the same room as the cost matrix.

    Parameters

    • start: RoomPosition[]

      The starting positions.

    • costMatrix: ClockworkCostMatrix

      The cost matrix to use for the flow field.

    Returns ClockworkDistanceMap

    The flow field.

Settings

Member Visibility