int GraphEmpty () const i return VerticesList IsEmpty (; int GraphFull( const i return VerticesList. IsFullo Currentedges--MaxEdges; j int Numberof Vertices() f return VerticesList last +1; int NumberofEdges( f return CurrentEdges; j Type Get Value( int 1) freturn i>=0 &&i<- verticesList last 2 VerticesList datai]: NULLint GraphEmpty ( ) const { return VerticesList.IsEmpty ( ); } int GraphFull( ) const { return VerticesList.IsFull( ) || CurrentEdges == MaxEdges; } int NumberOfVertices ( ) { return VerticesList.last +1; } int NumberOfEdges ( ) { return CurrentEdges; } Type GetValue ( int i ) { return i >= 0 && i <= VerticesList.last ? VerticesList.data[i] : NULL; }