How can we form a graph from this problem? So from the above diagram, we can move either right or down. So a binary tree is built that way. It's written "If we had intermingled common nodes across different branches, we would have got a graph instead" I am unable to visualize how a graph can be formed out of this. Will it be a graph with only 2 columns? Please help

Source: https://loveforprogramming.quora.com/Backtracking-Memoization-Dynamic-Programming
If you just want the visualization, then have a look at this