Struct net_ensembles::BAensemble[−][src]

pub struct BAensemble<T, R> where
    T: Node,
    R: Rng,  { /* fields omitted */ }

Expand description

Implements a Barabási-Albert Graph ensemble

Implementations

[src]

impl<T, R> BAensemble<T, R> where
T: Node + SerdeStateConform,
R: Rng,

[src]

pub fn new(n: usize, rng: R, m: usize, source_n: usize) -> Self

Initialize

create simplest form of Barabási-Albert graph
m = 1
n: Number of nodes, n > 1 has to be true panics otherwise
rng: Rng to use

[src]

pub fn new_from_graph(n: usize, rng: R, m: usize, source_graph: B) -> Self where
B: Borrow<Graph<T>>,

Generate a new BA graph ensemble with a specified source graph

panics if source_graph contains any vertices with degree 0
m: how many edges should each newly added vertex have originally
rng: Random number generator
n: Number of nodes, n > source_graph.vertex_count() has to be true panics otherwise

[src]

pub fn new_from_generic_graph<A2, B>(
 n: usize,
 rng: R,
 m: usize,
 generic_source_graph: B
) -> Self where
 A2: AdjContainer<T>,
 B: Borrow<GenericGraph<T, A2>>,

Generate a new BA graph ensemble with a specified generic source graph

panics if generic_source_graph contains any vertices with degree 0
m: how many edges should each newly added vertex have originally
rng: Random number generator
n: Number of nodes, n > source_graph.vertex_count() has to be true panics otherwise

[src]

pub fn source_graph(&self) -> &Graph<T>

get reference to original graph, which is at the core of the BA graph

Trait Implementations

[src]

impl<T, R> AsRef<GenericGraph<T, NodeContainer<T>>> for BAensemble<T, R> where
T: Node,
R: Rng,

[src]

fn as_ref(&self) -> &Graph<T>

Performs the conversion.

[src]

impl<T, R> Borrow<GenericGraph<T, NodeContainer<T>>> for BAensemble<T, R> where
T: Node,
R: Rng,

[src]

fn borrow(&self) -> &Graph<T>

Immutably borrows from an owned value. Read more

[src]

impl<T: Clone, R: Clone> Clone for BAensemble<T, R> where
T: Node,
R: Rng,

[src]

fn clone(&self) -> BAensemble<T, R>

Returns a copy of the value. Read more

1.0.0[src]

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

Performs copy-assignment from source. Read more

[src]

impl<T: Debug, R: Debug> Debug for BAensemble<T, R> where
T: Node,
R: Rng,

[src]

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

[src]

impl<'de, T, R> Deserialize<'de> for BAensemble<T, R> where
 T: Node,
 R: Rng,
 T: Deserialize<'de>,
 R: Deserialize<'de>,

[src]

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error> where
__D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more

[src]

impl<T, R> GraphIteratorsMut<T, GenericGraph<T, NodeContainer<T>>, NodeContainer<T>> for BAensemble<T, R> where
T: Node + SerdeStateConform,
R: Rng,

[src]

fn contained_iter_neighbors_mut(
 &mut self,
 index: usize
) -> NContainedIterMut<'_, T, NodeContainer<T>>ⓘ
Notable traits for NContainedIterMut<'a, T, A>
`impl<'a, T, A> Iterator for NContainedIterMut<'a, T, A> where T: 'a + Node, A: AdjContainer<T>, type Item = &'a mut T;`

iterate over mutable additional information of neighbors of vertex index

iterator returns &mut T

sort_adj will affect the order

panics if index out of bounds

[src]

fn contained_iter_neighbors_mut_with_index(
 &mut self,
 index: usize
) -> INContainedIterMut<'_, T, NodeContainer<T>>ⓘ
Notable traits for INContainedIterMut<'a, T, A>
`impl<'a, T, A> Iterator for INContainedIterMut<'a, T, A> where T: 'a + Node, A: AdjContainer<T>, type Item = (usize, &'a mut T);`

iterate over mutable additional information of neighbors of vertex index

iterator returns (index_neighbor: usize, neighbor: &mut T)

sort_adj will affect the order

panics if index out of bounds

[src]

fn contained_iter_mut(&mut self) -> ContainedIterMut<'_, T, NodeContainer<T>>ⓘ
Notable traits for ContainedIterMut<'a, T, A>
`impl<'a, T, A> Iterator for ContainedIterMut<'a, T, A> where T: 'a + Node, A: AdjContainer<T>, type Item = &'a mut T;`

get iterator over mutable additional information stored at each vertex in order of the indices

iterator returns a Node (for example EmptyNode or whatever you used)

[src]

impl<T, R> Serialize for BAensemble<T, R> where
 T: Node,
 R: Rng,
 T: Serialize,
 R: Serialize,

[src]

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error> where
S: Serializer,

Serialize this value into the given Serde serializer. Read more

[src]

impl<T, R> SimpleSample for BAensemble<T, R> where
T: Node + SerdeStateConform,
R: Rng,

[src]

fn randomize(&mut self)

Randomizes the Barabási-Albert (BA) graph

this essentially deletes the BA graph and creates a new one using the initial graph

[src]

fn simple_sample<F>(&mut self, times: usize, f: F) where
F: FnMut(&Self),

do the following times times: Read more

[src]

fn simple_sample_vec<F, G>(&mut self, times: usize, f: F) -> Vec<G, Global> where
F: FnMut(&Self) -> G,

do the following times times: Read more

[src]

impl<T, R> WithGraph<T, GenericGraph<T, NodeContainer<T>>> for BAensemble<T, R> where
T: Node + SerdeStateConform,
R: Rng,

[src]

fn at(&self, index: usize) -> &T

access additional information at index

[src]

fn at_mut(&mut self, index: usize) -> &mut T

mutable access to additional information at index

[src]

fn graph(&self) -> &Graph<T>

returns reference to the underlying topology aka, the GenericGraph

use this to call functions regarding the topology

[src]

fn sort_adj(&mut self)

sorts Adjecaency List

Auto Trait Implementations

impl<T, R> RefUnwindSafe for BAensemble<T, R> where
R: RefUnwindSafe,
T: RefUnwindSafe,

impl<T, R> Send for BAensemble<T, R> where
R: Send,
T: Send,

impl<T, R> Sync for BAensemble<T, R> where
R: Sync,
T: Sync,

impl<T, R> Unpin for BAensemble<T, R> where
R: Unpin,
T: Unpin,

impl<T, R> UnwindSafe for BAensemble<T, R> where
R: UnwindSafe,
T: UnwindSafe,

Blanket Implementations

[src]

impl<T> Any for T where
T: 'static + ?Sized,

[src]

pub fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

[src]

impl<T> Borrow<T> for T where
T: ?Sized,

[src]

pub fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

[src]

impl<T> BorrowMut<T> for T where
T: ?Sized,

[src]

pub fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more

impl<S, T> Cast<T> for S where
T: Conv<S>,

pub fn cast(self) -> T

Cast from Self to T

pub fn try_cast(self) -> Result<T, Error>

Try converting from Self to T

impl<S, T> CastFloat<T> for S where
T: ConvFloat<S>,

pub fn cast_trunc(self) -> T

Cast to integer, truncating Read more

pub fn cast_nearest(self) -> T

Cast to the nearest integer Read more

pub fn cast_floor(self) -> T

Cast the floor to an integer Read more

pub fn cast_ceil(self) -> T

Cast the ceiling to an integer Read more

pub fn try_cast_trunc(self) -> Result<T, Error>

Try converting to integer with truncation Read more

pub fn try_cast_nearest(self) -> Result<T, Error>

Try converting to the nearest integer Read more

pub fn try_cast_floor(self) -> Result<T, Error>

Try converting the floor to an integer Read more

pub fn try_cast_ceil(self) -> Result<T, Error>

Try convert the ceiling to an integer Read more

impl<T> Conv<T> for T

pub fn conv(v: T) -> T

Convert from T to Self

pub fn try_conv(v: T) -> Result<T, Error>

Try converting from T to Self

[src]

impl<T> From<T> for T

[src]

pub fn from(t: T) -> T

Performs the conversion.

[src]

impl<T, U> Into for T where
U: From<T>,

[src]

pub fn into(self) -> U

Performs the conversion.

impl<T> Pointable for T

pub const ALIGN: usize

The alignment of pointer.

type Init = T

The type for initializers.

pub unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more

pub unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more

pub unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more

pub unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more

[src]

impl<T> ToOwned for T where
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

[src]

pub fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more

[src]

pub fn clone_into(&self, target: &mut T)

🔬 This is a nightly-only experimental API. (toowned_clone_into)

Uses borrowed data to replace owned data, usually by cloning. Read more

[src]

impl<T, U> TryFrom for T where
U: Into<T>,

type Error = Infallible

The type returned in the event of a conversion error.

[src]

pub fn try_from(value: U) -> Result<T, <T as TryFrom>::Error>

Performs the conversion.

[src]

impl<T, U> TryInto for T where
U: TryFrom<T>,

type Error = >::Error

The type returned in the event of a conversion error.

[src]

pub fn try_into(self) -> Result<U, >::Error>

Performs the conversion.

impl<V, T> VZip<V> for T where
V: MultiLane<T>,

pub fn vzip(self) -> V

[src]

impl<T> DeserializeOwned for T where
T: for<'de> Deserialize<'de>,

[src]

Struct net_ensembles::BAensemble[−][src]

Implementations

impl<T, R> BAensemble<T, R> where T: Node + SerdeStateConform, R: Rng,

pub fn new(n: usize, rng: R, m: usize, source_n: usize) -> Self

Initialize

pub fn new_from_graph<B>(n: usize, rng: R, m: usize, source_graph: B) -> Self where B: Borrow<Graph<T>>,

pub fn new_from_generic_graph<A2, B>( n: usize, rng: R, m: usize, generic_source_graph: B) -> Self where A2: AdjContainer<T>, B: Borrow<GenericGraph<T, A2>>,

pub fn source_graph(&self) -> &Graph<T>

Trait Implementations

impl<T, R> AsRef<GenericGraph<T, NodeContainer<T>>> for BAensemble<T, R> where T: Node, R: Rng,

fn as_ref(&self) -> &Graph<T>

impl<T, R> Borrow<GenericGraph<T, NodeContainer<T>>> for BAensemble<T, R> where T: Node, R: Rng,

fn borrow(&self) -> &Graph<T>

impl<T: Clone, R: Clone> Clone for BAensemble<T, R> where T: Node, R: Rng,

fn clone(&self) -> BAensemble<T, R>

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

impl<T: Debug, R: Debug> Debug for BAensemble<T, R> where T: Node, R: Rng,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

impl<'de, T, R> Deserialize<'de> for BAensemble<T, R> where T: Node, R: Rng, T: Deserialize<'de>, R: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where __D: Deserializer<'de>,

impl<T, R> GraphIteratorsMut<T, GenericGraph<T, NodeContainer<T>>, NodeContainer<T>> for BAensemble<T, R> where T: Node + SerdeStateConform, R: Rng,

fn contained_iter_neighbors_mut( &mut self, index: usize) -> NContainedIterMut<'_, T, NodeContainer<T>>ⓘNotable traits for NContainedIterMut<'a, T, A>impl<'a, T, A> Iterator for NContainedIterMut<'a, T, A> where T: 'a + Node, A: AdjContainer<T>, type Item = &'a mut T;

fn contained_iter_neighbors_mut_with_index( &mut self, index: usize) -> INContainedIterMut<'_, T, NodeContainer<T>>ⓘNotable traits for INContainedIterMut<'a, T, A>impl<'a, T, A> Iterator for INContainedIterMut<'a, T, A> where T: 'a + Node, A: AdjContainer<T>, type Item = (usize, &'a mut T);

fn contained_iter_mut(&mut self) -> ContainedIterMut<'_, T, NodeContainer<T>>ⓘNotable traits for ContainedIterMut<'a, T, A>impl<'a, T, A> Iterator for ContainedIterMut<'a, T, A> where T: 'a + Node, A: AdjContainer<T>, type Item = &'a mut T;

impl<T, R> Serialize for BAensemble<T, R> where T: Node, R: Rng, T: Serialize, R: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where __S: Serializer,

impl<T, R> SimpleSample for BAensemble<T, R> where T: Node + SerdeStateConform, R: Rng,

fn randomize(&mut self)

Randomizes the Barabási-Albert (BA) graph

fn simple_sample<F>(&mut self, times: usize, f: F) where F: FnMut(&Self),

fn simple_sample_vec<F, G>(&mut self, times: usize, f: F) -> Vec<G, Global> where F: FnMut(&Self) -> G,

impl<T, R> WithGraph<T, GenericGraph<T, NodeContainer<T>>> for BAensemble<T, R> where T: Node + SerdeStateConform, R: Rng,

fn at(&self, index: usize) -> &T

fn at_mut(&mut self, index: usize) -> &mut T

fn graph(&self) -> &Graph<T>

fn sort_adj(&mut self)

Auto Trait Implementations

impl<T, R> RefUnwindSafe for BAensemble<T, R> where R: RefUnwindSafe, T: RefUnwindSafe,

impl<T, R> Send for BAensemble<T, R> where R: Send, T: Send,

impl<T, R> Sync for BAensemble<T, R> where R: Sync, T: Sync,

impl<T, R> Unpin for BAensemble<T, R> where R: Unpin, T: Unpin,

impl<T, R> UnwindSafe for BAensemble<T, R> where R: UnwindSafe, T: UnwindSafe,

Blanket Implementations

impl<T> Any for T where T: 'static + ?Sized,

pub fn type_id(&self) -> TypeId

impl<T> Borrow<T> for T where T: ?Sized,

pub fn borrow(&self) -> &T

impl<T> BorrowMut<T> for T where T: ?Sized,

pub fn borrow_mut(&mut self) -> &mut T

impl<S, T> Cast<T> for S where T: Conv<S>,

pub fn cast(self) -> T

pub fn try_cast(self) -> Result<T, Error>

impl<S, T> CastFloat<T> for S where T: ConvFloat<S>,

pub fn cast_trunc(self) -> T

pub fn cast_nearest(self) -> T

pub fn cast_floor(self) -> T

pub fn cast_ceil(self) -> T

pub fn try_cast_trunc(self) -> Result<T, Error>

pub fn try_cast_nearest(self) -> Result<T, Error>

pub fn try_cast_floor(self) -> Result<T, Error>

pub fn try_cast_ceil(self) -> Result<T, Error>

impl<T> Conv<T> for T

pub fn conv(v: T) -> T

pub fn try_conv(v: T) -> Result<T, Error>

impl<T> From<T> for T

pub fn from(t: T) -> T

impl<T, U> Into<U> for T where U: From<T>,

pub fn into(self) -> U

impl<T> Pointable for T

pub const ALIGN: usize

type Init = T

pub unsafe fn init(init: <T as Pointable>::Init) -> usize

pub unsafe fn deref<'a>(ptr: usize) -> &'a T

pub unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

pub unsafe fn drop(ptr: usize)

impl<T> ToOwned for T where T: Clone,

type Owned = T

pub fn to_owned(&self) -> T

pub fn clone_into(&self, target: &mut T)

impl<T, U> TryFrom<U> for T where U: Into<T>,

impl<T, R> BAensemble<T, R> where
T: Node + SerdeStateConform,
R: Rng,

pub fn new_from_graph<B>(n: usize, rng: R, m: usize, source_graph: B) -> Self where
B: Borrow<Graph<T>>,

pub fn new_from_generic_graph<A2, B>(
n: usize,
rng: R,
m: usize,
generic_source_graph: B
) -> Self where
A2: AdjContainer<T>,
B: Borrow<GenericGraph<T, A2>>,

impl<T, R> AsRef<GenericGraph<T, NodeContainer<T>>> for BAensemble<T, R> where
T: Node,
R: Rng,

impl<T, R> Borrow<GenericGraph<T, NodeContainer<T>>> for BAensemble<T, R> where
T: Node,
R: Rng,

impl<T: Clone, R: Clone> Clone for BAensemble<T, R> where
T: Node,
R: Rng,

impl<T: Debug, R: Debug> Debug for BAensemble<T, R> where
T: Node,
R: Rng,

impl<'de, T, R> Deserialize<'de> for BAensemble<T, R> where
T: Node,
R: Rng,
T: Deserialize<'de>,
R: Deserialize<'de>,

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error> where
__D: Deserializer<'de>,

impl<T, R> GraphIteratorsMut<T, GenericGraph<T, NodeContainer<T>>, NodeContainer<T>> for BAensemble<T, R> where
T: Node + SerdeStateConform,
R: Rng,

fn contained_iter_neighbors_mut(
&mut self,
index: usize
) -> NContainedIterMut<'_, T, NodeContainer<T>>ⓘ
Notable traits for NContainedIterMut<'a, T, A>
`impl<'a, T, A> Iterator for NContainedIterMut<'a, T, A> where T: 'a + Node, A: AdjContainer<T>, type Item = &'a mut T;`

fn contained_iter_neighbors_mut_with_index(
&mut self,
index: usize
) -> INContainedIterMut<'_, T, NodeContainer<T>>ⓘ
Notable traits for INContainedIterMut<'a, T, A>
`impl<'a, T, A> Iterator for INContainedIterMut<'a, T, A> where T: 'a + Node, A: AdjContainer<T>, type Item = (usize, &'a mut T);`

fn contained_iter_mut(&mut self) -> ContainedIterMut<'_, T, NodeContainer<T>>ⓘ
Notable traits for ContainedIterMut<'a, T, A>
`impl<'a, T, A> Iterator for ContainedIterMut<'a, T, A> where T: 'a + Node, A: AdjContainer<T>, type Item = &'a mut T;`

impl<T, R> Serialize for BAensemble<T, R> where
T: Node,
R: Rng,
T: Serialize,
R: Serialize,

fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error> where
S: Serializer,

impl<T, R> SimpleSample for BAensemble<T, R> where
T: Node + SerdeStateConform,
R: Rng,

fn simple_sample<F>(&mut self, times: usize, f: F) where
F: FnMut(&Self),

fn simple_sample_vec<F, G>(&mut self, times: usize, f: F) -> Vec<G, Global> where
F: FnMut(&Self) -> G,

impl<T, R> WithGraph<T, GenericGraph<T, NodeContainer<T>>> for BAensemble<T, R> where
T: Node + SerdeStateConform,
R: Rng,

impl<T, R> RefUnwindSafe for BAensemble<T, R> where
R: RefUnwindSafe,
T: RefUnwindSafe,

impl<T, R> Send for BAensemble<T, R> where
R: Send,
T: Send,

impl<T, R> Sync for BAensemble<T, R> where
R: Sync,
T: Sync,

impl<T, R> Unpin for BAensemble<T, R> where
R: Unpin,
T: Unpin,

impl<T, R> UnwindSafe for BAensemble<T, R> where
R: UnwindSafe,
T: UnwindSafe,

impl<T> Any for T where
T: 'static + ?Sized,

impl<T> Borrow<T> for T where
T: ?Sized,

impl<T> BorrowMut<T> for T where
T: ?Sized,

impl<S, T> Cast<T> for S where
T: Conv<S>,

impl<S, T> CastFloat<T> for S where
T: ConvFloat<S>,

impl<T, U> Into<U> for T where
U: From<T>,

impl<T> ToOwned for T where
T: Clone,

impl<T, U> TryFrom<U> for T where
U: Into<T>,

impl<T, U> TryInto<U> for T where
U: TryFrom<T>,

impl<V, T> VZip<V> for T where
V: MultiLane<T>,

impl<T> DeserializeOwned for T where
T: for<'de> Deserialize<'de>,

impl<T> SerdeStateConform for T where
T: Serialize,