Struct BiDij 

pub struct BiDij {}

Bidirectional Dijkstra’s algorithm (cost-aware).

Searches forward from the initial state and backward from the goal simultaneously, expanding the side with the lowest g value. Guarantees optimal (minimum-cost) plans.

Examples

use miniplan::search::{BiDij, Planner};

let planner = BiDij::new();
assert_eq!(planner.name(), "bidij");

Implementations

impl BiDij

pub fn new() -> Self

Create a new bidirectional Dijkstra planner.

Trait Implementations

impl Default for BiDij

fn default() -> BiDij

Returns the “default value” for a type.

impl Planner for BiDij

fn name(&self) -> &str

A human-readable name for this planner.

fn describe(&self) -> &str

A short description of the algorithm.

fn capabilities(&self) -> PlannerCapabilities

The capabilities this planner supports.

fn solve( &mut self, task: &Task, limits: &SearchLimits, ) -> Result<SearchOutcome, MiniplanError>

Solve the given task within the specified limits.