Skip to content

svenfeld/PathExpression

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

85 Commits
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

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

About

An implementation of Tarjan's PathExpression algorithm

Resources

License

Stars

Watchers

Forks

Packages

No packages published

Languages

  • Java 100.0%