Crate hibitgraph
See all hibitgraph's items
A BitGraph is an undirected graph data structure Its capacity is limited to mem::size_of::<usize>.pow(4)
BitGraph
mem::size_of::<usize>.pow(4)
Iterator that performs a depths first search on a BitGraph If the graph is fully-connected, all vertices are explored (spanning tree)