# PathExpression

**Repository Path**: mirrors_secure-software-engineering/PathExpression

## Basic Information

- **Project Name**: PathExpression
- **Description**: An implementation of Tarjan's PathExpression algorithm
- **Primary Language**: Unknown
- **License**: EPL-2.0
- **Default Branch**: develop
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2024-08-21
- **Last Updated**: 2026-05-10

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## README


# Path Expression

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:

[Fast Algorithms for Solving Path Problems](https://dl.acm.org/citation.cfm?id=322273)