We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent f3dc3a3 commit 0e43954Copy full SHA for 0e43954
1 file changed
README.md
@@ -5,6 +5,6 @@
5
This repository contains an implementation of an algorithm by Tarjan that efficiently computes path expressions based on a labeled graph.
6
A path expression is a regular expression describing all path between two nodes in the labeled graph.
7
8
-The implementation is according to what is described in the paper:
+The implementation is according to the paper:
9
10
[Fast Algorithms for Solving Path Problems](https://dl.acm.org/citation.cfm?id=322273)
0 commit comments