icentral-node-queue vs parallel_frontier vs icentral-predecessor-map

Efficient and dependable queue management for node identifiers, ideal for graph operations such as BFS.

Queue-like frontier for breath-first visits on graphs that supports constant-time concurrent pushes and parallel iteration

Optimized Rust crate for implementing and managing a predecessor map, a staple in graph theory and algorithms, allowing efficient traversal and manipulation of node relationships within a graph.