Hi :) I was wondering if there is a term for a strongly connected component in a directed graph where every edge in the component is bidirectional. E.g. Graph1 would qualify, but graph2 would not, despite the fact Graph2 is strongly connected.
Graph1: edge(1, 2), edge(2, 1), edge(2, 3), edge(3, 2),
Graph2: edge(1, 2), edge(2, 3), edge(3, 1),
Thanks!