use directed_bijective_connection_graph::{ Dims, DirectedBijectiveConnectionGraphFunctions, Lemma1, Lemma2, Node, NodeToNode, NodeToSet, }; fn main() { example_lemma1(); println!("#####################"); example_lemma2(); println!("#####################"); example_node_to_set(); println!("#####################"); example_node_to_node(); } fn example_lemma1() { println!("this is an example of lemma1 on a CustomFunctionGraph."); let n = 8; let s = 0b0000_0001; let graph = CustomFunctionGraph::new(n); let path = graph.lemma1(n, s); println!("{:#?}", path); } fn example_lemma2() { println!("this is an example of lemma2 on a CustomFunctionGraph"); let n = 8; let s = 0b0011_0011; let d = 0b1010_1010; let graph = CustomFunctionGraph::new(n); let path = graph.lemma2(s, d); println!("{:?}", path); } fn example_node_to_set() { println!("This is an example of node to set on a CustomFunctionGraph"); let n = 8; let s = 0b0101_0101; let mut d = vec![]; for i in 0..8 { d.push(1 << i); } let graph = CustomFunctionGraph::new(n); let paths = graph.node_to_set(s, &d); println!("{:#?}", paths); } fn example_node_to_node() { println!("This is an example of node to node on a CustomFunctionGraph"); let n = 8; let s = 0b0101_0101; let d = 0b0000_1111; let graph = CustomFunctionGraph::new(n); let paths = graph.node_to_node(s, d); println!("{:#?}", paths); } struct CustomFunctionGraph(Dims); impl CustomFunctionGraph { pub fn new(n: Dims) -> Self { Self(n) } } impl DirectedBijectiveConnectionGraphFunctions for CustomFunctionGraph { fn phi(&self, n: Dims, node: Node) -> Node { let mask = 1 << (n - 1); if node & mask == 0 { (1 << (n - 1)) ^ (node) } else { (u64::max_value() << (n)) ^ (u64::max_value()) ^ (node) } } fn psi(&self, n: Dims, node: Node) -> Node { let mask = 1 << (n - 1); if node & mask != 0 { (1 << (n - 1)) ^ (node) } else { (u64::max_value() << (n)) ^ (u64::max_value()) ^ (node) } } #[inline(always)] fn dimension(&self) -> u64 { self.0 } }