[Matrix][#3286] Why visited isn't enough: A Lesson in 0-1 BFS

While solving LeetCode 3286 (Find a Safe Walk Through a Grid), I hit a wall that every developer eventually faces: Standard BFS isn't always the "shortest" path when edges have different costs. Here’s