Dry run example for DInic's algorithm

Can we have a dry run/example of dinic's algorithm(similar to edmonds-karp) to enhance deepen the understanding of the algorithm. I'm new here but would love to take this up.

https://cp-algorithms.com/graph/edmonds_karp.html https://cp-algorithms.com/graph/dinic.html