Graph redistribution and vertex renumbering?

I am new to PARMETIS and have just read its manual. I know it uses distributed CSR format to store a graph and after partition it returns the part[] array to show which vertex goes to which processor.

My question is: If we redistribute the graph according to part[], and still want the graph to be in CSR format, then we have to do vertex renumbering (to have each processor contain consecutive vertexes) and rewrite adjncy[]. Does PARMETIS provide routines for graph redistribution and vertex renumbering?