240 likes | 629 Views
Traversability. What is Traversability ?. A network is said to be traversable if each edge can be traced, once only, without lifting a pen from the paper. For networks that you can start and finish at the same point, we call Euler Circuits (there are no odd nodes in the network).
E N D
What is Traversability? A network is said to be traversable if each edge can be traced, once only, without lifting a pen from the paper. For networks that you can start and finish at the same point, we call Euler Circuits (there are no odd nodes in the network). For networks that you can start and finish at different points, we call Euler Paths (there are 2 odd nodes in the network, one is the start, and the other the finish). These are also known as semi-traversable networks. For networks that are not traversable there are more than 2 odd nodes in the network.
What is Traversability Try the pencil test on the following small networks Semi-Traversable Traversable Not-Traversable
Example Solution
Bridges of Konigsburg Can you walk over all seven bridges without repeating a bridge twice? i.e. is the network traversable?