Skip to main content
. 2018 Mar 22;1:20. doi: 10.1038/s42003-018-0023-9

Fig. 4.

Fig. 4

Edmonds–Karp style algorithm for fast enumeration of the haplotypes. An Edmonds–Karp style algorithm for fast enumeration of the haplotypes was used to reduce the computational requirements of the graph traversal down to polynomial time. Pseudo code for the algorithm is shown here. The algorithm finds a polynomial size set of paths (plausible haplotypes) from source to sink that cover every edge in the graph (edge and nodes can be visited more than once)