Struct EdgeStorage 

pub struct EdgeStorage {
    pub edges: Array<Edge>,
    /* private fields */
}

Fields

edges: Array<Edge>

Implementations

impl EdgeStorage

pub fn new_large() -> Self

Creates a new graph with the assumption that the usage will be dynamic. It will create the graph with high reserve count of 50 to avoid reallocations.

pub fn with_reserve(capacity: Ci) -> Self

Creates a new graph with a custom reserve

pub fn new() -> Self

Creates a new graph with the assumption that the graph size is known ahead of time. No reserve.

Trait Implementations

impl Clone for EdgeStorage

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Default for EdgeStorage

fn default() -> Self

Returns the “default value” for a type.

impl EdgeConnect for EdgeStorage

fn connect_edges(&mut self, from: VHandle, to: &[Edge])

fn disconnect(&mut self, from: VHandle, to: VHandle)

fn connect(&mut self, from: VHandle, to: VHandle)

impl EdgeStore for EdgeStorage

fn create_vertex_entry(&mut self, size: Ci) -> VHandle

fn edges_as_slice(&self, vertex: VHandle) -> &[Edge]

fn edges_as_mut_slice(&mut self, vertex: VHandle) -> &mut [Edge]

fn edges_as_ptr(&self, vertex: VHandle) -> FatPtr<Edge>

fn edges_as_mut_ptr(&mut self, vertex: VHandle) -> FatPtrMut<Edge>

fn edges_is_empty(&self, handle: VHandle) -> bool

fn edges_len(&self, handle: VHandle) -> usize

fn edges_capacity(&self, handle: VHandle) -> usize

fn edges_index(&self, vertex: VHandle) -> usize

fn iter(&self) -> impl Iterator<Item = &Edge>

fn iter_mut(&mut self) -> impl Iterator<Item = &mut Edge>

fn edges_iter(&self, handle: VHandle) -> impl Iterator<Item = &Edge>

fn edges_iter_mut(&mut self, handle: VHandle) -> impl Iterator<Item = &mut Edge>

unsafe fn edges_iter_mut_unchecked( &mut self, handle: VHandle, ) -> impl Iterator<Item = &mut Edge>

Extremely unsafe function. Use when you know what you are doing. Recommended to use if you dynamically want multiple non-overlapping iterators to edges.

impl Index<usize> for EdgeStorage

type Output = u64

The returned type after indexing.

fn index(&self, index: usize) -> &Self::Output

Performs the indexing (container[index]) operation.

impl IndexMut<usize> for EdgeStorage

fn index_mut(&mut self, index: usize) -> &mut Self::Output

Performs the mutable indexing (container[index]) operation.

impl WeightedEdgeConnect for EdgeStorage

fn connect_weighted(&mut self, from: VHandle, to: VHandle, weight: Weight)

impl EdgeManipulate for EdgeStorage

impl WeightedEdgeManipulate for EdgeStorage