Traversibility
A network is traversable if you can go along every edge without repeating any of them.
You can tell it is traversable if:
A network is traversable if you can go along every edge without repeating any of them.
You can tell it is traversable if:
- All nodes are even (ie. it is an Euler circuit) - in this case you start and end at the same point.
- or, there are exactly two odd nodes (so it is an Euler path) - in this case you start at one odd node and end at the other.