icentral-predecessor-map vs icentral-visit-markers vs icentral-node-queue

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.

A Rust crate for managing and tracking node visitations in graph traversal algorithms, supporting both indexed and mapped storage structures.

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