I need something like Bresenham algorithm but not quite and for 3d grid-space.
I got 3d grid of cells (edge size 1.0) need to start in point S and advance to point
Consider using of Woo and Amanatides grid traversal algorithm: article "Fast Voxel Traversal Algorithm..."
Practical implementation is in grid traversal section here
2d-case illustration: