Traditional implementations of parallel graph operations on distributed memory platforms are written using Message Passing Interface (MPI) point-to-point communication primitives such as Send-Recv (blocking and nonblocking). Apart from this classical model in MPI, there has been tremendous progress in other Partitioned Global Address Space (PGAS) models over the years. However, their suitability for handling the irregular traffic workloads typical of graph operations remain comparatively less explored. We have implemented Half-Approximate Graph Matching using UPCXX, which is a PGAS model derived from UPC programming model, that uses modern C++. In addition to a one-sided communication of data, UPCXX also allows Remote Procedure Calls (RPC), which makes it possible to communicate the function that would be operated on the data at the remote side. Usage of RPCs significantly improves the programmability, owing to lesser lines of code and an enhanced composability.