report VI VI EN
Register | Login
  • HOME
  • PROBLEMSET
  • ROADMAP
  • COMPETITION
  • TOPIC
  • RANKING
  • GUIDE
  • MASHUP
  • ABOUT
  • CONTACT
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 249 / 308 1000
Restaurant 191 / 215 1300
Escape from... dolls 2 165 / 174 1400
Power plant 183 / 196 1500
Iceberg 158 / 181 1500

Graph

  • Shortest path
  • 0-1 BFS / Dial's algorithm
  • Multisource BFS / Dijkstra
  • DAG / Topological sort

Data structure

  • Introduction to Segment Tree and Binary Indexed Tree
  • Sparse table
  • Monotonic queue

Tree

  • Lowest common ancestor (LCA)
  • Euler tour

Dynamic Programming

  • Bitmask DP
  • Exchange labels DP
  • Game DP

Math

  • Introduction to combinatorics
  • Inclusion-exclusion principle