DDAs are useful for locating intersections of a line with the edges of cells within a cellular grid space. It’s used in graphics for rasterizing lines to pixels, and intersection detection in ray casting game engines like id’s Wolfenstein.
A* pathfinding algorithm finds the most efficient path between two nodes in a grid. The algorithm can incorporate unique movement-costs between nodes, as well as entirely impassible walls.