Trait fera_graph::algs::degrees::Degrees
[−]
[src]
pub trait Degrees: Adjacency { fn degree_spanning_subgraph<I>(
&self,
edges: I
) -> DefaultVertexPropMut<Self, u32>
where
Self: WithEdge + WithVertexProp<u32>,
I: IntoIterator,
I::Item: IntoOwned<Edge<Self>>, { ... } fn degree_add<P, I>(&self, degree: &mut P, edges: I)
where
Self: WithEdge,
P: VertexPropMut<Self, u32>,
I: IntoIterator,
I::Item: IntoOwned<Edge<Self>>, { ... } fn is_k_regular(&self, k: usize) -> bool
where
Self: WithEdge<Kind = Undirected> + VertexList, { ... } fn is_regular(&self) -> bool
where
Self: WithEdge<Kind = Undirected> + VertexList, { ... } fn maximum_out_degree(&self) -> Option<usize>
where
Self: VertexList, { ... } fn minimum_out_degree(&self) -> Option<usize>
where
Self: VertexList, { ... } fn is_isolated(&self, v: Vertex<Self>) -> bool
where
Self: WithEdge<Kind = Undirected>, { ... } fn is_pendant(&self, v: Vertex<Self>) -> bool
where
Self: WithEdge<Kind = Undirected>, { ... } }
Provided Methods
fn degree_spanning_subgraph<I>(
&self,
edges: I
) -> DefaultVertexPropMut<Self, u32> where
Self: WithEdge + WithVertexProp<u32>,
I: IntoIterator,
I::Item: IntoOwned<Edge<Self>>,
&self,
edges: I
) -> DefaultVertexPropMut<Self, u32> where
Self: WithEdge + WithVertexProp<u32>,
I: IntoIterator,
I::Item: IntoOwned<Edge<Self>>,
fn degree_add<P, I>(&self, degree: &mut P, edges: I) where
Self: WithEdge,
P: VertexPropMut<Self, u32>,
I: IntoIterator,
I::Item: IntoOwned<Edge<Self>>,
Self: WithEdge,
P: VertexPropMut<Self, u32>,
I: IntoIterator,
I::Item: IntoOwned<Edge<Self>>,
fn is_k_regular(&self, k: usize) -> bool where
Self: WithEdge<Kind = Undirected> + VertexList,
Self: WithEdge<Kind = Undirected> + VertexList,
fn is_regular(&self) -> bool where
Self: WithEdge<Kind = Undirected> + VertexList,
Self: WithEdge<Kind = Undirected> + VertexList,
fn maximum_out_degree(&self) -> Option<usize> where
Self: VertexList,
Self: VertexList,
fn minimum_out_degree(&self) -> Option<usize> where
Self: VertexList,
Self: VertexList,
fn is_isolated(&self, v: Vertex<Self>) -> bool where
Self: WithEdge<Kind = Undirected>,
Self: WithEdge<Kind = Undirected>,
fn is_pendant(&self, v: Vertex<Self>) -> bool where
Self: WithEdge<Kind = Undirected>,
Self: WithEdge<Kind = Undirected>,
Implementors
impl<G: Adjacency> Degrees for G