pub struct WeightGraph<T> {
    pub index_map: HashMap<T, NodeIndex>,
    pub graph: UnMatrix<(), BoolIdx>,
}
Expand description

Weight graph provides a wrapper over a Graph that allows adding edges using the NodeWeight type T (petgraph only allows adding edges using NodeIndex). Additionally, the edges are not allowed to have any weights.

The internal representation stores a mapping from NodeWeight T to a NodeIndex in the graph. The underlying petgraph::MatrixGraph stores () for node weights and a boolean to represent the edges.

Fields§

§index_map: HashMap<T, NodeIndex>

Mapping from T to a unique identifier.

§graph: UnMatrix<(), BoolIdx>

Graph representating using identifier.

Implementations§

source§

impl<'a, T> WeightGraph<T>where T: 'a + Eq + Hash + Clone + Ord,

source

pub fn add_edge(&mut self, a: &T, b: &T)

Add an edge between a and b.

source

pub fn add_all_edges<C>(&mut self, items: C)where C: Iterator<Item = &'a T> + Clone,

Add edges between all given items.

source

pub fn contains_node(&self, node: &T) -> bool

Checks if the node has already been added to the graph.

source

pub fn add_node(&mut self, node: T)

Add a new node to the graph. Client code should ensure that duplicate edges are never added to graph. Instead of using this method, consider constructing the graph using From<Iterator<T>>.

Panics

(Debug build only) Panics if node is already present in the graph

source

pub fn reverse_index(&self) -> HashMap<NodeIndex, T>

Returns a Map from NodeIndex to T (the reverse of the index)

source

pub fn nodes(&self) -> impl Iterator<Item = &T>

Returns an iterator over references to nodes in the Graph.

source

pub fn degree(&self, node: &T) -> usize

Return the degree of a given node (number of edges connected).

Trait Implementations§

source§

impl<T: Eq + Hash + Clone + Ord> Default for WeightGraph<T>

source§

fn default() -> Self

Returns the “default value” for a type. Read more
source§

impl<T, C> From<C> for WeightGraph<T>where T: Eq + Hash + Ord, C: Iterator<Item = T>,

source§

fn from(nodes: C) -> Self

Converts to this type from the input type.
source§

impl<T: Eq + Hash + ToString + Clone + Ord> ToString for WeightGraph<T>

source§

fn to_string(&self) -> String

Converts the given value to a String. Read more

Auto Trait Implementations§

§

impl<T> RefUnwindSafe for WeightGraph<T>where T: RefUnwindSafe,

§

impl<T> Send for WeightGraph<T>where T: Send,

§

impl<T> Sync for WeightGraph<T>where T: Sync,

§

impl<T> Unpin for WeightGraph<T>where T: Unpin,

§

impl<T> UnwindSafe for WeightGraph<T>where T: UnwindSafe,

Blanket Implementations§

source§

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

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

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

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

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

source§

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

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

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

source§

fn into(self) -> U

Calls U::from(self).

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

source§

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

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

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

Performs the conversion.
source§

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

§

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

The type returned in the event of a conversion error.
source§

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

Performs the conversion.