It is actually related to highlight that each time a sequence can't repeat nodes but can be a shut sequence, the only exception is the first and the final node, which have to be the same. A set of edges within a graph G is claimed being an edge cut set if its removal can make G, a disconnecte