Struct DirectedGraph 

pub struct DirectedGraph<V, E>
where
    V: Send + Default + Clone + Sync + Debug,
    E: Send + Default + Clone + Sync + Debug,
{ /* private fields */ }

A graph which stores a list of all incoming and outgoing edges

Trait Implementations

impl<V, E> Clone for DirectedGraph<V, E>

where V: Send + Default + Clone + Sync + Debug + Clone, E: Send + Default + Clone + Sync + Debug + Clone,

fn clone(&self) -> DirectedGraph<V, E>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<V, E> Debug for DirectedGraph<V, E>

where V: Send + Default + Clone + Sync + Debug + Debug, E: Send + Default + Clone + Sync + Debug + Debug,

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

Formats the value using the given formatter.

impl<V, E> Default for DirectedGraph<V, E>

where V: Send + Default + Clone + Sync + Debug + Default, E: Send + Default + Clone + Sync + Debug + Default,

fn default() -> DirectedGraph<V, E>

Returns the “default value” for a type.

impl<V, E> DirectedGraphTrait<V, E> for DirectedGraph<V, E>

where V: Send + Default + Clone + Sync + Debug, E: Send + Default + Clone + Sync + Debug,

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

True iff this vertex is in this graph

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

Iterator over all edges

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

returns each vertex and the number of out edges

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

Adds an edge between these 2, returning true iff the edge already existed

fn out_edges_w_prop<'a>( &'a self, from_vertex: i64, ) -> impl Iterator<Item = (i64, i64, &'a E)>

where E: 'a,

Returns (from_vertex, b, E) where b is an out neighbour of from_vertex

fn out_edges_w_prop_mut<'a>( &'a mut self, from_vertex: i64, ) -> impl Iterator<Item = (i64, i64, &'a mut E)>

where E: 'a,

Returns (from_vertex, b, E) where b is an out neighbour of from_vertex

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

Remove this vertex, returning the Any & all edges connected to this vertex are deleted.

fn new() -> Self

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

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

fn out_neighbours(&self, from_vertex: i64) -> impl Iterator<Item = i64>

fn out_neighbours_w_prop<'a>( &'a self, from_vertex: i64, ) -> impl Iterator<Item = (i64, &'a E)>

where E: 'a,

fn in_neighbours(&self, from_vertex: i64) -> impl Iterator<Item = i64>

fn num_vertexes(&self) -> usize

fn num_edges(&self) -> usize

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

fn vertex_has_outgoing(&self, vid: &i64) -> bool

True iff this vertex has an outgoing edge

fn detailed_size(&self) -> String

fn num_ins_zero(&self, vid: &i64) -> bool

True iff this vertex does not have ≥1 edges. this happens with zero in edges, or if the edge doesn’t exist when doing topological sorting, we remove edges, which can remove the vertex when there are no more incoming

fn is_empty(&self) -> bool

fn vertexes_and_num_ins_outs( &self, ) -> impl Iterator<Item = (i64, usize, usize)> + '_

returns each vertex and the number of in & out edges

fn neighbors_in_xor_out(&mut self, v: &i64) -> bool

Vertex v exists, and has either in neighbours, xor out neighbours (but not both)

fn delete_edge(&mut self, vertex1: &i64, vertex2: &i64)

fn delete_vertex(&mut self, vertex: &i64)

Removes this vertex (& associated edges) from this graph

fn contract_vertex(&mut self, vertex: &i64, replacement: &i64)

fn vertexes_iter(&self) -> impl Iterator<Item = i64> + '_

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

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

fn vertex_property(&self, vertex: &i64) -> Option<&V>

fn vertex_property_unchecked(&self, vertex: &i64) -> &V

fn set_vertex_property(&mut self, vertex: &i64, property: V)

fn vertex_property_mut(&mut self, vertex: &i64) -> &mut V

fn edge_property(&self, edge: (i64, i64)) -> Option<&E>

fn edge_property_unchecked(&self, edge: (i64, i64)) -> &E

fn set_edge_property(&mut self, edge: (i64, i64), property: E)

fn edge_property_mut(&mut self, edge: (i64, i64)) -> &mut E

fn add_edge_w_prop(&mut self, vertex1: i64, vertex2: i64, eprop: E)

fn add_vertex_w_prop(&mut self, vertex: i64, vprop: V)

fn in_edges_w_prop<'a>( &'a self, to_vertex: i64, ) -> impl Iterator<Item = (i64, i64, &'a E)>

where E: 'a,

fn edges_iter_w_prop<'a>(&'a self) -> impl Iterator<Item = (i64, i64, &'a E)>

where E: 'a,

fn edges_iter_w_prop_mut<'a>( &'a mut self, ) -> impl Iterator<Item = (i64, i64, &'a mut E)>

where E: 'a,

fn edges_par_iter_w_prop<'a>( &'a self, ) -> impl ParallelIterator<Item = (i64, i64, &'a E)>

where E: 'a,

fn edges_par_iter_w_prop_mut<'a>( &'a mut self, ) -> impl ParallelIterator<Item = (i64, i64, &'a mut E)>

where E: 'a,

fn assert_consistancy(&self)

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

fn vertexes_w_prop<'a>(&'a self) -> impl Iterator<Item = (i64, &'a V)>

where V: 'a,

fn vertexes_w_prop_par_mut<'a>( &'a mut self, ) -> impl ParallelIterator<Item = (i64, &'a mut V)>

where V: 'a,

fn vertexes_w_prop_par<'a>( &'a self, ) -> impl ParallelIterator<Item = (i64, &'a V)>

where V: 'a,

fn edges_w_prop_par_mut<'a>( &'a mut self, ) -> impl ParallelIterator<Item = ((i64, i64), &'a mut E)>

where E: 'a,

fn in_edges(&self, vertex: i64) -> impl Iterator<Item = (i64, i64)>

Returns (a, to_vertex) where a is an in neighbour of to_vertex

fn out_edges(&self, vertex: i64) -> impl Iterator<Item = (i64, i64)>

Returns (from_vertex, b) where b is an out neighbour of from_vertex

fn edges(&self, vertex: i64) -> impl Iterator<Item = (i64, i64)>

All edges that go to/from this vertex. No guarantee of order.

fn all_connected_edges( &self, edge: &(i64, i64), ) -> impl Iterator<Item = (i64, i64)>

fn contains_edge( &self, from_vertex: impl Into<i64>, to_vertex: impl Into<i64>, ) -> bool

fn len(&self) -> (usize, usize)

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

Iterator (in any order) of vertexes which are the destination of an edge

fn src_vertexes_jumbled(&self) -> impl Iterator<Item = i64>

Iterator (in any order) of vertexes which are the src of an edge

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

where Self: Sync,

Iterator (in any order, possibly with dupes) of vertexes which do not have outgoing edges

fn all_in_edges_recursive( &self, nid: i64, incl_nid: impl Fn(&i64) -> bool, nodeid_pos: &impl NodeIdPosition, ) -> impl Iterator<Item = Vec<(f64, f64)>>

starting at point nid, follow all upstreams, in a DFS manner

fn expand_edge( &self, vertex1: i64, vertex2: i64, ) -> impl Iterator<Item = i64> + '_

fn vertexes(&self) -> impl Iterator<Item = i64> + '_

Iterator over all vertexes

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

Add many vertexes & edges

fn into_vertexes_topologically_sorted( self, sorting_nodes_bar: &ProgressBar, ) -> Vec<i64>

fn strongly_connected_components( &self, calc_components_bar: &ProgressBar, ) -> Vec<Vec<[i64; 2]>>

fn delete_vertex_if_unconnected(&mut self, vertex: &i64)