Weighted directed generic graph. It is implemented in a simple way without (explicit) heap allocations and uses modern features like:
std::optional- Concepts
- Structured binding
Heap which can be heapified at any moment by calling heapify(). It is a max-heap by default.
Add an infinity value to any type!