I am reading the network simplex algorithm of Bertsimas' Introduction to Linear Optimization. The graph below shows a degenerate basic feasible solution because the flow from node $6$ to node $7$ is $0$. I am wondering if there is anyway to find a non-degenerate Basic Feasible Solution (BFS). In addition, is there anyway to find all non-degenerate BFS's?
