DynamicGraph

Struct DynamicGraph 

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

Dynamic graph structure for minimum cut algorithm

Implementations§

Source§

impl DynamicGraph

Source

pub fn new() -> Self

Create a new empty graph

Source

pub fn with_capacity(vertices: usize, edges: usize) -> Self

Create with capacity hint

Source

pub fn add_vertex(&self, v: VertexId) -> bool

Add a vertex (returns true if new)

Source

pub fn has_vertex(&self, v: VertexId) -> bool

Check if vertex exists

Source

pub fn insert_edge( &self, u: VertexId, v: VertexId, weight: Weight, ) -> Result<EdgeId>

Insert an edge (returns edge ID if successful)

Source

pub fn delete_edge(&self, u: VertexId, v: VertexId) -> Result<Edge>

Delete an edge (returns the removed edge)

Source

pub fn has_edge(&self, u: VertexId, v: VertexId) -> bool

Check if edge exists

Source

pub fn get_edge(&self, u: VertexId, v: VertexId) -> Option<Edge>

Get edge by endpoints

Source

pub fn neighbors(&self, v: VertexId) -> Vec<(VertexId, EdgeId)>

Get all neighbors of a vertex

Source

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

Get degree of vertex

Source

pub fn num_vertices(&self) -> usize

Get number of vertices

Source

pub fn num_edges(&self) -> usize

Get number of edges

Source

pub fn vertices(&self) -> Vec<VertexId>

Get all vertices

Source

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

Get all edges

Source

pub fn stats(&self) -> GraphStats

Get graph statistics

Source

pub fn is_connected(&self) -> bool

Check if graph is connected using BFS

Source

pub fn connected_components(&self) -> Vec<Vec<VertexId>>

Get connected components using BFS

Source

pub fn clear(&self)

Clear all vertices and edges from the graph

Source

pub fn remove_vertex(&self, v: VertexId) -> Result<()>

Remove a vertex and all its incident edges

Source

pub fn edge_weight(&self, u: VertexId, v: VertexId) -> Option<Weight>

Get the weight of an edge

Source

pub fn update_edge_weight( &self, u: VertexId, v: VertexId, new_weight: Weight, ) -> Result<()>

Update the weight of an existing edge

Trait Implementations§

Source§

impl Clone for DynamicGraph

Source§

fn clone(&self) -> Self

Returns a duplicate 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 Default for DynamicGraph

Source§

fn default() -> Self

Returns the “default value” for a type. 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.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V