Sequence of example graphs demonstrating the algorithm of branch point analysis. Node R1 has been selected as hub, node X is to be disconnected, and Y is to be removed. The configured maximum distance from the selected node is two. A) Initial bipartite graph. B) Disconnection (X) or removal (Y), respectively, of selected nodes. C) Bridging of transitory nodes (B, R2, C). D) Removal of all nodes with a distance greater than two from the hub, R1. E) Condensed metabolic context of reaction R1 produced by branch point analysis.