Skip to content

Commit 0e43954

Browse files
authored
Update README.md
1 parent f3dc3a3 commit 0e43954

1 file changed

Lines changed: 1 addition & 1 deletion

File tree

README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -5,6 +5,6 @@
55
This repository contains an implementation of an algorithm by Tarjan that efficiently computes path expressions based on a labeled graph.
66
A path expression is a regular expression describing all path between two nodes in the labeled graph.
77

8-
The implementation is according to what is described in the paper:
8+
The implementation is according to the paper:
99

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

0 commit comments

Comments
 (0)