Creating a directed graph with capacity = 3 ...  ok.
Adding new vertex with data: A ...  vertex's label: 0
Adding new vertex with data: B ...  vertex's label: 1
Adding new vertex with data: C ...  vertex's label: 2
Move vertex iterator (const) to begin ... ok.
Is vertex iterator (const) at end? N
Vertex iterator (const) points to vertex: 0:A visited: N
Move vertex iterator (const) to next (post increment) ... ok.
Vertex iterator (const) points to vertex: 1:B visited: N
Move vertex iterator (const) to next (pre increment) ... ok.
Vertex iterator (const) points to vertex: 2:C visited: N
Is vertex iterator (const) at end? N
Finding vertex (const) with data B ... finished.
Is vertex iterator (const) at end? N
Vertex iterator (const) points to vertex: 1:B visited: N
Finding vertex (const) with data D ... finished.
Is vertex iterator (const) at end? Y