Reachability#
Info#
Full Name |
Reachability Regular Expression Template |
Class |
Regular |
Kind |
General |
Status |
designed — no data yet (real-world RPQ data will be provided later) |
Origin |
Grammar Parameters#
Parameter |
Description |
|---|---|
\(L_1, \dots, L_n\) |
The stored edge labels of the graph; there are no free parameters — the label set is derived from the graph |
Grammar Template#
Grammar Description#
The reachability template generates the language of all strings over the stored labels of the graph: a pair \((u, v)\) is reachable if some path from \(u\) to \(v\) is labeled by an arbitrary string over the label set — unrestricted reachability.
This is a designed stub: no real-world RPQ data exists yet. When the data is provided, the query file lives inside the self-contained graph archive under queries/rpq/ (see File structure).
Example Grammars#
The template instantiated for a graph with stored labels \(\{a, b\}\):
(a|b)*