Inspired by the Seven Bridges of Königsberg problem, I used several javascript libraries to create a random graph. A graph in this context is a network of nodes connected by edges. A graph is said to have an Eulerian path if each edge is traversed once and only once. The degree of a node is the number of edges touching it. They can be either EVEN or ODD.
Is this graph traversable?