Struct net_ensembles::dual_graph::DualGraph

source · [−]

pub struct DualGraph<ADJ, T1, A1, T2, A2> { /* private fields */ }

Implementations

source

impl<ADJ, T1, A1, T2, A2> DualGraph<ADJ, T1, A1, T2, A2>where
ADJ: AdjTrait,

source

pub fn new(graph_1: GenericGraph<T1, A1>, graph_2: GenericGraph<T2, A2>) -> Self

source

pub fn adj_1(&self) -> &[ADJ]ⓘNotable traits for &[u8]`impl Read for &[u8]impl Write for &mut [u8]`

source

pub fn adj_2(&self) -> &[ADJ]ⓘNotable traits for &[u8]`impl Read for &[u8]impl Write for &mut [u8]`

source

pub fn size(&self) -> (usize, usize)

source

pub fn add_edge(
 &mut self,
 index_graph_1: usize,
 index_graph_2: usize
) -> Result<(), AddEdgeError>

source

pub fn total_vertices(&self) -> usize

source

impl<ADJ, T1, A1, T2, A2> DualGraph<ADJ, T1, A1, T2, A2>where
A1: AdjContainer<T1>,
ADJ: AdjTrait,

source

pub fn degree_1(&self, index: usize) -> usize

source

impl<ADJ, T1, A1, T2, A2> DualGraph<ADJ, T1, A1, T2, A2>where
A2: AdjContainer<T2>,
ADJ: AdjTrait,

source

pub fn degree_2(&self, index: usize) -> usize

source

impl<T1, T2, A1, A2, ADJ> DualGraph<ADJ, T1, A1, T2, A2>where
 A1: AdjContainer<T1>,
 A2: AdjContainer<T2>,
 ADJ: AdjTrait,

source

pub fn dfs_index(&self, index: DualIndex) -> impl '_ + Iterator<Item = DualIndex>

Depth first search iterator starting at the node corresponding to index

Note that, this iterator will return indices from both graphs, the corresponding graph is given by the variant of DualIndex

source

pub fn dfs_1_index(&self, index: usize) -> impl '_ + Iterator<Item = DualIndex>

Depth first search iterator starting at the node in graph_1 corresponding to index

Note that, this iterator will return indices from both graphs, the corresponding graph is given by the variant of DualIndex

source

pub fn dfs_2_index(&self, index: usize) -> impl '_ + Iterator<Item = DualIndex>

Depth first search iterator starting at the node in graph_2 corresponding to index

Note that, this iterator will return indices from both graphs, the corresponding graph is given by the variant of DualIndex

source

pub fn bfs_index(
&self,
index: DualIndex
) -> impl '_ + Iterator<Item = (DualIndex, usize)>

source

pub fn is_connected(&self) -> bool

source

pub fn diameter(&self) -> Option<usize>

returns None if graph not connected or does not contain any vertices
uses repeated breadth first search

source

impl<T, A1, A2> DualGraph<AdjSingle, T1, A1, T2, A2>where
A1: AdjContainer<T> + AdjList<usize>,
A2: AdjContainer<T> + AdjList<usize>,

source

pub fn graph_1_contained_iter_neighbors_in_other_graph_mut(
&mut self,
index: usize
) -> impl Iterator<Item = &mut T>

source

pub fn graph_2_contained_iter_neighbors_in_other_graph_mut(
&mut self,
index: usize
) -> impl Iterator<Item = &mut T>

source

pub fn graph_1_contained_iter_mut(
&mut self,
index: usize
) -> impl Iterator<Item = &mut T>

Note: This will first iterate over all neighbors from this graph and then over all neighbors from the other graph

source

pub fn graph_1_contained_iter(&self, index: usize) -> impl Iterator<Item = &T>

Note: This will first iterate over all neighbors from this graph and then over all neighbors from the other graph

source

pub fn graph_2_contained_iter(&self, index: usize) -> impl Iterator<Item = &T>

Note: This will first iterate over all neighbors from this graph and then over all neighbors from the other graph

source

pub fn graph_1_contained_iter_mut_which_graph_with_index(
&mut self,
index: usize
) -> impl Iterator<Item = WhichGraph<(usize, &mut T)>>

source

pub fn graph_1_contained_iter_mut_which_graph(
&mut self,
index: usize
) -> impl Iterator<Item = WhichGraph<&mut T>>

source

pub fn graph_2_contained_iter_mut_which_graph(
&mut self,
index: usize
) -> impl Iterator<Item = WhichGraph<&mut T>>

source

pub fn graph_2_contained_iter_mut_which_graph_with_index(
&mut self,
index: usize
) -> impl Iterator<Item = WhichGraph<(usize, &mut T)>>

source

impl<T, A1, A2, ADJ> DualGraph<ADJ, T, A1, T, A2>where
 A1: AdjContainer<T>,
 A2: AdjContainer<T>,
 ADJ: AdjTrait,

source

pub fn contained_iter_neighbors_1(
&self,
index: usize
) -> impl Iterator<Item = &T>

Iterate over all neighbors of the node corresponding to index from graph_1. Note, that this also includes possible neighbors in the second graph

source

pub fn contained_iter_neighbors_2(
&self,
index: usize
) -> impl Iterator<Item = &T>

Iterate over all neighbors of the node corresponding to index from graph_1. Note, that this also includes possible neighbors in the second graph

source

pub fn dfs_contained(
 &self,
 index: DualIndex
) -> DfsDualContained<'_, T, A1, A2, ADJ>ⓘNotable traits for DfsDualContained<'a, T, A1, A2, ADJ>`impl<'a, T, A1, A2, ADJ> Iterator for DfsDualContained<'a, T, A1, A2, ADJ>where T: 'a, A1: AdjContainer<T>, A2: AdjContainer<T>, ADJ: AdjTrait, type Item = &'a T;`

source

pub fn dfs_1_contained(
 &self,
 index_graph_1: usize
) -> DfsDualContained<'_, T, A1, A2, ADJ>ⓘNotable traits for DfsDualContained<'a, T, A1, A2, ADJ>`impl<'a, T, A1, A2, ADJ> Iterator for DfsDualContained<'a, T, A1, A2, ADJ>where T: 'a, A1: AdjContainer<T>, A2: AdjContainer<T>, ADJ: AdjTrait, type Item = &'a T;`

source

pub fn dfs_2_contained(
 &self,
 index_graph_2: usize
) -> DfsDualContained<'_, T, A1, A2, ADJ>ⓘNotable traits for DfsDualContained<'a, T, A1, A2, ADJ>`impl<'a, T, A1, A2, ADJ> Iterator for DfsDualContained<'a, T, A1, A2, ADJ>where T: 'a, A1: AdjContainer<T>, A2: AdjContainer<T>, ADJ: AdjTrait, type Item = &'a T;`

Trait Implementations

source

impl<ADJ: Clone, T1: Clone, A1: Clone, T2: Clone, A2: Clone> Clone for DualGraph<ADJ, T1, A1, T2, A2>

source

fn clone(&self) -> DualGraph<ADJ, T1, A1, T2, A2>

Returns a copy of the value. Read more

1.0.0 · source

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

Performs copy-assignment from source. Read more

source

impl<'de, ADJ, T1, A1, T2, A2> Deserialize<'de> for DualGraph<ADJ, T1, A1, T2, A2>where
 ADJ: Deserialize<'de>,
 T1: Deserialize<'de>,
 A1: Deserialize<'de>,
 T2: Deserialize<'de>,
 A2: Deserialize<'de>,

source

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

Deserialize this value from the given Serde deserializer. Read more

source

impl<ADJ, T1, A1, T2, A2> Serialize for DualGraph<ADJ, T1, A1, T2, A2>where
 ADJ: Serialize,
 T1: Serialize,
 A1: Serialize,
 T2: Serialize,
 A2: Serialize,

source

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

Serialize this value into the given Serde serializer. Read more

Auto Trait Implementations

impl<ADJ, T1, A1, T2, A2> RefUnwindSafe for DualGraph<ADJ, T1, A1, T2, A2>where
 A1: RefUnwindSafe,
 A2: RefUnwindSafe,
 ADJ: RefUnwindSafe,
 T1: RefUnwindSafe,
 T2: RefUnwindSafe,

impl<ADJ, T1, A1, T2, A2> Send for DualGraph<ADJ, T1, A1, T2, A2>where
 A1: Send,
 A2: Send,
 ADJ: Send,
 T1: Send,
 T2: Send,

impl<ADJ, T1, A1, T2, A2> Sync for DualGraph<ADJ, T1, A1, T2, A2>where
 A1: Sync,
 A2: Sync,
 ADJ: Sync,
 T1: Sync,
 T2: Sync,

impl<ADJ, T1, A1, T2, A2> Unpin for DualGraph<ADJ, T1, A1, T2, A2>where
 A1: Unpin,
 A2: Unpin,
 ADJ: Unpin,
 T1: Unpin,
 T2: Unpin,

impl<ADJ, T1, A1, T2, A2> UnwindSafe for DualGraph<ADJ, T1, A1, T2, A2>where
 A1: UnwindSafe,
 A2: UnwindSafe,
 ADJ: UnwindSafe,
 T1: UnwindSafe,
 T2: UnwindSafe,

Blanket Implementations

source

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

source

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

source

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

const: unstable · source

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

source

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

const: unstable · source

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

Mutably borrows from an owned value. Read more

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

fn cast(self) -> T

Cast from Self to T

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

Try converting from Self to T

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

fn cast_trunc(self) -> T

Cast to integer, truncating Read more

fn cast_nearest(self) -> T

Cast to the nearest integer Read more

fn cast_floor(self) -> T

Cast the floor to an integer Read more

fn cast_ceil(self) -> T

Cast the ceiling to an integer Read more

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

Try converting to integer with truncation Read more

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

Try converting to the nearest integer Read more

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

Try converting the floor to an integer Read more

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

Try convert the ceiling to an integer Read more

impl<T> Conv<T> for T

fn conv(v: T) -> T

Convert from T to Self

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

Try converting from T to Self

source

impl<T> From<T> for T

const: unstable · source

fn from(t: T) -> T

Returns the argument unchanged.

source

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

const: unstable · source

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

impl<T> Pointable for T

const ALIGN: usize = mem::align_of::<T>()

The alignment of pointer.

type Init = T

The type for initializers.

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

Initializes a with the given initializer. Read more

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

Dereferences the given pointer. Read more

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

Mutably dereferences the given pointer. Read more

unsafe fn drop(ptr: usize)

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

source

impl<T> ToOwned for Twhere
T: Clone,

type Owned = T

The resulting type after obtaining ownership.

source

fn to_owned(&self) -> T

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

source

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

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

source

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

type Error = Infallible

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

source

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

type Error = >::Error

The type returned in the event of a conversion error.

const: unstable · source

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

Performs the conversion.

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

fn vzip(self) -> V

source

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

source

Struct net_ensembles::dual_graph::DualGraph

Implementations

impl<ADJ, T1, A1, T2, A2> DualGraph<ADJ, T1, A1, T2, A2>where ADJ: AdjTrait,

pub fn new(graph_1: GenericGraph<T1, A1>, graph_2: GenericGraph<T2, A2>) -> Self

pub fn graph_1(&self) -> &GenericGraph<T1, A1>

pub fn graph_2(&self) -> &GenericGraph<T2, A2>

pub fn graph_1_mut(&mut self) -> &mut GenericGraph<T1, A1>

pub fn graph_2_mut(&mut self) -> &mut GenericGraph<T2, A2>

pub fn adj_1(&self) -> &[ADJ]ⓘNotable traits for &[u8]impl Read for &[u8]impl Write for &mut [u8]

pub fn adj_2(&self) -> &[ADJ]ⓘNotable traits for &[u8]impl Read for &[u8]impl Write for &mut [u8]

pub fn size(&self) -> (usize, usize)

pub fn add_edge( &mut self, index_graph_1: usize, index_graph_2: usize) -> Result<(), AddEdgeError>

pub fn total_vertices(&self) -> usize

impl<ADJ, T1, A1, T2, A2> DualGraph<ADJ, T1, A1, T2, A2>where A1: AdjContainer<T1>, ADJ: AdjTrait,

pub fn degree_1(&self, index: usize) -> usize

impl<ADJ, T1, A1, T2, A2> DualGraph<ADJ, T1, A1, T2, A2>where A2: AdjContainer<T2>, ADJ: AdjTrait,

pub fn degree_2(&self, index: usize) -> usize

impl<T1, T2, A1, A2, ADJ> DualGraph<ADJ, T1, A1, T2, A2>where A1: AdjContainer<T1>, A2: AdjContainer<T2>, ADJ: AdjTrait,

pub fn dfs_index(&self, index: DualIndex) -> impl '_ + Iterator<Item = DualIndex>

pub fn dfs_1_index(&self, index: usize) -> impl '_ + Iterator<Item = DualIndex>

pub fn dfs_2_index(&self, index: usize) -> impl '_ + Iterator<Item = DualIndex>

pub fn bfs_index( &self, index: DualIndex) -> impl '_ + Iterator<Item = (DualIndex, usize)>

pub fn is_connected(&self) -> bool

pub fn diameter(&self) -> Option<usize>

impl<T, A1, A2> DualGraph<AdjSingle, T1, A1, T2, A2>where A1: AdjContainer<T> + AdjList<usize>, A2: AdjContainer<T> + AdjList<usize>,

pub fn graph_1_contained_iter_neighbors_in_other_graph_mut( &mut self, index: usize) -> impl Iterator<Item = &mut T>

pub fn graph_2_contained_iter_neighbors_in_other_graph_mut( &mut self, index: usize) -> impl Iterator<Item = &mut T>

pub fn graph_1_contained_iter_mut( &mut self, index: usize) -> impl Iterator<Item = &mut T>

pub fn graph_1_contained_iter(&self, index: usize) -> impl Iterator<Item = &T>

pub fn graph_2_contained_iter(&self, index: usize) -> impl Iterator<Item = &T>

pub fn graph_1_contained_iter_mut_which_graph_with_index( &mut self, index: usize) -> impl Iterator<Item = WhichGraph<(usize, &mut T)>>

pub fn graph_1_contained_iter_mut_which_graph( &mut self, index: usize) -> impl Iterator<Item = WhichGraph<&mut T>>

pub fn graph_2_contained_iter_mut_which_graph( &mut self, index: usize) -> impl Iterator<Item = WhichGraph<&mut T>>

pub fn graph_2_contained_iter_mut_which_graph_with_index( &mut self, index: usize) -> impl Iterator<Item = WhichGraph<(usize, &mut T)>>

impl<T, A1, A2, ADJ> DualGraph<ADJ, T, A1, T, A2>where A1: AdjContainer<T>, A2: AdjContainer<T>, ADJ: AdjTrait,

pub fn contained_iter_neighbors_1( &self, index: usize) -> impl Iterator<Item = &T>

pub fn contained_iter_neighbors_2( &self, index: usize) -> impl Iterator<Item = &T>

Trait Implementations

impl<ADJ: Clone, T1: Clone, A1: Clone, T2: Clone, A2: Clone> Clone for DualGraph<ADJ, T1, A1, T2, A2>

fn clone(&self) -> DualGraph<ADJ, T1, A1, T2, A2>

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

impl<'de, ADJ, T1, A1, T2, A2> Deserialize<'de> for DualGraph<ADJ, T1, A1, T2, A2>where ADJ: Deserialize<'de>, T1: Deserialize<'de>, A1: Deserialize<'de>, T2: Deserialize<'de>, A2: Deserialize<'de>,

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

impl<ADJ, T1, A1, T2, A2> Serialize for DualGraph<ADJ, T1, A1, T2, A2>where ADJ: Serialize, T1: Serialize, A1: Serialize, T2: Serialize, A2: Serialize,

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

Auto Trait Implementations

impl<ADJ, T1, A1, T2, A2> RefUnwindSafe for DualGraph<ADJ, T1, A1, T2, A2>where A1: RefUnwindSafe, A2: RefUnwindSafe, ADJ: RefUnwindSafe, T1: RefUnwindSafe, T2: RefUnwindSafe,

impl<ADJ, T1, A1, T2, A2> Send for DualGraph<ADJ, T1, A1, T2, A2>where A1: Send, A2: Send, ADJ: Send, T1: Send, T2: Send,

impl<ADJ, T1, A1, T2, A2> Sync for DualGraph<ADJ, T1, A1, T2, A2>where A1: Sync, A2: Sync, ADJ: Sync, T1: Sync, T2: Sync,

impl<ADJ, T1, A1, T2, A2> Unpin for DualGraph<ADJ, T1, A1, T2, A2>where A1: Unpin, A2: Unpin, ADJ: Unpin, T1: Unpin, T2: Unpin,

impl<ADJ, T1, A1, T2, A2> UnwindSafe for DualGraph<ADJ, T1, A1, T2, A2>where A1: UnwindSafe, A2: UnwindSafe, ADJ: UnwindSafe, T1: UnwindSafe, T2: UnwindSafe,

Blanket Implementations

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

fn type_id(&self) -> TypeId

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

fn borrow(&self) -> &T

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

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

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

fn cast(self) -> T

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

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

fn cast_trunc(self) -> T

fn cast_nearest(self) -> T

fn cast_floor(self) -> T

fn cast_ceil(self) -> T

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

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

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

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

impl<T> Conv<T> for T

fn conv(v: T) -> T

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

impl<T> From<T> for T

fn from(t: T) -> T

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

fn into(self) -> U

impl<T> Pointable for T

const ALIGN: usize = mem::align_of::<T>()

type Init = T

impl<ADJ, T1, A1, T2, A2> DualGraph<ADJ, T1, A1, T2, A2>where
ADJ: AdjTrait,

pub fn adj_1(&self) -> &[ADJ]ⓘNotable traits for &[u8]`impl Read for &[u8]impl Write for &mut [u8]`

pub fn adj_2(&self) -> &[ADJ]ⓘNotable traits for &[u8]`impl Read for &[u8]impl Write for &mut [u8]`

pub fn add_edge(
&mut self,
index_graph_1: usize,
index_graph_2: usize
) -> Result<(), AddEdgeError>

impl<ADJ, T1, A1, T2, A2> DualGraph<ADJ, T1, A1, T2, A2>where
A1: AdjContainer<T1>,
ADJ: AdjTrait,

impl<ADJ, T1, A1, T2, A2> DualGraph<ADJ, T1, A1, T2, A2>where
A2: AdjContainer<T2>,
ADJ: AdjTrait,

impl<T1, T2, A1, A2, ADJ> DualGraph<ADJ, T1, A1, T2, A2>where
A1: AdjContainer<T1>,
A2: AdjContainer<T2>,
ADJ: AdjTrait,

pub fn bfs_index(
&self,
index: DualIndex
) -> impl '_ + Iterator<Item = (DualIndex, usize)>

impl<T, A1, A2> DualGraph<AdjSingle, T1, A1, T2, A2>where
A1: AdjContainer<T> + AdjList<usize>,
A2: AdjContainer<T> + AdjList<usize>,

pub fn graph_1_contained_iter_neighbors_in_other_graph_mut(
&mut self,
index: usize
) -> impl Iterator<Item = &mut T>

pub fn graph_2_contained_iter_neighbors_in_other_graph_mut(
&mut self,
index: usize
) -> impl Iterator<Item = &mut T>

pub fn graph_1_contained_iter_mut(
&mut self,
index: usize
) -> impl Iterator<Item = &mut T>

pub fn graph_1_contained_iter_mut_which_graph_with_index(
&mut self,
index: usize
) -> impl Iterator<Item = WhichGraph<(usize, &mut T)>>

pub fn graph_1_contained_iter_mut_which_graph(
&mut self,
index: usize
) -> impl Iterator<Item = WhichGraph<&mut T>>

pub fn graph_2_contained_iter_mut_which_graph(
&mut self,
index: usize
) -> impl Iterator<Item = WhichGraph<&mut T>>

pub fn graph_2_contained_iter_mut_which_graph_with_index(
&mut self,
index: usize
) -> impl Iterator<Item = WhichGraph<(usize, &mut T)>>

impl<T, A1, A2, ADJ> DualGraph<ADJ, T, A1, T, A2>where
A1: AdjContainer<T>,
A2: AdjContainer<T>,
ADJ: AdjTrait,

pub fn contained_iter_neighbors_1(
&self,
index: usize
) -> impl Iterator<Item = &T>

pub fn contained_iter_neighbors_2(
&self,
index: usize
) -> impl Iterator<Item = &T>

impl<'de, ADJ, T1, A1, T2, A2> Deserialize<'de> for DualGraph<ADJ, T1, A1, T2, A2>where
ADJ: Deserialize<'de>,
T1: Deserialize<'de>,
A1: Deserialize<'de>,
T2: Deserialize<'de>,
A2: Deserialize<'de>,

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

impl<ADJ, T1, A1, T2, A2> Serialize for DualGraph<ADJ, T1, A1, T2, A2>where
ADJ: Serialize,
T1: Serialize,
A1: Serialize,
T2: Serialize,
A2: Serialize,

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

impl<ADJ, T1, A1, T2, A2> RefUnwindSafe for DualGraph<ADJ, T1, A1, T2, A2>where
A1: RefUnwindSafe,
A2: RefUnwindSafe,
ADJ: RefUnwindSafe,
T1: RefUnwindSafe,
T2: RefUnwindSafe,

impl<ADJ, T1, A1, T2, A2> Send for DualGraph<ADJ, T1, A1, T2, A2>where
A1: Send,
A2: Send,
ADJ: Send,
T1: Send,
T2: Send,

impl<ADJ, T1, A1, T2, A2> Sync for DualGraph<ADJ, T1, A1, T2, A2>where
A1: Sync,
A2: Sync,
ADJ: Sync,
T1: Sync,
T2: Sync,

impl<ADJ, T1, A1, T2, A2> Unpin for DualGraph<ADJ, T1, A1, T2, A2>where
A1: Unpin,
A2: Unpin,
ADJ: Unpin,
T1: Unpin,
T2: Unpin,

impl<ADJ, T1, A1, T2, A2> UnwindSafe for DualGraph<ADJ, T1, A1, T2, A2>where
A1: UnwindSafe,
A2: UnwindSafe,
ADJ: UnwindSafe,
T1: UnwindSafe,
T2: UnwindSafe,

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

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

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

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

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

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

impl<T> ToOwned for Twhere
T: Clone,

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

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

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

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

impl<T> SerdeStateConform for Twhere
T: Serialize,