Bidirectional Search GMX demo

This demo tests your understanding of the GMX (must-expand) graph for bidirectional search. Edge costs are the straight-line distance between nodes. The h-cost is the straight-line distance times 0.8.


  1. Drag to select a path on the left
  2. Draw lines from left to right to build GMX
  3. Check the GMX for correctness
  4. When GMX is correct, show the minimum vertex cover

Related Videos

Selected Related Publications