daggy
daggy copied to clipboard
A directed acyclic graph data structure for Rust.
As a compromise between the status quo and https://github.com/mitchmindtree/daggy/issues/12, what about adding a transactional add/remove of nodes and edges? For example, some code like this: ```rust for node_ind in nodes_to_remove.iter()...
Would be great if there was a direct link to the docs from the crate page.
This might be useful for performance critical occasions where the user knows for certain that adding an edge would not create a cycle.