Trait graph_neighbor_matching::NodeColorMatching

pub trait NodeColorMatching<T>: Debug {
    fn node_color_matching(
        &self, 
        node_value_i: &T, 
        node_value_j: &T
    ) -> Closed01<f32>;
}

Required methods

fn node_color_matching(
    &self,
    node_value_i: &T,
    node_value_j: &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. NOTE: The returned value MUST be in the range [0, 1].

Loading content...

Implementors

impl<T> NodeColorMatching<T> for IgnoreNodeColors

fn node_color_matching(
    &self,
    _node_i_value: &T,
    _node_j_value: &T
) -> Closed01<f32>

impl<T: NodeColorWeight> NodeColorMatching<T> for WeightedNodeColors

fn node_color_matching(
    &self,
    node_i_value: &T,
    node_j_value: &T
) -> Closed01<f32>

Loading content...