Simple Paths
A simple path is
- a sequence of vertices/edges from v to w
- where no vertex/edge appears twice
If v = w, then the path is a cycle.
Questions on paths:
- is there a path between two given vertices (src,dest)?
- what is the sequence of vertices from src to dest?
|
![[prev]](icon/prev.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}