Definition:Semi-Eulerian Graph

A graph is called semi-Eulerian if it contains an Eulerian path.

Such a graph is also called traversable.

Note that the definition of graph here includes:
 * Simple graph;
 * Loop-graph;
 * Multigraph;
 * Loop-multigraph.

Note that an Eulerian graph is also semi-Eulerian, as an Eulerian circuit is still a path, and therefore an Eulerian path.