If there exists a directed graph with $n$ vertices and $n$ edges, where each vertex has exactly one outgoing edge, and there exists multiple cycles (>=2), is it possible to form a graph where all the cycles are connected in one component?
closed as off-topic by Henrik, Misha Lavrov, jvdhooft, Chris Custer, A. Goodier Apr 11 '18 at 8:14
This question appears to be off-topic. The users who voted to close gave this specific reason:
- "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – Henrik, Misha Lavrov, jvdhooft, Chris Custer, A. Goodier