We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
You've left out what is probably the most common and obvious way to do graphs in practice in Rust, use identity keys:
#[derive(Copy, Clone, Eq, PartialEq, Hash)] struct NodeID(u32); struct Node { datum: &'static str, edges: Vec<NodeID>, } struct Graph { nodes: HashMap<NodeID, Node>, // or Vec if you never delete Nodes }
Not a lot of overhead .. vastly less headaches.
The text was updated successfully, but these errors were encountered:
No branches or pull requests
You've left out what is probably the most common and obvious way to do graphs in practice in Rust, use identity keys:
Not a lot of overhead .. vastly less headaches.
The text was updated successfully, but these errors were encountered: