PRESENTATION OUTLINE
A network is Traversable if you can move around the network and travel on every edge exactly one time only and finish at the same or a different node than the one you started at.
If a network has nodes that are all of even degree then the network is Traversable and you can start and finish at the same node regardless of where you start.
If the network has only two nodes that are odd degrees then you can start at one and traverse the network and finish at the other.
If you have a network where all nodes are of an odd degree then the network is not Traversable.
You are sometimes asked to make the network Traversable by adding in an extra edge. This is called "Eulerising" the network.
An Euler path traverses a network and travel on every edge exactly once and finishes at a different node. This means that only two nodes must have odd degrees and all others must be even.
An Euler circuit travels on every edge in a network and returns to the same point where it started. This means we can start on any node in the network as long as all node have an even degree.
