Struct BitGraph

Source
pub struct BitGraph { /* private fields */ }
Expand description

A BitGraph is an undirected graph data structure Its capacity is limited to mem::size_of::<usize>.pow(4)

Implementations§

Source§

impl BitGraph

Source

pub fn with_capacity(capacity: u32) -> BitGraph

Creates a new BitGraph preallocated with up to capacity vertices It is not possible later add vertices >= capacity

Source

pub fn complete(capacity: u32) -> BitGraph

Creates a new BitGraph with capacity vertices, with all vertices connected to each other. It is not possible later add vertices >= capacity

Source

pub fn add_edge(&mut self, u: u32, v: u32)

Adds a new undirected edge from u to v If the edge already exists, the graph is not updated It is not possible to add edges with endpoints >= capacity

Source

pub fn add_edge_unchecked(&mut self, u: u32, v: u32)

Same as add_edge except that no boundary checks are performed. Can corrupt the underlying data

Source

pub fn remove_edge(&mut self, u: u32, v: u32)

Removes the edge from u to v after performing boundary checks. If the edge is not present the graph is not updated

Source

pub fn remove_edge_unchecked(&mut self, u: u32, v: u32)

Same as remove_edge except that no boundary checks are performed Can corrupt the underlying data

Source

pub fn contract_edge(&mut self, target: u32, source: u32)

Contracts the edge (target, source) by adding all neighbors of source to target and removing source

Source

pub fn contract_edge_unchecked(&mut self, target: u32, source: u32)

Same as contract_edge without any boundary checks This is very unsafe, and can corrupt the entire graph if the function is called with invalid arguments

Source

pub fn neighbors(&self, v: u32) -> BitIter<&BitSet>

Returns an iterator over the neighborhood of vertex v

Source

pub fn order(&self) -> u32

Number of vertices in the graph

Source

pub fn degree(&self, v: u32) -> u32

Number of neighbors of v

Source

pub fn dfs(&self, v: u32) -> DfsIterator<'_>

Returns a DfsIterator starting at vertex v

Trait Implementations§

Source§

impl Clone for BitGraph

Source§

fn clone(&self) -> BitGraph

Returns a copy of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for BitGraph

Source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

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

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

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

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

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

Source§

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

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. 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 T
where 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> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

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

Source§

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 T
where U: TryFrom<T>,

Source§

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.