[igraph] Question on max id node

[Richard Geddes]

Hello,

I'm importing graph edgelists which do not necessarily have contiguously
numbered nodes.  I am interested in being able to observe the value of
the node with the largest id in the imported graph.

Is there a function that provides the value of the largest node id in
the imported graph?

Thanks
Richard