icentral-neighbors 0.1.0

A comprehensive crate for node and edge operations within graph structures, offering efficient manipulation and management capabilities.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59

crate::ix!();

#[macro_export] macro_rules! delegate_to_neighbors_map {

    () => {
        delegate!{

            to self.nodes_map {

                pub fn nodeid_range(&self) 
                    -> Vec<NodeId>;

                pub fn limited_nodeid_range(&self, cap: Option<usize>) 
                    -> Vec<NodeId>;

                pub fn mapped_nodes(&self) -> Vec<NodeId>;

                pub fn set_neighbors(
                    &mut self, 
                    node: NodeId, 
                    nbrs: Vec<NodeId>);

                pub fn add_neighbor(
                    &mut self, 
                    node: NodeId, 
                    nbr:  NodeId);

                pub fn has_map_for_node(&self, node: NodeId) -> bool;

                pub fn remove_node_and_neighbors(&mut self, node: NodeId);

                pub fn neighbors(&self, node: NodeId) -> Neighbors;

                #[call(extend_with)]
                pub fn extend_mapped_nodes(&mut self, other: &NeighborsMap);

                #[call(unlink_all)]
                pub fn nodes_map_unlink_all(&mut self, src: NodeId, dst: NodeId);

                #[call(add_edge)]
                pub fn nodes_map_add_edge(&mut self, e: &Edge);

                #[call(unlink_edge)]
                pub fn nodes_map_unlink_edge(&mut self, e: &Edge);

                #[call(reinit)]
                pub fn nodes_map_reinit(&mut self, len: usize);

                #[call(clear)]
                pub fn nodes_map_clear(&mut self);

                #[call(add_isolated_node)]
                pub fn nodes_map_add_isolated_node(
                    &mut self, 
                    node: NodeId);
            }
        }
    }
}