0-1 BFS / Dial's algorithm

**Frequency: 2/10** An algorithm to reduce Dijkstra's time complexity when edges' weight are small.

Resources

- [CP Algorithms: 0-1 BFS](https://cp-algorithms.com/graph/01_bfs.html)

Problems