# Self loops in max flow problem

So, there can be different types of edges in a directed graph while solving the max flow problem. There can be reverse edges, multiple edges and self loops.

What is the significance of self loops in it?

How is it related to flow in the graph?

Let there be a graph like this 1->2->3 and 2 has a self loop. So, can I interpret it like this-

1->2a--2b->3 ? where -- denotes an edge from 2a->2b and an edge from 2b->2a.

So, How would I represent this in a graph using adjacency list?

• I don't follow what your actual question is. I recommend you execute a max-flow algorithm on your examples and see what happens. Or mathematically, if you are so inclined, figure out how the flow along a self-loop influences the aggregate flow value. – Raphael Apr 3 '18 at 18:04