The task was: Write a function generate_semieuler that returns some directed semi-Eulerian graph on n vertices with m edges that has no bidirectional edges, or None if such a graph does not exist. Justify the correctness of the algorithm.
You must use only networkX and built-in libraries.
Problem Statement:

The task was: Write a function generate_semieuler that returns some directed semi-Eulerian graph on n vertices with m edges that has no bidirectional edges, or None if such a graph does not exist. Justify the correctness of the algorithm.
You must use only networkX and built-in libraries.
Problem Statement: