Enum AutoFilterHeuristic

pub enum AutoFilterHeuristic {
    Greedy,
    BruteForce,
    SplitCells,
    OnlyOneBorder,
}

Variants

Greedy

Find the road with the most shortcuts that can be closed without creating a disconnected cell, and filter it.

There’s a vague intuition or observation that the “bottleneck” will have the most shortcuts going through it, so tackle the worst problem first.

BruteForce

Try adding one filter to every possible road, counting the shortcuts after. Choose the next step by the least resulting shortcuts.

SplitCells

Find one filter that splits a cell, maximizing the number of streets in each new cell.

OnlyOneBorder

Per cell, close all borders except for one. This doesn’t affect connectivity, but prevents all shortcuts.

Implementations

impl AutoFilterHeuristic

pub fn choices() -> Vec<Choice<Self>>

pub fn apply( self, ctx: &mut EventCtx<'_>, app: &mut App, neighbourhood: &Neighbourhood, timer: &mut Timer<'_>, ) -> Result<()>

Trait Implementations

impl Clone for AutoFilterHeuristic

fn clone(&self) -> AutoFilterHeuristic

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for AutoFilterHeuristic

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for AutoFilterHeuristic

fn eq(&self, other: &AutoFilterHeuristic) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for AutoFilterHeuristic

impl StructuralPartialEq for AutoFilterHeuristic