Struct fera_graph::graphs::static_::Static

pub struct Static<V: Num, K: StaticEdgeKind> { /* fields omitted */ }

Trait Implementations

impl<V: Clone + Num, K: Clone + StaticEdgeKind> Clone for Static<V, K> where
    K::Edge: Clone, 

fn clone(&self) -> Static<V, K>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<V: Debug + Num, K: Debug + StaticEdgeKind> Debug for Static<V, K> where
    K::Edge: Debug, 

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

Formats the value using the given formatter.

impl<V: PartialEq + Num, K: PartialEq + StaticEdgeKind> PartialEq for Static<V, K> where
    K::Edge: PartialEq, 

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

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

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

This method tests for !=.

impl<V: Num, K: StaticEdgeKind> WithBuilder for Static<V, K>

type Builder = StaticBuilder<V, K>

The builder for this graph type.

fn builder(num_vertices: usize, num_edges: usize) -> Self::Builder

Creates a new builder for a graph of this type with n vertices and initial capacity for m edges.

fn new_with_edges<I>(n: usize, edges: I) -> Self where
    I: IntoIterator<Item = (usize, usize)>, 

Creates a new graph with n vertices from edges iterator.

fn new_empty(n: usize) -> Self

Creates a graph with n vertices and no edges.

fn new_complete(n: usize) -> Self where
    Self: WithEdge<Kind = Undirected>, 

Creates a complete graph with n vertices.

fn new_complete_binary_tree(h: u32) -> Self where
    Self: WithEdge<Kind = Undirected>, 

Creates a graph that is a complete binary tree with height h.

fn new_random_tree<R: Rng>(n: usize, rng: R) -> Self

Creates a graph with n vertices that is a tree, that is, is connected and acyclic.

fn new_random_tree_with_diameter<R: Rng>(n: u32, d: u32, rng: R) -> Option<Self>

Similar to [new_random_tree] but creates a tree with diameter d. Returns None if the diameter is invalid.

fn new_gn<R>(n: usize, rng: R) -> Self where
    Self::Kind: UniformEdgeKind,
    R: Rng, 

Creates a random graph with n vertices.

fn new_gn_connected<R: Rng>(n: usize, rng: R) -> Self where
    Self::Kind: UniformEdgeKind, 

Creates a random connected graph with n vertices.

fn new_gnm<R>(n: usize, m: usize, rng: R) -> Option<Self> where
    Self::Kind: UniformEdgeKind,
    R: Rng, 

Creates a random graph with n vertices and m edges.

fn new_gnm_connected<R: Rng>(n: usize, m: usize, rng: R) -> Option<Self> where
    Self::Kind: UniformEdgeKind, 

Creates a random connected graph (weakly connected if Self is a digraph) with n vertices and m edges.

impl<V: Num, K: StaticEdgeKind> WithVertex for Static<V, K>

type Vertex = StaticVertex<V>

type OptionVertex = OptionalMax<StaticVertex<V>>

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<V: Num, K: StaticEdgeKind> WithEdge for Static<V, K>

type Kind = K::Kind

type Edge = K::Edge

type OptionEdge = OptionalMax<Self::Edge>

fn orientation(&self, _e: Edge<Self>) -> Orientation

fn source(&self, e: Edge<Self>) -> Vertex<Self>

fn target(&self, e: Edge<Self>) -> Vertex<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 end_vertices(&self, e: Edge<Self>) -> (Vertex<Self>, Vertex<Self>)

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 reverse(&self, e: Edge<Self>) -> Edge<Self> where
    Self: WithEdge<Kind = Undirected>, 

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<'a, V: Num, K: StaticEdgeKind> VertexTypes<'a, Static<V, K>> for Static<V, K>

type VertexIter = V::Range

type OutNeighborIter = OutNeighborFromOutEdge<'a, Self, OutEdgeIter<'a, Self>>

impl<'a, V: Num, K: StaticEdgeKind> EdgeTypes<'a, Static<V, K>> for Static<V, K>

type EdgeIter = SEdgeIter<K>

type OutEdgeIter = Cloned<Iter<'a, Edge<Self>>>

impl<V: Num, K: StaticEdgeKind> VertexList for Static<V, K>

fn num_vertices(&self) -> usize

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

impl<V: Num, K: StaticEdgeKind> EdgeList for Static<V, K>

fn num_edges(&self) -> usize

fn edges(&self) -> EdgeIter<Self>

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<V: Num, K: StaticEdgeKind> Adjacency for Static<V, K>

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

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

impl<V: Num, K: StaticEdgeKind> Incidence for Static<V, 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<V: Num, K: StaticEdgeKind> WithVertexIndexProp for Static<V, K>

type VertexIndexProp = SVertexIndexProp

fn vertex_index(&self) -> VertexIndexProp<Self>

Creates an vertex index map.

impl<V: Num, K: StaticEdgeKind> WithEdgeIndexProp for Static<V, K>

type EdgeIndexProp = SEdgeIndexProp<K>

fn edge_index(&self) -> EdgeIndexProp<Self>

Creates an edge index map.

impl<T, V: Num, K: StaticEdgeKind> WithVertexProp<T> for Static<V, K>

type VertexProp = VecVertexProp<Self, 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<V: Num, K: StaticEdgeKind> BasicVertexProps for Static<V, K>

impl<T, V: Num, K: StaticEdgeKind> WithEdgeProp<T> for Static<V, K>

type EdgeProp = VecEdgeProp<Self, 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<V: Num, K: StaticEdgeKind> BasicEdgeProps for Static<V, K>

impl<V: Num, K: StaticEdgeKind> BasicProps for Static<V, K>

impl<V: Num, K: StaticEdgeKind> Choose for Static<V, 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.