| Graphs |
|
|
|
|
|
|
|
|
|
|
| • | Paths
may pass through the same vertex |
||||||||
| more
than once but simple paths may not. |
|||||||||
| • | A
cycle is a path that starts and ends at the |
||||||||
| same
vertex but does not pass through |
|||||||||
| other
vertices more than once. |
|||||||||
| • | Graphs
are considered to be connected if |
||||||||
| there
is a path between every pair of |
|||||||||
| vertices. |
|||||||||