Module Multisource BFS / Dijkstra

Multisource BFS / Dijkstra

**Frequency: 3/10** Multisource BFS is an algorithm that simultaneously starts BFS from multiple vertices, exploring a graph efficiently from multiple origins to determine shortest paths. Similar for multisource Dijkstra. "Simultaneously" here is nothing but pushing every starting vertices to the queue.

Resources

hehe

Problems

Rough ocean 60 / 72 1000
Restaurant 38 / 49 1300
Escape from... dolls 2 34 / 37 1400
Power plant 37 / 45 1500
Iceberg 37 / 41 1500