Struct Graph2 

pub struct Graph2 { /* private fields */ }

Implementations

impl Graph2

pub fn new() -> Self

pub fn add_edge(&mut self, vertex1: i64, vertex2: i64) -> bool

pub fn vertexes(&self) -> impl ExactSizeIterator<Item = &i64>

pub fn vertexes_par_iter(&self) -> impl ParallelIterator<Item = &i64>

pub fn vertexes_w_num_neighbours(&self) -> impl Iterator<Item = (&i64, usize)>

pub fn vertexes_w_num_neighbours_par( &self, ) -> impl ParallelIterator<Item = (&i64, usize)>

pub fn edges_iter(&self) -> impl Iterator<Item = (&i64, &i64)>

pub fn edges_par_iter(&self) -> impl ParallelIterator<Item = (&i64, &i64)>

pub fn neighbours(&self, vertex: &i64) -> impl Iterator<Item = &i64> + use<'_>

pub fn num_neighbors(&self, vertex: &i64) -> Option<usize>

pub fn add_edge_chain(&mut self, vertexes: &[i64]) -> bool

pub fn num_vertexes(&self) -> usize

pub fn num_edges(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn first_vertex(&self) -> Option<&i64>

pub fn contains_vertex(&self, vertex: i64) -> bool

pub fn contains_edge(&self, v1: i64, v2: i64) -> bool

pub fn remove_vertex(&mut self, vertex: i64) -> Option<SmallNidVec>

pub fn remove_edge(&mut self, vertex1: i64, vertex2: i64) -> Option<(i64, i64)>

pub fn into_disconnected_graphs( self, progress_bar: impl Into<Option<ProgressBar>>, ) -> impl Iterator<Item = Self>

pub fn into_lines_random(self) -> impl Iterator<Item = Box<[i64]>>

pub fn into_lines_as_crow_flies( self, nodeid_pos: &impl NodeIdPosition, ) -> impl Iterator<Item = Box<[i64]>> + '_

pub fn random_sample_vertexes( &self, num: usize, nodeid_pos: &impl NodeIdPosition, ) -> Box<[i64]>

Return a random sample of points in this graph, somewhat spread out.

pub fn betweenness_centrality( &self, nodes: &[i64], nodeid_pos: &impl NodeIdPosition, inter_store: &InterStore, progress_bar: impl Into<Option<ProgressBar>>, ) -> SortedSliceMap<(i64, i64), u64>

pub fn compress_graph( &mut self, inter_store: &mut Arc<Mutex<&mut InterStore>>, remove_old_inters: bool, never_remove_vertexes: impl Fn(i64) -> bool + Sync, )

pub fn remove_spikes( &mut self, never_remove_vertexes: impl Fn(i64) -> bool + Sync, )

Trait Implementations

impl Clone for Graph2

fn clone(&self) -> Graph2

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Graph2

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

Formats the value using the given formatter.

impl Default for Graph2

fn default() -> Graph2

Returns the “default value” for a type.