A path is:
A sequence of edges joined by vertices where no vertex is repeated (excluding the possibility of the start and end vertex).
An edge that connects a vertex to itself.
A sequence of edges that start and end at the same vertex.
A sequence of edges joined by vertices where no edge is repeated.
Which of the following are valid paths?
Choose appropriate networks to find optimal solutions
Apply network methods in solving problems