MCFPQ

Release:

6.1.1

Date:

Oct 15, 2026

Multiple context-free path queries (MCFPQ) constrain the paths of a labeled graph by a multiple context-free language, generated by a multiple context-free grammar (MCFG). An MCFG nonterminal of arity \(k\) denotes \(k\) independent paths simultaneously; the start symbol always has arity one, so reachable pairs are defined exactly as for CFPQ. The graph catalog is shared across all query classes — the “Applicable graphs” list below cross-links the per-graph pages without duplicating them.

MCFG templates are stored in the .mcfg Datalog-like format, documented in the FLPQ design and read by mcfg_from_text. No MCFG templates have been added yet; they arrive together with the data, so this section has no template pages.

Applicable graphs

Graphs from the shared catalog that carry at least one MCFPQ query.

No MCFPQ queries have been added to the graph catalog yet.