Struct graph::prelude::UndirectedALGraph
source · pub struct UndirectedALGraph<NI, NV = (), EV = ()>where
NI: Idx,{ /* private fields */ }
Implementations§
source§impl<NI, NV, EV> UndirectedALGraph<NI, NV, EV>where
NI: Idx,
NV: Send + Sync,
EV: Send + Sync,
impl<NI, NV, EV> UndirectedALGraph<NI, NV, EV>where NI: Idx, NV: Send + Sync, EV: Send + Sync,
pub fn new( node_values: NodeValues<NV>, al: AdjacencyList<NI, EV> ) -> UndirectedALGraph<NI, NV, EV>
Trait Implementations§
source§impl<NI, NV> EdgeMutation<NI> for UndirectedALGraph<NI, NV>where
NI: Idx,
impl<NI, NV> EdgeMutation<NI> for UndirectedALGraph<NI, NV>where NI: Idx,
source§impl<NI, NV, EV> EdgeMutationWithValues<NI, EV> for UndirectedALGraph<NI, NV, EV>where
NI: Idx,
EV: Copy,
impl<NI, NV, EV> EdgeMutationWithValues<NI, EV> for UndirectedALGraph<NI, NV, EV>where NI: Idx, EV: Copy,
source§impl<NI, EV, E> From<(E, CsrLayout)> for UndirectedALGraph<NI, (), EV>where
NI: Idx,
EV: Copy + Send + Sync,
E: Edges<NI = NI, EV = EV>,
impl<NI, EV, E> From<(E, CsrLayout)> for UndirectedALGraph<NI, (), EV>where NI: Idx, EV: Copy + Send + Sync, E: Edges<NI = NI, EV = EV>,
source§impl<NI, NV, EV, E> From<(NodeValues<NV>, E, CsrLayout)> for UndirectedALGraph<NI, NV, EV>where
NI: Idx,
NV: Send + Sync,
EV: Copy + Send + Sync,
E: Edges<NI = NI, EV = EV>,
impl<NI, NV, EV, E> From<(NodeValues<NV>, E, CsrLayout)> for UndirectedALGraph<NI, NV, EV>where NI: Idx, NV: Send + Sync, EV: Copy + Send + Sync, E: Edges<NI = NI, EV = EV>,
source§fn from(_: (NodeValues<NV>, E, CsrLayout)) -> UndirectedALGraph<NI, NV, EV>
fn from(_: (NodeValues<NV>, E, CsrLayout)) -> UndirectedALGraph<NI, NV, EV>
Converts to this type from the input type.
source§impl<NI, NV, EV> Graph<NI> for UndirectedALGraph<NI, NV, EV>where
NI: Idx,
NV: Send + Sync,
EV: Send + Sync,
impl<NI, NV, EV> Graph<NI> for UndirectedALGraph<NI, NV, EV>where NI: Idx, NV: Send + Sync, EV: Send + Sync,
source§fn node_count(&self) -> NI
fn node_count(&self) -> NI
Returns the number of nodes in the graph.
source§fn edge_count(&self) -> NI
fn edge_count(&self) -> NI
Returns the number of edges in the graph.
source§impl<NI, NV, EV> NodeValues<NI, NV> for UndirectedALGraph<NI, NV, EV>where
NI: Idx,
impl<NI, NV, EV> NodeValues<NI, NV> for UndirectedALGraph<NI, NV, EV>where NI: Idx,
fn node_value(&self, node: NI) -> &NV
source§impl<NI, NV, EV> UndirectedDegrees<NI> for UndirectedALGraph<NI, NV, EV>where
NI: Idx,
impl<NI, NV, EV> UndirectedDegrees<NI> for UndirectedALGraph<NI, NV, EV>where NI: Idx,
source§impl<NI, NV> UndirectedNeighbors<NI> for UndirectedALGraph<NI, NV>where
NI: Idx,
impl<NI, NV> UndirectedNeighbors<NI> for UndirectedALGraph<NI, NV>where NI: Idx,
type NeighborsIterator<'a> = TargetsIter<'a, NI> where NV: 'a
source§fn neighbors(
&self,
node: NI
) -> <UndirectedALGraph<NI, NV> as UndirectedNeighbors<NI>>::NeighborsIterator<'_>
fn neighbors( &self, node: NI ) -> <UndirectedALGraph<NI, NV> as UndirectedNeighbors<NI>>::NeighborsIterator<'_>
Returns an iterator of all nodes connected to the given node.
source§impl<NI, NV, EV> UndirectedNeighborsWithValues<NI, EV> for UndirectedALGraph<NI, NV, EV>where
NI: Idx,
impl<NI, NV, EV> UndirectedNeighborsWithValues<NI, EV> for UndirectedALGraph<NI, NV, EV>where NI: Idx,
type NeighborsIterator<'a> = TargetsWithValuesIter<'a, NI, EV> where NV: 'a, EV: 'a
source§fn neighbors_with_values(
&self,
node: NI
) -> <UndirectedALGraph<NI, NV, EV> as UndirectedNeighborsWithValues<NI, EV>>::NeighborsIterator<'_>
fn neighbors_with_values( &self, node: NI ) -> <UndirectedALGraph<NI, NV, EV> as UndirectedNeighborsWithValues<NI, EV>>::NeighborsIterator<'_>
Returns an iterator of all nodes connected to the given node
including the value of the connecting edge.
Auto Trait Implementations§
impl<NI, NV, EV> RefUnwindSafe for UndirectedALGraph<NI, NV, EV>where NV: RefUnwindSafe,
impl<NI, NV, EV> Send for UndirectedALGraph<NI, NV, EV>where EV: Send, NV: Send,
impl<NI, NV, EV> Sync for UndirectedALGraph<NI, NV, EV>where EV: Send, NV: Sync,
impl<NI, NV, EV> Unpin for UndirectedALGraph<NI, NV, EV>where EV: Unpin, NI: Unpin,
impl<NI, NV, EV> UnwindSafe for UndirectedALGraph<NI, NV, EV>where NV: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
source§impl<NI, EV, U> DegreePartitionOp<NI, EV> for Uwhere
NI: Idx,
U: Graph<NI> + UndirectedDegrees<NI> + UndirectedNeighborsWithValues<NI, EV>,
impl<NI, EV, U> DegreePartitionOp<NI, EV> for Uwhere NI: Idx, U: Graph<NI> + UndirectedDegrees<NI> + UndirectedNeighborsWithValues<NI, EV>,
source§fn degree_partition(&self, concurrency: usize) -> Vec<Range<NI>>
fn degree_partition(&self, concurrency: usize) -> Vec<Range<NI>>
Creates a greedy range-based degree partition of the nodes.
It is greedy in the sense that it goes through the node set only once and simply adds a new range to the result whenever the current range’s nodes’ degrees sum up to at least the average node degree.
Example
let graph: UndirectedCsrGraph<u32> = GraphBuilder::new()
.edges(vec![(0, 1), (0, 2), (0, 3), (0, 3)])
.build();
let partition: Vec<Range<u32>> = graph.degree_partition(2);
assert_eq!(partition.len(), 2);
assert_eq!(partition[0], 0..1);
assert_eq!(partition[1], 1..4);
source§impl<NI, G> ForEachNodeParallelByPartitionOp<NI> for Gwhere
NI: Idx,
G: Graph<NI> + Sync,
impl<NI, G> ForEachNodeParallelByPartitionOp<NI> for Gwhere NI: Idx, G: Graph<NI> + Sync,
source§fn for_each_node_par_by_partition<T, F>(
&self,
partition: &[Range<NI>],
node_values: &mut [T],
node_fn: F
) -> Result<(), Error>where
T: Send,
F: Fn(&G, NI, &mut T) + Send + Sync,
fn for_each_node_par_by_partition<T, F>( &self, partition: &[Range<NI>], node_values: &mut [T], node_fn: F ) -> Result<(), Error>where T: Send, F: Fn(&G, NI, &mut T) + Send + Sync,
For each node calls a given function with the node and its corresponding mutable state in parallel based on the provided node partition.
The parallelization is done by means of a rayon based fork join with a task for each range in the provided node partition.
source§impl<NI, G> ForEachNodeParallelOp<NI> for Gwhere
NI: Idx,
G: Graph<NI> + Sync,
impl<NI, G> ForEachNodeParallelOp<NI> for Gwhere NI: Idx, G: Graph<NI> + Sync,
source§fn for_each_node_par<T, F>(
&self,
node_values: &mut [T],
node_fn: F
) -> Result<(), Error>where
T: Send,
F: Fn(&G, NI, &mut T) + Send + Sync,
fn for_each_node_par<T, F>( &self, node_values: &mut [T], node_fn: F ) -> Result<(), Error>where T: Send, F: Fn(&G, NI, &mut T) + Send + Sync,
For each node calls a given function with the node and its corresponding mutable state in parallel.
The parallelization is done by means of a rayon based fork join with a task for each node.