This problem with graphs where both the nodes and the edges are labelled. The user provides the following input:
Your algorithm and implementation should determine whether there are any nodes m and n in the graph such that m is connected to n both by a path with edge labels following the sequence p, that is p[0], p[1], …, and also by a path with edge labels corresponding to the sequence q, that is q[0], q[1], …
See questions & answers.
You can deviate from the default recommendations; follow them just if you do not see any good reason not to.
The benchmark scenario has two parameters, query size m and graph size n. It can be generated using the graph benchmark scenario generator.
The recommendation is to consider scenarios where the typical input for g is a sparse graph. If in doubt, prefer directed graphs over undirected graphs.