Advent of Code 2022 in pure TensorFlow - Day 12

from blog P. Galeone's blog, | ↗ original
Solving problem 12 of the AoC 2022 in pure TensorFlow is a great exercise in graph theory and more specifically in using the Breadth-First Search (BFS) algorithm. This problem requires working with a grid of characters representing a graph, and the BFS algorithm allows us to traverse the graph in the most efficient way to solve the problem. Day...