Skip to content

Commit be26b9e

Browse files
authored
Create README.md
1 parent 3b38370 commit be26b9e

File tree

1 file changed

+8
-0
lines changed

1 file changed

+8
-0
lines changed

README.md

Lines changed: 8 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,8 @@
1+
# Path Expression
2+
3+
This repository contains an implementation of an algorithm by Tarjan that efficiently computes path expressions based on a labeled graph.
4+
A path expression is a regular expression describing all path between two nodes in the labeled graph.
5+
6+
The implementation is according to what is described in the paper:
7+
8+
[Fast Algorithms for Solving Path Problems](https://dl.acm.org/citation.cfm?id=322273)

0 commit comments

Comments
 (0)