- An Euler circuit in a graph G is a simple circuit containing every edge of G.
- Strongly connected means if there's a path from a to b whenever a and b are vertices in graph G, then there exists path from b to a as well.
When I think about it, I reason that if there's an Euler circuit, it would mean there's a path from a vertex to any other vertex. Almost like a cycle. So that would make the graph strongly connected.
I just want to make sure if my thinking is wrong in anyway? Because I was unable to find this written anywhere specifically.