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.
- Drag to select a path on the left
- Draw lines from left to right to build GMX
- Check the GMX for correctness
- When GMX is correct, show the minimum vertex cover