Struct fera_graph::graphs::complete::Complete

pub struct Complete<K: CompleteEdgeKind> { /* fields omitted */ }

Methods

impl<K: CompleteEdgeKind> Complete<K>

fn new(n: CVertex) -> Self

Trait Implementations

impl<K: Copy + CompleteEdgeKind> Copy for Complete<K>

impl<K: Clone + CompleteEdgeKind> Clone for Complete<K>

fn clone(&self) -> Complete<K>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K: PartialEq + CompleteEdgeKind> PartialEq for Complete<K>

fn eq(&self, __arg_0: &Complete<K>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, __arg_0: &Complete<K>) -> bool

This method tests for !=.

impl<K: Eq + CompleteEdgeKind> Eq for Complete<K>

impl<K: Debug + CompleteEdgeKind> Debug for Complete<K>

fn fmt(&self, __arg_0: &mut Formatter) -> Result

Formats the value using the given formatter.

impl<'a, K: CompleteEdgeKind> VertexTypes<'a, Complete<K>> for Complete<K>

type VertexIter = Range<Vertex<Self>>

type OutNeighborIter = Chain<Range<CVertex>, Range<CVertex>>

impl<K: CompleteEdgeKind> WithVertex for Complete<K>

type Vertex = CVertex

type OptionVertex = OptionalMax<CVertex>

fn vertex_none() -> OptionVertex<Self>

fn vertex_some(v: Vertex<Self>) -> OptionVertex<Self>

fn vertex_prop<P, T>(&self, value: T) -> P where
    P: VertexPropMutNew<Self, T>,
    T: Clone, 

fn vertex_prop_from_fn<P, T, F>(&self, fun: F) -> P where
    Self: VertexList,
    P: VertexPropMutNew<Self, T>,
    F: FnMut(Vertex<Self>) -> T,
    T: Default + Clone, 

impl<'a, K: CompleteEdgeKind> EdgeTypes<'a, Complete<K>> for Complete<K>

type EdgeIter = Map<Range<usize>, fn(_: usize) -> K::Edge>

type OutEdgeIter = COutEdgeIter<Edge<Self>>

impl<K: CompleteEdgeKind> WithEdge for Complete<K>

type Kind = K

type Edge = K::Edge

type OptionEdge = Optioned<K::Edge, MaxNone<K::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) -> O where
    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) -> P where
    P: EdgePropMutNew<Self, T>,
    T: Clone, 

fn edge_prop_from_fn<P, F, T>(&self, fun: F) -> P where
    Self: EdgeList,
    P: EdgePropMutNew<Self, T>,
    F: FnMut(Edge<Self>) -> T,
    T: Default + Clone, 

impl<K: CompleteEdgeKind> VertexList for Complete<K>

fn num_vertices(&self) -> usize

fn vertices(&self) -> VertexIter<Self>

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>

impl<K: CompleteEdgeKind> Adjacency for Complete<K>

fn out_neighbors(&self, v: CVertex) -> OutNeighborIter<Self>

fn out_degree(&self, v: Vertex<Self>) -> usize

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>>

impl<T, K: CompleteEdgeKind> WithVertexProp<T> for Complete<K>

type VertexProp = VecVertexProp<Complete<K>, T>

The vertex property type.

fn default_vertex_prop(&self, value: T) -> DefaultVertexPropMut<Self, T> where
    T: Clone, 

Creates a new default vertex property where the initial value associated with each vertex is value.

fn default_vertex_prop_from_fn<P, F>(&self, fun: F) -> P where
    Self: VertexList,
    P: VertexPropMutNew<Self, T>,
    F: FnMut(Vertex<Self>) -> T,
    T: Default + Clone, 

Creates a new default vertex property where the initial value associated with each vertex v is produced by fun(v).

impl<T, K: CompleteEdgeKind> WithEdgeProp<T> for Complete<K> where
    Complete<K>: WithEdgeIndexProp, 

type EdgeProp = VecEdgeProp<Complete<K>, T>

fn default_edge_prop(&self, value: T) -> DefaultEdgePropMut<Self, T> where
    T: Clone, 

Creates a new default edge property where the initial value associated with each edge is value.

fn default_edge_prop_from_fn<P, F>(&self, fun: F) -> P where
    Self: EdgeList,
    P: EdgePropMutNew<Self, T>,
    F: FnMut(Edge<Self>) -> T,
    T: Default + Clone, 

Creates a new default edge property where the initial value associated with each edge e is produced by fun(e).

impl<K: CompleteEdgeKind> BasicVertexProps for Complete<K>

impl<K: CompleteEdgeKind> BasicEdgeProps for Complete<K>

impl<K: CompleteEdgeKind> BasicProps for Complete<K>

impl<K: CompleteEdgeKind> Choose for Complete<K>

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.

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.

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.

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.

fn choose_vertex_iter<R: Rng>(&self, rng: R) -> ChooseVertexIter<Self, R>

Returns an iterator that repeatedly calls choose_vertex.

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).

fn choose_edge_iter<R: Rng>(&self, rng: R) -> ChooseEdgeIter<Self, R>

Returns an iterator that repeatedly calls choose_edge.

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).

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.

impl<K: CompleteEdgeKind> WithVertexIndexProp for Complete<K>

type VertexIndexProp = CVertexIndexProp

fn vertex_index(&self) -> CVertexIndexProp

Creates an vertex index map.

impl<K: CompleteEdgeKind> WithEdgeIndexProp for Complete<K>

type EdgeIndexProp = CEdgeIndexProp<K::Edge>

fn edge_index(&self) -> CEdgeIndexProp<K::Edge>

Creates an edge index map.