Traversability What is Traversability A network is said

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 – i. e. a route through the network using each edge once. There are 3 types of traversable networks. 1. Fully 2. Semi 3. Not - no odd nodes - 2 odd nodes - more than 2 odd nodes For a network to be traversable it must be connected!!

Kinds of Traversable Networks? 1. FULLY Traversable A network that has no odd nodes means that you can start and finish at the same point. Is also known as an Euler Circuit. Example

Kinds of Traversable Networks? 2. SEMI - Traversable A network that has 2 odd nodes meaning that you start from one odd node and finish at the other. Also known as an Euler Path. Example

Kinds of Traversable Networks? 1. NOT Traversable A network that has more than 2 odd nodes. It is not traversable at all. Example

Try the pencil test on the following small networks

Example Solution

Example (cont. )

Example (cont. )

Example (cont. )

Example (cont. )

More examples

Bridges of Konigsburg Can you walk over all seven bridges without repeating a bridge twice? i. e. is the network traversable?

Activity

Activity

Activity

Activity

Activity

Activity

Activity

Activity

Activity

Activity

Activity

Activity