Trait GraphImpl 

pub trait GraphImpl {
    // Required method
    fn cleanup_precise(&mut self);

    // Provided method
    fn cleanup(&mut self) { ... }
}

Required Methods

fn cleanup_precise(&mut self)

Traverses the graph and drops any inaccessible node. Disregards any heuristic designed to improve cleanup performance.

Provided Methods

fn cleanup(&mut self)

Traverses the graph and drops inaccessible nodes. This method will miss some of the leaked items which might result in spikes in memory usage. !! Currently, none of the possible heuristics are implemented.

Implementors

impl<Root, NodeType> GraphImpl for GenericGraph<Root, NodeType>

where Root: RootCollection<'static, NodeType>, NodeType: GraphNode,