1

Is there any situation or search problem in which it would be better to use regular breadth-first search instead of bidirectional search?

c0der
  • 18,467
  • 6
  • 33
  • 65
juliamartin27
  • 29
  • 4

1 Answers1

1

When your graph is oriented and your data structure only allow you to get efficiently the successors and not the predecessors.

One Lyner
  • 1,964
  • 1
  • 6
  • 8