Expand description
Generic Graph implementation.
Modules§
Structs§
- NEIGHBORS field.
- A wrapper for f32 to make it ordered, so that we can put it into a BTree or Heap
- Array-based visited list (faster than HashSet)
Traits§
- Distance calculator.
- Graph trait.
Functions§
- Beam search over a graph
- Greedy search over a graph