pub struct WeightedNodeColors;Expand description
Use WeightedNodeColors to use the distance of both nodes node_color_weight as
a measure of the similarity between these nodes.
Trait Implementations§
Source§impl Debug for WeightedNodeColors
impl Debug for WeightedNodeColors
Source§impl<T: NodeColorWeight> NodeColorMatching<T> for WeightedNodeColors
impl<T: NodeColorWeight> NodeColorMatching<T> for WeightedNodeColors
Source§fn node_color_matching(
&self,
node_i_value: &T,
node_j_value: &T,
) -> Closed01<f32>
fn node_color_matching( &self, node_i_value: &T, node_j_value: &T, ) -> Closed01<f32>
Determines how close or distant two nodes with node weights
node_value_i of graph A and
node_value_j of graph B are. If they have different colors, this method could return 0.0
to describe that they are completely different nodes and as such the neighbor matching will
try to choose a different node. Read moreAuto Trait Implementations§
impl Freeze for WeightedNodeColors
impl RefUnwindSafe for WeightedNodeColors
impl Send for WeightedNodeColors
impl Sync for WeightedNodeColors
impl Unpin for WeightedNodeColors
impl UnwindSafe for WeightedNodeColors
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more