We demonstrate a system for recursive query answering over labeled graphs. The system is based on a complete implementation of the recent μ-recursive relational algebra, that has been extended with parsers and compilers adapted for queries over property graphs. As a result, one can formulate, optimize and answer queries that navigate recursively along paths in property graphs. We demonstrate the system on three real datasets, including the exploration of chains of drug interactions.