Struct fera_graph::graphs::complete::Complete
source · pub struct Complete<K: CompleteEdgeKind> { /* private fields */ }
Implementations
Trait Implementations
sourceimpl<K: CompleteEdgeKind> Adjacency for Complete<K>
impl<K: CompleteEdgeKind> Adjacency for Complete<K>
fn out_neighbors(&self, v: CVertex) -> OutNeighborIter<'_, Self>
fn out_degree(&self, v: Vertex<Self>) -> usize
sourceimpl<K: CompleteEdgeKind> Choose for Complete<K>
impl<K: CompleteEdgeKind> Choose for Complete<K>
sourcefn choose_vertex<R: Rng>(&self, rng: R) -> Option<Vertex<Self>>
fn choose_vertex<R: Rng>(&self, rng: R) -> Option<Vertex<Self>>
Returns a random vertex of this graph or
None
if the graph has no vertices.sourcefn choose_out_neighbor<R: Rng>(
&self,
v: Vertex<Self>,
rng: R
) -> Option<Vertex<Self>>
fn choose_out_neighbor<R: Rng>(
&self,
v: Vertex<Self>,
rng: R
) -> Option<Vertex<Self>>
Returns a random neighbor vertex of
v
or None
if v
has no neighbors.sourcefn choose_edge<R: Rng>(&self, rng: R) -> Option<Edge<Self>>
fn choose_edge<R: Rng>(&self, rng: R) -> Option<Edge<Self>>
Returns a random edge of this graph or
None
if the graph has no edges.sourcefn choose_out_edge<R: Rng>(&self, v: Vertex<Self>, rng: R) -> Option<Edge<Self>>
fn choose_out_edge<R: Rng>(&self, v: Vertex<Self>, rng: R) -> Option<Edge<Self>>
Returns a random out edge of
v
or None
if v
has no out edges.sourcefn choose_vertex_iter<R: Rng>(&self, rng: R) -> ChooseVertexIter<'_, Self, R> ⓘ
fn choose_vertex_iter<R: Rng>(&self, rng: R) -> ChooseVertexIter<'_, Self, R> ⓘ
Returns an iterator that repeatedly calls
choose_vertex
.sourcefn choose_out_neighbor_iter<R: Rng>(
&self,
v: Vertex<Self>,
rng: R
) -> ChooseOutNeighborIter<'_, Self, R> ⓘ
fn choose_out_neighbor_iter<R: Rng>(
&self,
v: Vertex<Self>,
rng: R
) -> ChooseOutNeighborIter<'_, Self, R> ⓘ
Returns an iterator that repeatedly calls
choose_out_neighbor(v)
.sourcefn choose_edge_iter<R: Rng>(&self, rng: R) -> ChooseEdgeIter<'_, Self, R> ⓘ
fn choose_edge_iter<R: Rng>(&self, rng: R) -> ChooseEdgeIter<'_, Self, R> ⓘ
Returns an iterator that repeatedly calls
choose_edge
.sourcefn choose_out_edge_iter<R: Rng>(
&self,
v: Vertex<Self>,
rng: R
) -> ChooseOutEdgeIter<'_, Self, R> ⓘ
fn choose_out_edge_iter<R: Rng>(
&self,
v: Vertex<Self>,
rng: R
) -> ChooseOutEdgeIter<'_, Self, R> ⓘ
Returns an iterator that repeatedly calls
choose_out_edge(v)
.sourcefn random_walk<R: Rng>(&self, rng: R) -> RandomWalk<'_, Self, R> ⓘ
fn random_walk<R: Rng>(&self, rng: R) -> RandomWalk<'_, Self, R> ⓘ
Returns a iterator that produces a sequence of random edges that forms a walk, that is, the
target vertex of the previous edge is the source vertex of the next edge. Read more
sourceimpl<K: Clone + CompleteEdgeKind> Clone for Complete<K>
impl<K: Clone + CompleteEdgeKind> Clone for Complete<K>
sourceimpl<K: Debug + CompleteEdgeKind> Debug for Complete<K>
impl<K: Debug + CompleteEdgeKind> Debug for Complete<K>
sourceimpl<K: CompleteEdgeKind> EdgeList for Complete<K>
impl<K: CompleteEdgeKind> EdgeList for Complete<K>
fn edges(&self) -> EdgeIter<'_, Self>
fn num_edges(&self) -> usize
fn get_edge_by_ends(&self, u: Vertex<Self>, v: Vertex<Self>) -> Option<Edge<Self>>
fn edges_ends(&self) -> EdgesEnds<'_, Self, EdgeIter<'_, Self>> ⓘ
fn edges_with_ends(&self) -> EdgesWithEnds<'_, Self, EdgeIter<'_, Self>> ⓘ
fn edge_by_ends(&self, u: Vertex<Self>, v: Vertex<Self>) -> Edge<Self>
sourceimpl<'a, K: CompleteEdgeKind> EdgeTypes<'a, Complete<K>> for Complete<K>
impl<'a, K: CompleteEdgeKind> EdgeTypes<'a, Complete<K>> for Complete<K>
type EdgeIter = Map<Range<usize>, fn(_: usize) -> <K as CompleteEdgeKind>::Edge>
type OutEdgeIter = COutEdgeIter<<Complete<K> as WithEdge>::Edge>
sourceimpl<K: CompleteEdgeKind> Incidence for Complete<K>
impl<K: CompleteEdgeKind> Incidence for Complete<K>
fn out_edges(&self, v: Vertex<Self>) -> OutEdgeIter<'_, Self>
fn out_edges_ends(
&self,
v: Vertex<Self>
) -> EdgesEnds<'_, Self, OutEdgeIter<'_, Self>> ⓘ
fn out_edges_with_ends(
&self,
v: Vertex<Self>
) -> EdgesWithEnds<'_, Self, OutEdgeIter<'_, Self>> ⓘ
sourceimpl<K: PartialEq + CompleteEdgeKind> PartialEq<Complete<K>> for Complete<K>
impl<K: PartialEq + CompleteEdgeKind> PartialEq<Complete<K>> for Complete<K>
sourceimpl<K: CompleteEdgeKind> VertexList for Complete<K>
impl<K: CompleteEdgeKind> VertexList for Complete<K>
fn num_vertices(&self) -> usize
fn vertices(&self) -> VertexIter<'_, Self>
sourceimpl<'a, K: CompleteEdgeKind> VertexTypes<'a, Complete<K>> for Complete<K>
impl<'a, K: CompleteEdgeKind> VertexTypes<'a, Complete<K>> for Complete<K>
type VertexIter = Range<<Complete<K> as WithVertex>::Vertex>
type OutNeighborIter = COutNeighborIter
sourceimpl<K: CompleteEdgeKind> WithEdge for Complete<K>
impl<K: CompleteEdgeKind> WithEdge for Complete<K>
type Kind = K
type Edge = <K as CompleteEdgeKind>::Edge
type OptionEdge = Optioned<<K as CompleteEdgeKind>::Edge, MaxNone<<K as CompleteEdgeKind>::Edge>>
fn source(&self, e: Edge<Self>) -> Vertex<Self>
fn target(&self, e: Edge<Self>) -> Vertex<Self>
fn end_vertices(&self, e: Edge<Self>) -> (Vertex<Self>, Vertex<Self>)
fn orientation(&self, _e: Edge<Self>) -> Orientation
fn reverse(&self, e: Edge<Self>) -> Edge<Self>
fn get_reverse(&self, e: Edge<Self>) -> Option<Edge<Self>>
fn ends<'a, I, O>(&'a self, item: I) -> Owhere
I: Ends<'a, Self, O>,
fn with_ends<I>(&self, iter: I) -> EdgesWithEnds<'_, Self, I::IntoIter> ⓘwhere
I: IntoIterator,
I::Item: IntoOwned<Edge<Self>>,
fn opposite(&self, u: Vertex<Self>, e: Edge<Self>) -> Vertex<Self>
fn is_incident(&self, v: Vertex<Self>, e: Edge<Self>) -> bool
fn edge_none() -> OptionEdge<Self>
fn edge_some(e: Edge<Self>) -> OptionEdge<Self>
fn edge_prop<P, T>(&self, value: T) -> Pwhere
P: EdgePropMutNew<Self, T>,
T: Clone,
fn edge_prop_from_fn<P, F, T>(&self, fun: F) -> Pwhere
Self: EdgeList,
P: EdgePropMutNew<Self, T>,
F: FnMut(Edge<Self>) -> T,
T: Default + Clone,
sourceimpl<K: CompleteEdgeKind> WithEdgeIndexProp for Complete<K>
impl<K: CompleteEdgeKind> WithEdgeIndexProp for Complete<K>
type EdgeIndexProp = CEdgeIndexProp<<K as CompleteEdgeKind>::Edge>
sourcefn edge_index(&self) -> CEdgeIndexProp<K::Edge>
fn edge_index(&self) -> CEdgeIndexProp<K::Edge>
Creates an edge index map.
sourceimpl<T, K: CompleteEdgeKind> WithEdgeProp<T> for Complete<K>where
Complete<K>: WithEdgeIndexProp,
impl<T, K: CompleteEdgeKind> WithEdgeProp<T> for Complete<K>where
Complete<K>: WithEdgeIndexProp,
type EdgeProp = ArrayProp<<Complete<K> as WithEdgeIndexProp>::EdgeIndexProp, Vec<T, Global>>
sourceimpl<K: CompleteEdgeKind> WithVertex for Complete<K>
impl<K: CompleteEdgeKind> WithVertex for Complete<K>
type Vertex = u32
type OptionVertex = Optioned<u32, MaxNone<u32>>
fn vertex_none() -> OptionVertex<Self>
fn vertex_some(v: Vertex<Self>) -> OptionVertex<Self>
fn vertex_prop<P, T>(&self, value: T) -> Pwhere
P: VertexPropMutNew<Self, T>,
T: Clone,
fn vertex_prop_from_fn<P, T, F>(&self, fun: F) -> Pwhere
Self: VertexList,
P: VertexPropMutNew<Self, T>,
F: FnMut(Vertex<Self>) -> T,
T: Default + Clone,
sourceimpl<K: CompleteEdgeKind> WithVertexIndexProp for Complete<K>
impl<K: CompleteEdgeKind> WithVertexIndexProp for Complete<K>
type VertexIndexProp = CVertexIndexProp
sourcefn vertex_index(&self) -> CVertexIndexProp
fn vertex_index(&self) -> CVertexIndexProp
Creates an vertex index map.
sourceimpl<T, K: CompleteEdgeKind> WithVertexProp<T> for Complete<K>
impl<T, K: CompleteEdgeKind> WithVertexProp<T> for Complete<K>
type VertexProp = ArrayProp<<Complete<K> as WithVertexIndexProp>::VertexIndexProp, Vec<T, Global>>
type VertexProp = ArrayProp<<Complete<K> as WithVertexIndexProp>::VertexIndexProp, Vec<T, Global>>
The vertex property type.
impl<K: CompleteEdgeKind> BasicEdgeProps for Complete<K>
impl<K: CompleteEdgeKind> BasicProps for Complete<K>
impl<K: CompleteEdgeKind> BasicVertexProps for Complete<K>
impl<K: Copy + CompleteEdgeKind> Copy for Complete<K>
impl<K: Eq + CompleteEdgeKind> Eq for Complete<K>
impl<K: CompleteEdgeKind> StructuralEq for Complete<K>
impl<K: CompleteEdgeKind> StructuralPartialEq for Complete<K>
Auto Trait Implementations
impl<K> RefUnwindSafe for Complete<K>where
K: RefUnwindSafe,
impl<K> Send for Complete<K>where
K: Send,
impl<K> Sync for Complete<K>where
K: Sync,
impl<K> Unpin for Complete<K>where
K: Unpin,
impl<K> UnwindSafe for Complete<K>where
K: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more