Struct PathNetwork 

pub struct PathNetwork {
    pub nodes: HashMap<u64, SplineNode>,
    pub edges: HashMap<u64, SplineEdge>,
    pub splines: HashMap<u64, CatmullRomSpline>,
    /* private fields */
}

Fields

nodes: HashMap<u64, SplineNode>

edges: HashMap<u64, SplineEdge>

splines: HashMap<u64, CatmullRomSpline>

Implementations

impl PathNetwork

pub fn new() -> Self

pub fn add_node(&mut self, position: Vec3) -> u64

pub fn add_spline(&mut self, spline: CatmullRomSpline) -> u64

pub fn connect_nodes( &mut self, from: u64, to: u64, spline_id: u64, one_way: bool, )

pub fn dijkstra(&self, start: u64, goal: u64) -> Option<Vec<u64>>

Dijkstra shortest path from start to goal

pub fn astar(&self, start: u64, goal: u64) -> Option<Vec<u64>>

A* path planning with Euclidean heuristic

pub fn nearest_node(&self, pos: Vec3) -> Option<u64>

impl PathNetwork

pub fn total_length(&self) -> f32

pub fn node_degree(&self, id: u64) -> usize

pub fn junction_nodes(&self) -> Vec<u64>

pub fn dead_end_nodes(&self) -> Vec<u64>

pub fn edge_passable(&self, edge_id: u64) -> bool

Trait Implementations

impl Clone for PathNetwork

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PathNetwork

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

Formats the value using the given formatter.