Graph

path_finding_lib::graph

Struct Graph

pub struct Graph {
    pub edges_lookup: HashMap<usize, Edge>,
    pub nodes_lookup: HashMap<usize, Node>,
    pub node_position_lookup: Option<HashMap<usize, Position>>,
    pub edges: Vec<Edge>,
    pub node_count: usize,
}

Fields§

§edges_lookup: HashMap<usize, Edge>§nodes_lookup: HashMap<usize, Node>§node_position_lookup: Option<HashMap<usize, Position>>§edges: Vec<Edge>§node_count: usize

Implementations§

impl Graph

pub fn from(edges: Vec<Edge>) -> Graph

pub fn from_adjacency_matrix(matrix: &[&[f32]]) -> Graph

pub fn sorted_by_weight_asc(&self) -> Vec<Edge>

pub fn offer_positions(&mut self, node_positions: HashMap<usize, Position>)

Auto Trait Implementations§

impl Freeze for Graph

impl RefUnwindSafe for Graph

impl Send for Graph

impl Sync for Graph

impl Unpin for Graph

impl UnwindSafe for Graph

Blanket Implementations§

impl<T> Any for T
where T: 'static + ?Sized,

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

impl<T> Borrow<T> for T
where T: ?Sized,

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

impl<T> BorrowMut<T> for T
where T: ?Sized,

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

impl<T> From<T> for T

fn from(t: T) -> T

Returns the argument unchanged.

impl<T, U> Into<U> for T
where U: From<T>,

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

impl<T, U> TryFrom<U> for T
where U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.