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
Setting weight of edge (A,B) to 1 ... ok.
Setting weight of edge (B,A) to 2 ... ok.
Setting weight of edge (B,C) to 3 ... ok.
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 edge iterator (const) to begin ... ok.
Is edge iterator (const) at end? N
Edge iterator (const) points to edge: A:B weight: 1
Move edge iterator (const) to next (post increment) ... ok.
Is edge iterator (const) at end? Y
Move vertex iterator (const) to next (post increment) ... ok.
Is vertex iterator (const) at end? N
Vertex iterator (const) points to vertex: 1:B visited: N
Move edge iterator (const) to begin ... ok.
Is edge iterator (const) at end? N
Edge iterator (const) points to edge: B:A weight: 2
Move edge iterator (const) to next (pre increment) ... ok.
Is edge iterator (const) at end? N
Edge iterator (const) points to edge: B:C weight: 3
Move edge iterator (const) to next (post increment) ... ok.
Is edge iterator (const) at end? Y
Move vertex iterator (const) to next (post increment) ... ok.
Is vertex iterator (const) at end? N
Vertex iterator (const) points to vertex: 2:C visited: N
Move edge iterator (const) to begin ... ok.
Is edge iterator (const) at end? Y