Expand description
Smart pointer for graph nodes.
The author of this crate is not good at English. Forgive me if the document is hard to read.
This crate provides some smart pointers optimized for managing graph data structures.
These smart pointers behavior is similar to Rc
and Weak
.
However, These smart pointer comparison is based on location.
§Comparison of smart pointers
This crate smart pointer comparison is based on location.
This allows smart pointers to be used as HashSet
values, etc.
For example, comparison of Nr::eq
is based on identity of node address.
On the other hand comparison of Rc::eq
is based on inner value.
Modules§
- Crate’s prelude.
Structs§
- Strong reference to node.
- Weak reference to node.