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