Add BFS-based Regular Path Query Algorithm

Open
#5 0 comments 0 reactions 1 assignee View on GitHub

@VanyaGlazunov is already working on this.

Since Mar 13, 2026.

Assessment

This issue has not been assessed yet.

Description

The BFS-based Regular Path Query Algorithm is one of baseline algorithms we want to compare with. Currently, it is a part of LAGraph. It should be supported as one way to evaluate regular path queries.

That is, the possible pipeline is:

  • User types a query, e.g. a SPARQL query ?x <label> <node>.
  • Pathrex parses it.
  • Pathrex builds an AST.
  • Pathrex builds NFA and gets its adjacency matrix decomposition by label somehow from the AST.
  • Pathrex runs LAGraph_RegularPathQuery() on the loaded graph.

For more information refer to the corresponding LSGDA paper.

Dominant language
Rust
Stars
1
Forks
1
No merged PRs in 30d

Contributor guide

No contributing guide indexed for this repository

First steps

  1. Read the whole issue, then the project's contributing guide.
  2. Comment on the issue to say you are picking it up — it saves two people doing the same work.
  3. Fork the repository and make your change on a branch.
  4. Open a pull request that references the issue number.

More from SparseLinearAlgebra/pathrex

All issues in SparseLinearAlgebra/pathrex

Similar issues

More Rust issues

Get new issues in your inbox

A short digest of beginner-friendly GitHub issues.