BFS calls BFSSearch and uses its output to call BFSShortestPathReconstruct.

BFSHashMapGraphV1 wraps BFS to make it easier for users to call BFS with HashMapGraphV1.

BFSSearchGeneric traverses the graph in BFS manner, and collecting VFS traversal information in a map `prev`.

BFSShortestPathReconstruct returns inclusive path from src to dst, with number of hops.

NewGraph[T] returns the default implementation of unweighted graph (*HashMapGraphImpl[T]) wrapped inside a of SafeGraph[N any, E any, R any, W any].

NewHashMapGraphUnsafe[T] returns the default implementation of unweighted graph (*HashMapGraphImpl[T]) without the mutex field.

WrapSafeGenericGraph[N, E, R, W] wraps BasicGraph[N, E, R, W] with *SafeGraph[N, E, R, W] to use mutex to avoid data races.

HashMapGraphImpl is a basic implementation of Graph, not safe for concurrent code.

SafeGraph[N, E, R, W] wraps any BasicGraph[N, E, R, W] graphs.

Graph represents what an gsl graph should look like.