This repository contains an implementation of an algorithm by Tarjan that efficiently computes path expressions based on a labeled graph. A path expression is a regular expression describing all path between two nodes in the labeled graph.
The implementation is according to the paper:
![@dependabot[bot]](https://avatars.githubusercontent.com/in/29110?s=64&v=4){kind=small}
![@github-actions[bot]](https://avatars.githubusercontent.com/in/15368?s=64&v=4){kind=small}
![@mend-bolt-for-github[bot]](https://avatars.githubusercontent.com/in/16809?s=64&v=4){kind=small}
