기본 용어 (Terminology)

1. Walk

Sequence of vertices and edges of a graph.

Vertex can be repeated.

Edges can be repeated.

 

Open Walk : starting vertex != ending vertex

Closed Walk : starting vertex == ending vertex

 

2. Trail

Open walk in which no edge is repeated.

Vertex can be repeated.

Edges cannot be repeated.

 

3. Circuit

Closed walk in which no edge is repeated.

Closed trail.

Vertex can be repeated.

Edges cannot be repeated.

 

4. Path

Trail in which neither vertices nor edges are repeated.

Open walk.

Vertex cannot be repeated.

Edges cannot be repeated.

 

5. Cycle

Circuit which only the starting and ending vertices are repeated.

Vertex cannot be repeated.

Edges cannot be repeated.