Enum map_model::pathfind::pathfinder::Pathfinder

pub enum Pathfinder {
    Dijkstra,
    CH(ContractionHierarchyPathfinder),
}

Most of the time, prefer using the faster contraction hierarchies. But sometimes, callers can explicitly opt into a slower (but preparation-free) pathfinder that just uses Dijkstra’s maneuever.

Variants

Dijkstra

CH(ContractionHierarchyPathfinder)

Implementations

impl Pathfinder

pub fn pathfind(&self, req: PathRequest, map: &Map) -> Option<PathV2>

Finds a path from a start to an end for a certain type of agent.

pub fn pathfind_with_params(
    &self,
    req: PathRequest,
    params: &RoutingParams,
    map: &Map
) -> Option<PathV2>

Finds a path from a start to an end for a certain type of agent. May use custom routing parameters.

pub fn pathfind_avoiding_roads(
    &self,
    req: PathRequest,
    avoid: BTreeSet<RoadID>,
    map: &Map
) -> Result<PathV2>

Note this is a slower implementation, never using contraction hierarchies. Used for experimental congestion capping.

pub fn should_use_transit(
    &self,
    map: &Map,
    start: Position,
    end: Position
) -> Option<(BusStopID, Option<BusStopID>, BusRouteID)>

pub fn apply_edits(&mut self, map: &Map, timer: &mut Timer<'_>)

Trait Implementations

impl<'de> Deserialize<'de> for Pathfinder

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl Serialize for Pathfinder

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
    __S: Serializer, 

Serialize this value into the given Serde serializer.