BFS algorithm for finding an Eulerian path

This is the implementation of the Breadth-First Search algorithm for
finding an Eulerian path - a train in a graph which visits every edge
exactly once. This algorithm is implemented with queue data structure.
Language: Python 3.x